<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T19:57:41Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/16972" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/16972</identifier><datestamp>2025-03-26T23:37:59Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Daudjee, Khuzaima</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="5e21d40b-0b88-498b-97d0-7f87918672cf" confidence="600">Langendoen, Kyle Jacob</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2021-05-12T16:03:52Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2021-09-10T04:50:17Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2021-05-12</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2021-05-04</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/16972</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Indexes for multidimensional data based on the R-Tree are popularly used by databases for a wide range of applications. Such index trees support point and range queries but are costly to construct over datasets of millions of points. We present the Non-Intersecting R-Tree (NIR-Tree), a novel insert-efficient, in-memory, multidimensional index that uses bounding polygons to provide twice as efficient point queries, and equivalent range query performance while indexing data up to an order of magnitude faster. The NIR-Tree leverages non-intersecting bounding polygons to reduce the number of nodes accessed during queries, compared to existing R-family indexes. Our experiments demonstrate that inserting into a NIR-Tree is 27x faster than the ubiquitous R*-Tree, and 1.2x faster than the Revised R*-Tree. Furthermore, point queries in the NIR-Tree complete 2.2x faster than in the R*-Tree, and 3.1x faster than in the Revised R*-Tree, while range queries execute just as quickly.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">index</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">multidimensional</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">tree</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">R-Tree</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">bounding polygon</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">bounding rectangle</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">range query</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">point query</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">spatial</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">A Non-Intersecting R-Tree</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">David R. Cheriton School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline" lang="en">Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Master of Mathematics</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms" lang="en">4 months</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Daudjee, Khuzaima</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>