NDLI: Towards a Painless Index for Spatial Objects

Content Provider	ACM Digital Library
Author	Stradling, Martin Huang, Jin Qi, Jianzhong Zhang, Rui
Copyright Year	2014
Abstract	Conventional spatial indexes, represented by the R-tree, employ multidimensional tree structures that are complicated and require enormous efforts to implement in a full-fledged database management system (DBMS). An alternative approach for supporting spatial queries is mapping-based indexing, which maps both data and queries into a one-dimensional space such that data can be indexed and queries can be processed through a one-dimensional indexing structure such as the $B^{+}.$ Mapping-based indexing requires implementing only a few mapping functions, incurring much less effort in implementation compared to conventional spatial index structures. Yet, a major concern about using mapping-based indexes is their lower efficiency than conventional tree structures. In this article, we propose a mapping-based spatial indexing scheme called Size Separation Indexing (SSI). SSI is equipped with a suite of techniques including size separation, data distribution transformation, and more efficient mapping algorithms. These techniques overcome the drawbacks of existing mapping-based indexes and significantly improve the efficiency of query processing. We show through extensive experiments that, for window queries on spatial objects with nonzero extents, SSI has two orders of magnitude better performance than existing mapping-based indexes and competitive performance to the R-tree as a standalone implementation. We have also implemented SSI on top of two off-the-shelf DBMSs, PostgreSQL and a commercial platform, both having R-tree implementation. In this case, SSI is up to two orders of magnitude faster than their provided spatial indexes. Therefore, we achieve a spatial index more efficient than the R-tree in a DBMS implementation that is at the same time easy to implement. This result may upset a common perception that has existed for a long time in this area that the R-tree is the best choice for indexing spatial objects.
Starting Page	1
Ending Page	42
Page Count	42
File Format	PDF
ISSN	03625915
e-ISSN	15574644
DOI	10.1145/2629333
Volume Number	39
Issue Number	3
Journal	ACM Transactions on Database Systems (TODS)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2014-10-07
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Spatial databases Mapping-based indexing Space-filling curves Window queries
Content Type	Text
Resource Type	Article
Subject	Information Systems

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

A motion-aware approach for efficient evaluation of continuous queries on 3D object databases

The B dual -Tree: indexing moving objects by space filling curves in the dual space

Towards a Painless Index for Spatial Objects †

A highly optimized algorithm for continuous intersection join queries over moving objects

Indexing for summary queries: Theory and practice

Using Unbalanced Trees for Indexing Multidimensional Objects

Indexing of spatiotemporal Data: A comparison between sweep and z-order space filling curves

Authenticated indexing for outsourced spatial databases

Object-based and image-based object representations

Towards a Painless Index for Spatial Objects

Similar Documents

A motion-aware approach for efficient evaluation of continuous queries on 3D object databases

The B dual -Tree: indexing moving objects by space filling curves in the dual space

Towards a Painless Index for Spatial Objects †

A highly optimized algorithm for continuous intersection join queries over moving objects

Indexing for summary queries: Theory and practice

Using Unbalanced Trees for Indexing Multidimensional Objects

Indexing of spatiotemporal Data: A comparison between sweep and z-order space filling curves

Authenticated indexing for outsourced spatial databases

Object-based and image-based object representations

Towards a Painless Index for Spatial Objects