Abstract
Once we build the model and index for moving objects, we can answer the queries for moving objects. There are many types of queries in moving objects databases such as the nearest neighbor (NN) query, range query, and density query. In this chapter, we will introduce the basic querying types for moving objects according to spatial predicates, temporal predicates, and moving spaces. Though there are many techniques to support moving objects queries, most of the existing studies consider Euclidean spaces, where the distance between two objects is determined solely by their relative position in space. However, in practice, objects can usually move only on a pre-defined set of trajectories as specified by the underlying network. Hence we will introduce how to answer range queries and NN queries for moving objects in a spatial network, which is based on the work of Papadias in [11].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arge L, Procopiuc O, Ramaswamy S, Suel T, Vitter JS (1998) Scalable Sweeping-Based Spatial Join. In: Proceedings of the 24th International Conference on Very Large Data Bases (VLDB 1998), New York City, USA, pp 570–581
Faloutsos C, Ranganathan M, Manolopoulos Y (1994) Fast Subsequence Matching in Time-Series Databases. In: Proceedings of the 1994 ACM SIGMOD International Conference on Management of Data (SIGMOD 1994), Minneapolis, Minnesota, USA, pp 419–429
Güting R, Bohlen M, Erwig M, Jensen C, Lorentzos N, Schneider M, Vazirgiannis M (2000) A Foundation for Representing and Querying Moving Objects. ACM Transactions on Database Systems 25(1):1–24
Hjaltason G, Samet H (1999) Distance Browsing in Spatial Databases. ACM Transactions on Database Systems 24(2):265–318
Hadjieleftheriou M, Kollios G, Gunopulos D, Tsotras VJ (2003) On-Line Discovery of Dense Areas in Spatio-Temporal Databases. In: Proceedings of the 8th International Symposium on Advances in Spatial and Temporal Databases (SSTD 2003), Santorini Island, Greece, pp 306–324
Jensen CS, Lin D, Ooi BC, Zhang R (2006) Effective Density Queries on Continuously Moving Objects. In: Proceedings of the 22nd international Conference on Data Engineering (ICDE 2006), Atlanta, Georgia, USA, pp 71
Kolahdouzan M, Shahabi C (2004) Voronoi-Based K Nearest Neighbor Search for Spatial Network Databases. In: Proceedings of the 30th International Conference on Very Large Data Bases (VLDB 2004), Toronto, Canada, pp 840–851
Kwon D, Lee SL, Lee S (2002) Indexing the Current Positions of Moving Objects Using the Lazy Update R-tree. In: Proceedings of the 3rd International Conference on Mobile Data Management (MDM 2003), Singapore, pp 113–120
Ni J, Ravishankar CV (2007) Pointwise-Dense Region Queries in Spatio-Temporal Databases. In: Proceedings of the 23rd International Conference on Data Engineering (ICDE 2007), Istanbul, Turkey, pp 1066–1075
Papadopoulos A, Rigaux P, Scholl MA (1999) Performance Evaluation of Spatial Join Processing Strategies. In: Proceedings of the 6th International Symposium on Advances in Spatial Databases (SSD 1999), Hong Kong, China, pp 286–307
Papadias D, Zhang J, Mamoulis N, Tao Y (2003) Query Processing in Spatial Network Databases. In: Proceedings of the 29th International Conference on Very Large Data Bases (VLDB 2003), Berlin, Germany, pp 790–801
Roussopoulos N, Kelley S, Vincent F (1995) Nearest Neighbor Queries. In: Proceedings of the 1995 ACMSIGMOD International Conference on Management of Data (SIGMOD 1995), San Jose, California, USA, pp 71–79
Rigaux P, Scholl M, Voisard A (2002) Spatial Databases: with Application to GIS. Morgan Kaufmann Publishers Inc
Seidl T, Kriegel H (1998) Optimal Multi-Step K-Nearest Neighbor Search. In: Proceedings of the 1998 ACMSIGMOD International Conference on Management of Data (SIGMOD 1998), Seattle, Washington, USA, pp 154–165
Patel JM, Chen Y, Chakka VP (2004) STRIPES: An Effcient Index for Predicted Trajectories. In: Proceedings of the 2004 ACMSIGMOD International Conference on Management of Data (SIGMOD 2004), Paris, France, pp 637–646
Pfoser D, Jensen CS, Theodoridis Y (2000) Novel Approaches in Query Processing for Moving Object Trajectories. In: Proceedings of the 26th International Conference on Very Large Data Bases (VLDB 2000), Cairo, Egypt, pp 395–406
Yiu ML, Mamoulis N, Papadias D (2005) Aggregate Nearest Neighbor Queries in Road Networks. IEEE Transactions on Knowledge and Data Engineering 17(6):820–833
Yiu ML, Papadias D, Mamoulis N, Tao Y (2006) Reverse Nearest Neighbors in Large Graphs. IEEE Transactions on Knowledge and Data Engineering 18(4):540–553
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2010 Tsinghua University Press, Beijing and Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Meng, X., Chen, J. (2010). Moving Objects Basic Querying. In: Moving Objects Management. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13199-8_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-13199-8_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13198-1
Online ISBN: 978-3-642-13199-8
eBook Packages: Computer ScienceComputer Science (R0)