Space-efficient representations of rectangle datasets supporting orthogonal range querying
Authors:
- Nieves R. BrisaboaNBNieves R. Brisaboa
- Miguel R. LuacesMLMiguel R. Luaces
- Gonzalo NavarroGNGonzalo Navarro
- Diego SecoDSDiego Seco
- 1 July 2013
- journal article
- research article
- Published by Elsevier in Information Systems
- Vol. 38 (5) , 635-655
Abstract
No abstract availableKeywords
This publication has 31 references indexed in Scilit:
- Range Queries over a Compact Representation of Minimum Bounding Rectangles2010
- A Fun Application of Compact Data Structures to Indexing Geographic Data2010
- Orthogonal range searching in linear and almost-linear spaceComputational Geometry, 2009
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing2009
- Geographical information retrievalInternational Journal of Geographical Information Science, 2008
- Optimizing multidimensional index trees for main memory accessACM SIGMOD Record, 2001
- Optimal Dynamic Range Searching inNon-replicating Index StructuresLecture Notes in Computer Science, 1999
- Multidimensional access methodsACM Computing Surveys, 1998
- A Functional Approach to Data Structures and Its Use in Multidimensional SearchingSIAM Journal on Computing, 1988
- Multidimensional binary search trees used for associative searchingCommunications of the ACM, 1975