IB-CBB: an improved spatial index considering intersection based on clipped bounding boxes

References

• Beckmann, N., H. P. Kriegel, R. Schneider, and B. Seeger. 1990. “The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles.” Proceedings of the 1990 ACM SIGMOD international conference on Management of data, June, 1990, Atlantic City, New Jersey, USA, 322–331. New York, NY, USA: Association for Computing Machinery. https://doi.org/10.1145/93597.98741.
   Google Scholar
• Beckmann, N., and B. Seeger. 2008. A Benchmark for Multidimensional Index Structures. Accessed March 22, 2024. https://www.mathematik.uni-marburg.de/~seeger/rrstar/index.html.
   Google Scholar
• Borzsony, S., D. Kossmann, and K. Stocker. 2001. “The skyline operator.” Proceedings 17th International Conference on Data Engineering, April 2-6, 2001, Heidelberg, Germany, 421–430. Los Alamitos, CA, USA: IEEE Computer Society. https://doi.org/10.1109/ICDE.2001.914855.
   Google Scholar
• Brisaboa, N. R., S. Ladra, and G. Navarro. 2009. ”k2-Trees for Compact Web Graph Representation.” String Processing and Information Retrieval, August 25-27, 2009, Saariselkä, Finland, 18–30. Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-03784-9_3.
   Google Scholar
• Chakka, V. P., A. Everspaugh, and J. M. Patel. 2003. Proceedings of First Biennial Conference on Innovative Data Systems Research, January 5–8, 2003, Asilomar, CA, USA. http://www-db.cs.wisc.edu/cidr/cidr2003/program/p15.pdf.
   Google Scholar
• Esche, M., A. Glantz, A. Krutz, M. Tok, and T. Sikora. 2012. “Quadtree-based temporal trajectory filtering.” 2012 19th IEEE International Conference on Image Processing, Orlando, FL, USA, 1553–1556. IEEE Xplore. https://doi.org/10.1109/ICIP.2012.6467169.
   Google Scholar
• Evagorou, G., and T. Heinis. 2021. “Mambo-indexing dead space to accelerate spatial queries.” 33rd International Conference on Scientific and Statistical Database Management, Tampa, FL, USA, 73–84. New York, NY, USA: Association for Computing Machinery. https://doi.org/10.1145/3468791.3468804.
   Google Scholar
• Graefe, G., and H. Kuno. 2011. “Modern b-tree techniques.”2011 IEEE 27th International Conference on Data Engineering, Hannover, Germany, 1370–1373. IEEE Xplore. https://doi.org/10.1109/ICDE.2011.5767956.
   Google Scholar
• Guttman, A. 1984. “R-Trees: A Dynamic Index Structure for Spatial Searching.” Proceedings of the 1984 ACM SIGMOD international conference on Management of data, Boston, Massachusetts, 47–57. New York, NY, USA: Association for Computing Machinery. https://doi.org/10.1145/971697.602266.
   Google Scholar
• Jun, B., B. Hong, and B. Yu. 2003. “Dynamic Splitting Policies of the Adaptive 3DR-Tree for Indexing Continuously Moving Objects.” International Conference on Database and Expert Systems Applications, September 1-5, 2003, Prague, Czech Republic, 308–317. Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-540-45227-0_31.
   Google Scholar
• Kalyvas, C., and T. Tzouramanis. 2017. “A Survey of Skyline Query Processing.” https://arxiv.org/abs/1704.01788.
   Google Scholar
• Kim, K. C., and S. W. Yun. 2004. Web and Wireless Geographical Information Systems, November 26-27, 2004, Goyang, Korea, 167–180. Berlin, Heidelberg: Springer. https://doi.org/10.1007/11427865_13.
   Google Scholar
• Langendoen, K., B. Glasbergen, and K. Daudjee. 2021. “NIR-Tree: A Non-Intersecting R-Tree.” 33rd International Conference on Scientific and Statistical Database Management, July 6-7, 2021, Tampa, FL, USA, 157–168. New York, NY, USA: Association for Computing Machinery. https://doi.org/10.1145/3468791.3468818.
   Google Scholar
• Li, G., and J. Tang. 2010. “A New HR-Tree Index Based on Hash Address.” 2010 2nd International Conference on Signal Processing Systems, July 5-7, 2010, Dalian, China, V3-35-V3–38. IEEE Xplore. https://doi.org/10.1109/ICSPS.2010.5555818.
   Google Scholar
• Li, G., and J. Tang. 2011. “A New R-Tree Spatial Index Based on Space Grid Coordinate Division.” Proceedings of the 2011, International Conference on Informatics, Cybernetics, and Computer Engineering (ICCE2011), November 19-20, 2011, Melbourne, Australia, 133–140. Berlin, Heidelberg: Springer. https://doi.org/10.1007/978-3-642-25188-7_16.
   Google Scholar
• Mahmood, A. R., S. Punni, and W. G. Aref. 2019. “Spatio-Temporal Access Methods: A Survey (2010-2017).” GeoInformatica 23 (1): 1–36. https://doi.org/10.1007/s10707-018-0329-2.
   Web of Science ®Google Scholar
• Pfoser, D., C. S. Jensen, and Y. Theodoridis. 2000. Novel Approaches in Query Processing for Moving Object Trajectories Proceedings of the 26th International Conference on Very Large Data Bases, September 10-14, 2000, 395–406. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.
   Google Scholar
• Romero, M., N. Brisaboa, and M. A. Rodrguez. 2012. “The Smo-Index: A Succinct Moving Object Structure for Timestamp and Interval Queries.” Proceedings of the 20th International Conference on Advances in Geographic Information Systems, November 6-9, 2012, Redondo Beach, California, 498–501. New York, NY, USA: Association for Computing Machinery. https://doi.org/10.1145/2424321.2424399.
   Google Scholar
• Sellis, T., N. Roussopoulos, and C. Faloutsos. 1987. The R+ -Tree: A Dynamic Index for Multi-Dimensional Objects. Technica Report. http://hdl.handle.net/1903/4541.
   Google Scholar
• Sidlauskas, D., S. Chester, E. T. Zacharatou, and A. Ailamaki. 2018. “Improving spatial data processing by clipping minimum bounding boxes.” 2018 IEEE 34th International Conference on Data Engineering (ICDE), April 16-19, 2018, Paris, France, 425–436. IEEE Xplore. https://doi.org/10.1109/ICDE.2018.00046.
   Google Scholar
• Son, W., F. Stehn, C. Knauer, and H. K. Ahn. 2017. “Top-k Manhattan spatial skyline queries.” Information Processing Letters 123:27–35. https://doi.org/10.1016/j.ipl.2017.03.003.
   Web of Science ®Google Scholar
• Tao, Y., and D. Papadias. 2001. “The MV3R-Tree: A Spatio-Temporal Access Method for Timestamp and Interval Queries.” Proceedings of Very Large Data Bases Conference (VLDB), September 11-14, 2001, Roma, Italy, 431–440. San Francisco, CA, USA: Morgan Kaufmann Publishers Inc.
   Google Scholar
• Wang, S., D. Maier, and B. C. Ooi. 2016. “Fast and Adaptive Indexing of Multi-Dimensional Observational Data.” Proceedings of the VLDB Endowment 9 (14): 1683. https://doi.org/10.14778/3007328.3007334.
   Google Scholar
• Wang, L., and Q. Xu. 2010. “Gps-Free Localization Algorithm for Wireless Sensor Networks.” Sensors 10 (6): 5899–5926. https://doi.org/10.3390/s100605899.
   PubMed Web of Science ®Google Scholar
• Zäschke, T., C. Zimmerli, and M. C. Norrie. 2014. “The Ph-Tree: A Space-Efficient Storage Structure and Multi-Dimensional Index.” Proceedings of the 2014 ACM SIGMOD international conference on Management of data, June 22-27, 2014, Snowbird, Utah, USA, 397–408. New York, NY, USA: Association for Computing Machinery. https://doi.org/10.1145/2588555.2588564.
   Google Scholar