Journals / Harita Dergisi / 2007 / Cilt: 73 - Sayı: 138

Spatial access methods

Konumsal erişim yöntemleri

Pages
84–99
DOI
—
🏛️Bibliographic metadata and full text access for this article are provided via DergiPark.
DergiPark Record ↗
✨

AI Summary & Key Takeaways

AI Insight
⚡ TL;DR(Too Long; Didn't Read)

In this survey article all these requirements and some interesting and valuable indexing structures and methods around them are explored.

📌 3 Key Takeaways

🎯
Objective & Hypothesis:Due to the fact that expansion of spatial content volume in parallel with rapidly increase in the use of spatial data acquisition and capturing tools has caused to bring effective use of spatial databases beyond conventional methods to the attention of database community.
📊
Key Findings & Data:In order to provide effectively access to spatial data, multidimensional indexing structures become a de facto requirement.
💡
Conclusion & Impact:In this survey article all these requirements and some interesting and valuable indexing structures and methods around them are explored.
🔬Design:Survey & Empirical Study
📍Scope:Comprehensive Sample
⚙️Variables:Domain Parameters

Abstract

Due to the fact that expansion of spatial content volume in parallel with rapidly increase in the use of spatial data acquisition and capturing tools has caused to bring effective use of spatial databases beyond conventional methods to the attention of database community. In order to provide effectively access to spatial data, multidimensional indexing structures become a de facto requirement. Since spatial accessing methods are of core subjects of computer science, new methods or extensions have been continously proposed and pave themselves the way for many application areas. Despite of many new things about these methods there are some static requirements about them such as plausable time and space complexity. In this survey article all these requirements and some interesting and valuable indexing structures and methods around them are explored.

Özet

Otomatik konumsal veri toplama araçlarının kullanımının hızlıca artmasına paralel olarak konumsal içeriklerinin hacim olarak genişlemesi, geleneksel yöntemlerin ötesinde konumsal veritabanlarının etkin kullanılabilmesini gündeme getirmiştir. Konumsal verilere etkin erişim için, hızlı ve doğru sonuçlar üreten dizinleme yapılarının gerekliliği kaçınılmazdır. Konumsal erişim yöntemleri bilgisayar bilimlerinin çekirdek konularından birisini teşkil ettiğinden dolayı, yeni yöntemler veya yöntem eniyileştirmeleri devamlı önerilmekte ve birçok alanda kendisine uygulama bulmaktadır. Yeni yöntem önermede, değişmeyen ister konumsal erişim yöntemlerinin zaman ve uzay karmaşıklığının belli seviyelerde tutulmasıdır. Bu derleme makalede tüm bu gereksinimler ve bu gereksinimler sonucunda ortaya çıkmış bulunan bazı dizinleme yapıları ve yöntemleri incelenmektedir.

🔖

Cite This Article

SEVER, H., GÜRÇAY, H., AK, S. (2007). Spatial access methods. Harita Dergisi, Cilt: 73 - Sayı: 138, 84–99. https://ajindex.com/articles/267723

References (9)

  1. Beckmann, N., Kriegel, H. P., Schneider, R., Seeger, B., 1996, The R*-tree: An Efficient and Robust Access Method for Points and Rectangles. ACM SIGMOD International Conference on Data Management, Atlantic City, N.J., Haziran, s. 322-331
  2. Carson, G.S. 2000,
  3. Spatial Standardization, ACM SIGGRAPH Computer Graphics, 34(3): 38-41.
  4. Cementini, E., Felice, P. D., 2000, Spatial Operators. ACM SIGMOD Record, 29, No.3 Egenhofer, M. J. & Franzosa, R. D., 1991, Point-Set Topological spatial relations, International Journal for Geographical Information Systems, 5(2): 161-174.
  5. Gaede, V., Günther, O., 1998, Multidimensional Access Methods. ACM Computing Surveys, 30, No.2. Guting, R. H., 1994, An Introduction to Spatial Database Systems. VLDB Journal, 3,357-399.
  6. Guting, R. H. And Schneider, M., 1993, M. Realms: A foundation for spatial data types in database systems. Proceedings of the Third International Symposium on Large Spatial Databases, Singapore. Guting, R. H. And Schneider, M., 1995, Realm-Based Spatial Data Types: The ROSE Algebra. VLDB Journal, 4(2):243--286. Kedem, G., 1982, The Quad-CIF tree: a data structure for hierarchical on-line algorithms, Proceedings of the Nineteenth Design Automation Conference, Las Vegas, June 1982, 352-357.
  7. Lee, M., Samet, H., 2000, Navigating Through Triangle Meshes Implemented as Linear Quadtrees. ACM Transactions on Graphics, 19, No.2 Ooi, B., Tan, K., 2001, B Trees: Bearing Trees of All Kinds. Conferences in Research and Practice in Information Technology, Melbourne, Avustralya, 5 Open Geospatial Consortium (OGC), 2003, OGC Reference Model. OGC 03-040; Version: 0.1.3 (2005) (Çevrimiçi: http://www.opengis.org, Erişim Tarihi: 14.01.2005)
  8. Rigaux, P., Scholl, M., Voisard, A., 2002, Spatial Databases. Morgan Kaufmann Publishers Salzberg, B., 1996, Access Methods. ACM Computing Surveys, 28, No.1 Samet, H., 1984,The Quadtree and Related Hierarchical Data Structures. ACM Computing Surveys, 16, No.2. Sheng, J., Sheng, Ö., 1990, R-Trees for Large Geographic Information Systems in a Multi-User Environment. System Sciences, 2 Venkateswaran, J., Subramanya, S. R., 2006, Schemes for SR-Tree Packing. SAC'06, Dijon, Fransa, 23-27
  9. Haziran Yu, B., Orlandic, R., Evens, M., 1999, Simple QSF-Trees: An Efficient and Scalable Spatial Access Method. CIKM'99, Kansas City, A.B.D.