Skip to main content
SpringerLink
Log in

TOF: A Throughput Oriented Framework for Spatial Queries Processing in Multi-core Environment

  • Conference paper
  • First Online:
Book cover Database Systems for Advanced Applications (DASFAA 2015)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 9050))

Included in the following conference series:

  • 1750 Accesses

Abstract

In this paper, we develop a Throughput Oriented Framework (TOF) for efficient processing of spatiotemporal queries in multi-core environment. Traditional approaches to spatial query processing were focused on reduction of query latency. In real world, most LBS applications emphasize throughput rather than query latency. TOF is designed to achieve maximum throughput. Instead of resorting to complex indexes, TOF chooses to execute a batch queries at each run, so it can maximize data locality and parallelism on multi-core platforms. Using TOF, we designed algorithms for processing range queries and kNN queries respectively. Experimental study shows that these algorithms outperform the existing approaches significantly in terms of throughput.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Biveinis, L., Saltenis, S., Jensen, C.S.: Main-memory operation buffering for efficient R-tree update. In: 33rd International Conference on Very Large Data Bases, pp. 591–602. Vienna, Austria (2007)

    Google Scholar 

  2. Yiu, M.L., Tao, Y., Mamoulis, N.: The \(B^{dual}\)-Tree: indexing moving objects by space filling curves in the dual space. In: 34rd International Conference on Very Large Data Bases, pp. 379–400. New Zealand (2008)

    Google Scholar 

  3. Zhang, J., Zhu, M., Papadias, D.: Location-based spatial queries. In: 2003 ACM SIGMOD International Conference on Management of Data, pp. 443–454. California (2003)

    Google Scholar 

  4. Chen, Y.J., Chuang, K.T., Chen, M.S.: Spatial-temporal query homogeneity for KNN object search on road networks. In: 22nd ACM International Conference on Information Knowledge Management, pp. 1019–1028. ACM (2013)

    Google Scholar 

  5. http://ark.intel.com/zh-cn/products/75258/Intel-Xeon-Processor-E7-8890-v2-37_5M-Cache-2_80-GHz

  6. Cagri, B., Gustavo, A., Jens, T., Özsu, M.T.: Main-Memory Hash Joins on Modern Processor Architectures. In: IEEE Transactions on Knowledge and Data Engineering, IEEE Press (2014)

    Google Scholar 

  7. Manegold, S., Boncz, P., Kersten, M.: Optimizing main-memory join on modern hardware. In: IEEE Transactions on Knowledge and Data Engineering, pp. 709–730. IEEE Press (2002)

    Google Scholar 

  8. Dittrich, J., Blunschi, L., Vaz Salles, M.A.: Indexing Moving Objects Using Short-Lived Throwaway Indexes. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds.) SSTD 2009. LNCS, vol. 5644, pp. 189–207. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  9. Yu, X., Pu, K.Q., Koudas, N.: Monitoring k-nearest neighbor queries over moving objects. In: 21st International Conference on Data Engineering, pp. 631–642. IEEE Press, Tokyo (2005)

    Google Scholar 

  10. Dittrich, J., Blunschi, L., Salles, M.A.V.: MOVIES: indexing moving objects by shooting index images. Geoinformatica 15(4), 727–767 (2011)

    Article  Google Scholar 

  11. Harizopoulos, S., Liang, V., Abadi, D.J., Madden, S.: Performance tradeoffs in read-optimized databases. In: 32nd International Conference on Very Large Databases, pp. 487–498. VLDB Endowment, Seoul (2006)

    Google Scholar 

  12. Hilbert, D.: Ueber die stetige Abbildung einer Line auf ein Flichenstck. Mathematische Annalen 38. 3, pp. 459–460. IEEE (1891)

    Google Scholar 

  13. Orenstein, J.A., Merrett, T.H.: A class of data structures for associative searching. In: 3rd ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, pp. 181–190. ACM (1984)

    Google Scholar 

  14. Tropf, H., Herzog, H.: Multidimensional Range Search in Dynamically Balanced Trees. ANGEWANDTE INFO (2), pp. 71–77. IEEE (1981)

    Google Scholar 

  15. Šidlauskas, D., Ross, K.A., Jensen, C.S., Šaltenis, S.: Thread-level parallel indexing of update intensive moving-object workloads. In: Pfoser, D., Tao, Y., Mouratidis, K., Nascimento, M.A., Mokbel, M., Shekhar, S., Huang, Y. (eds.) SSTD 2011. LNCS, vol. 6849, pp. 186–204. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  16. idlauskas, D., altenis, S., Jensen, C.S.: Parallel main-memory indexing for moving-object query and update workloads. In: 2012 ACM SIGMOD International Conference on Management of Data, pp. 37–48. ACM, Scottsdale (2012)

    Google Scholar 

  17. Xiong, X., Mokbel, M.F., Aref, W.G.: SEA-CNN: scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In: 21st International Conference on Data Engineering, pp. 675–686. IEEE Press, Tokyo (2005)

    Google Scholar 

  18. Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual partitioning: an efficient method for continuous nearest neighbor monitoring. In: 2005 ACM SIGMOD International Conference on Management of Data, pp. 634–645. ACM, Baltimore (2005)

    Google Scholar 

  19. Brinkhoff, T.: A framework for generating network-based moving objects. GeoInformatica 6(2), 153–180 (2002)

    Article  MATH  Google Scholar 

  20. Manegold, S., Boncz, P., Kersten, M.: Optimizing main-memory join on modern hardware. IEEE Transactions on Knowledge and Data Engineering, 709–730. Springer (2002)

    Google Scholar 

  21. http://www.cs.umd.edu/mount/ANN/

Download references

Author information

Authors and Affiliations

  1. MOE Key Laboratory of DEKE, Renmin University of China, Beijing, 100872, China

    Zhong-Bin Xue, Xuan Zhou & Shan Wang

  2. School of Information, Renmin University of China, Beijing, 100872, China

    Zhong-Bin Xue, Xuan Zhou & Shan Wang

Authors
  1. Zhong-Bin Xue
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xuan Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shan Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Xuan Zhou .

Editor information

Editors and Affiliations

  1. Universität München, München, Germany

    Matthias Renz

  2. University of Southern California, Los Angeles, USA

    Cyrus Shahabi

  3. University of Queensland, Brisbane, Australia

    Xiaofang Zhou

  4. Monash University, Clayton, Australia

    Muhammad Aamir Cheema

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Xue, ZB., Zhou, X., Wang, S. (2015). TOF: A Throughput Oriented Framework for Spatial Queries Processing in Multi-core Environment. In: Renz, M., Shahabi, C., Zhou, X., Cheema, M. (eds) Database Systems for Advanced Applications. DASFAA 2015. Lecture Notes in Computer Science(), vol 9050. Springer, Cham. https://doi.org/10.1007/978-3-319-18123-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-18123-3_15

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-18122-6

  • Online ISBN: 978-3-319-18123-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation