Skip to main content

Indexing

  • 448 Accesses

Synonyms

Big spatial data access methods; Indexing big spatial data

Definitions

Consider a set of n data objects O = {o 1, o 2, …, o n }. Each object is associated with a d-dimensional vector representing its coordinate in a d-dimensional space (\(d \in \mathbb {N_+}\)). Indexing such a set of data is to organize the data in a way that provides fast access to the data, for processing spatial queries such as point queries, range queries, kNN queries, spatial join queries, etc.

Overview

The rapid growth of location-based services (LBS) has accumulated a massive amount of spatial data such as user GPS coordinates, which calls for efficient indexing structures to provide fast access to such data. Typical applications of spatial data include digital mapping services and location-based social networks, where spatial queries are issued by users such as finding restaurants within 3 kilometers around Alice or finding other users within 300 meters around Alice. Spatial indices have been studied...

This is a preview of subscription content, log in via an institution.

References

  • Achakeev D, Seidemann M, Schmidt M, Seeger B (2012) Sort-based parallel loading of r-trees. In: Proceedings of the 1st ACM SIGSPATIAL international workshop on analytics for big geospatial data, pp 62–70

    Google Scholar 

  • Agarwal PK, Fox K, Munagala K, Nath A (2016) Parallel algorithms for constructing range and nearest-neighbor searching data structures. In: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI symposium on principles of database systems (PODS), pp 429–440

    Google Scholar 

  • Aji A, Wang F, Vo H, Lee R, Liu Q, Zhang X, Saltz J (2013) Hadoop gis: a high performance spatial data warehousing system over mapreduce. Proc VLDB Endow 6(11):1009–1020

    Article  Google Scholar 

  • Aly AM, Mahmood AR, Hassan MS, Aref WG, Ouzzani M, Elmeleegy H, Qadah T (2015) Aqwa: adaptive query workload aware partitioning of big spatial data. Proc VLDB Endow 8(13):2062–2073

    Article  Google Scholar 

  • Eldawy A, Mokbel MF (2013) A demonstration of spatialhadoop: an efficient mapreduce framework for spatial data. Proc VLDB Endow 6(12):1230–1233

    Article  Google Scholar 

  • Finkel RA, Bentley JL (1974) Quad trees a data structure for retrieval on composite keys. Acta Informatica 4(1):1–9

    Article  MATH  Google Scholar 

  • Gaede V, Günther O (1998) Multidimensional access methods. ACM Comput Surv 30(2):170–231

    Article  Google Scholar 

  • Guttman A (1984) R-trees: a dynamic index structure for spatial searching. In: Proceedings of the 1984 ACM SIGMOD international conference on management of data (SIGMOD), pp 47–57

    Google Scholar 

  • Hagedorn S, Götze P, Sattler K (2017) Big spatial data processing frameworks: feature and performance evaluation. In: Proceedings of the 20th international conference on extending database technology (EDBT), pp 490–493

    Google Scholar 

  • Hsu YT, Pan YC, Wei LY, Peng WC, Lee WC (2012) Key formulation schemes for spatial index in cloud data managements. In: 2012 IEEE 13th international conference on mobile data management (MDM), pp 21–26

    Google Scholar 

  • Jagadish HV, Ooi BC, Tan KL, Yu C, Zhang R (2005) Idistance: an adaptive b+-tree based indexing method for nearest neighbor search. ACM Trans Database Syst 30(2):364–397

    Article  Google Scholar 

  • Koudas N, Faloutsos C, Kamel I (1996) Declustering spatial databases on a multi-computer architecture. In: Proceedings of the 5th international conference on extending database technology: advances in database technology (EDBT), pp 592–614

    Google Scholar 

  • Li C, Gu Y, Qi J, Zhang R, Yu G (2015) A safe region based approach to moving KNN queries in obstructed space. Knowl Inf Syst 45(2):417–451

    Article  Google Scholar 

  • Lomet D, Hong M, Nehme R, Zhang R (2008) Transaction time indexing with version compression. Proc VLDB Endow 1(1):870–881

    Article  Google Scholar 

  • Nishimura S, Das S, Agrawal D, Abbadi AE (2011) Md-hbase: a scalable multi-dimensional data infrastructure for location aware services. In: Proceedings of the 2011 IEEE 12th international conference on mobile data management (MDM), vol 01, pp 7–16

    Google Scholar 

  • Orenstein JA, Merrett TH (1984) A class of data structures for associative searching. In: Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on principles of database systems (PODS), pp 181–190

    Google Scholar 

  • Papadopoulos A, Manolopoulos Y (2003) Parallel bulk-loading of spatial data. Parallel Comput 29(10): 1419–1444

    Article  MathSciNet  Google Scholar 

  • Schnitzer B, Leutenegger ST (1999) Master-client r-trees: a new parallel r-tree architecture. In: Proceedings of the 11th international conference on scientific and statistical database management (SSDBM), pp 68–77

    Google Scholar 

  • Ward PGD, He Z, Zhang R, Qi J (2014) Real-time continuous intersection joins over large sets of moving objects using graphic processing units. VLDB J 23(6):965–985

    Article  Google Scholar 

  • Xie D, Li F, Yao B, Li G, Zhou L, Guo M (2016) Simba: efficient in-memory spatial analytics. In: Proceedings of the 2016 SIGMOD international conference on management of data (SIGMOD), pp 1071–1085

    Google Scholar 

  • You S, Zhang J, Gruenwald L (2015) Large-scale spatial join query processing in cloud. In: Proceedings of the 31st IEEE international conference on data engineering workshops, pp 34–41

    Google Scholar 

  • Yu J, Wu J, Sarwat M (2015) Geospark: a cluster computing framework for processing large-scale spatial data. In: Proceedings of the 23rd SIGSPATIAL international conference on advances in geographic information systems (SIGSPATIAL), pp 70:1–70:4

    Google Scholar 

  • Zhang R, Ooi BC, Tan KL (2004) Making the pyramid technique robust to query types and workloads. In: Proceedings of the 20th international conference on data engineering (ICDE), pp 313–324

    Google Scholar 

  • Zhang R, Qi J, Lin D, Wang W, Wong RC (2012) A highly optimized algorithm for continuous intersection join queries over moving objects. VLDB J 21(4):561–586

    Article  Google Scholar 

  • Zhang R, Qi J, Stradling M, Huang J (2014) Towards a painless index for spatial objects. ACM Trans Database Syst 39(3):19:1–19:42

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Rui Zhang .

Editor information

Editors and Affiliations

Section Editor information

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG

About this entry

Check for updates. Verify currency and authenticity via CrossMark

Cite this entry

Qi, J., Zhang, R. (2018). Indexing. In: Sakr, S., Zomaya, A. (eds) Encyclopedia of Big Data Technologies. Springer, Cham. https://doi.org/10.1007/978-3-319-63962-8_217-1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-63962-8_217-1

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-63962-8

  • Online ISBN: 978-3-319-63962-8

  • eBook Packages: Springer Reference MathematicsReference Module Computer Science and Engineering

Publish with us

Policies and ethics

Chapter history

  1. Latest

    Indexing
    Published:
    15 June 2022

    DOI: https://doi.org/10.1007/978-3-319-63962-8_217-2

  2. Original

    Indexing
    Published:
    08 February 2018

    DOI: https://doi.org/10.1007/978-3-319-63962-8_217-1