Skip to main content
Log in

A new directional query method for polygon dataset in spatial database

  • Research Article
  • Published:
Earth Science Informatics Aims and scope Submit manuscript

Abstract

Directional query is critical in many domains, especially in geographic information systems (GIS), which are also frequently used as selection conditions in spatial queries. In this paper, we explore the processing of directional queries based on MRD-tree and open shape model. The interior node of MRD-tree contains not only index entries but also data entries, where the data entry contains the pointer of actual spatial object in disk, the maximum boundary rectangle (MBR) and the maximum enclosed circle (MEC) of the spatial data object. And open shape model converts the processing of the direction predicates into the processing of topological operations between open shapes and closed geometry objects. So a number of spatial objects were excluded immensely to compute during the filter step, and it is unnecessary to know the boundary of the embedding world and also eliminates the computation related to the world boundary. Our experimental evaluation shows that directional query based on MRD-tree Index and open shape model consistently outperforms classical directional queries based on R-tree and range model while the degree of performance improvement varies by several parameters.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18
Fig. 19

Similar content being viewed by others

References

  • Al-Badarneh AF, Al-Alaj AS, Mahafzah BA (2013) Multi Small Index (MSI): a spatial indexing structure. J Inf Sci 39(5):643–660

    Article  Google Scholar 

  • Beckmann N, Kriegel HP, Schneider R, Seeger B (1990) The R*-tree: an efficient and robust access method for points and rectangles, In Proc. of ACM SIGMOD Int. Conf. on Management of Data, Atlantic City, pp. 322–331, 1990

  • Dai J, Wu MG, Zheng PB, Wang L, Cui DJ, Chen TS (2014) An improved STR-tree spatial index algorithm based on Hilbert-curve. Geomatics Inf Sci Wuhan Univ 39(7):777–781

  • Fu ZL, Liu SY (2012) MR-tree with Voronoi Diagrams for parallel spatial queries. Geomatics Inf Sci Wuhan Univ 37(12):1490–1494

    Google Scholar 

  • Fu YC, Shu YQ, Yuan XX (2007) Spatial direction relations queries based on conic-bintree index. J Harbin Inst Technol 14(2):72–77

    Google Scholar 

  • Fuchs H, Kedem Z, Naylor B (1980) On visible surface generation by a priori tree structures. Comput Graph 14(3):124–133

    Article  Google Scholar 

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

    Article  Google Scholar 

  • Goyal R, Egenhofer M (1997) The direction relation matrix: a representation of direction relations for extended spatial objects, Proc. UCGIS Ann. Assembly and Summer Retreat, pp. 65–74, 1997

  • Goyal R, Egenhofer MJ (2000) Consistent queries over cardinal directions across different levels of detail, Proceedings of the 11th International Workshop on Database and Expert Systems Applications, pp. 876–880, 2000

  • Guttman A (1984) R-trees: a dynamic index structure for spatial searching, In Proc. of ACM SIGMOD Int. Conf. on Management of Data, pp. 47–57, 1984

  • He ZW, Kraak MJ, Huisman O, Ma XG, Xiao J (2013) Parallel indexing technique for spatio-temporal data. ISPRS J Photogramm Remote Sens 78:116–128

    Article  Google Scholar 

  • Korotkov A (2012) A new double sorting-based node splitting algorithm for R-tree. Program Comput Softw 38(3):109–118

    Article  Google Scholar 

  • Li GL, Feng JH, Xu J (2012) DESKS: direction-aware spatial keyword search, International Conference on Data Engineering, pp. 474–485, 2012

  • Li FF, Yao B, Tang MW (2013) Spatial approximate string search. IEEE Trans Knowl Data Eng 25(6):1394–1409

    Article  Google Scholar 

  • Liu X, Shashi S, Sanjay C (2003) Object-based directional query processing in spatial databases. IEEE Trans Knowl Data Eng 15(2):295–304

    Article  Google Scholar 

  • Liu YS, Gao SW, Wang DC, Wei CC (2009) Open shape model based on absolute frame in three-dimensional space. ICIC Express Lett 3(3):599–605

    Google Scholar 

  • Liu YS, Ren ZQ, Hao TB, Zheng DD (2010) A research on the spatial query method based on the combination of direction and distance relations. J Inf Comput Sci 7(14):3161–3168

    Google Scholar 

  • Nievergelt J, Hinterberger H, Sevcik KC (1984) The grid file: an adaptable, symmetricmultikey file structure. ACM Trans Database Syst 9(1):38–71

    Article  Google Scholar 

  • Papadias D, Theodoridis Y, Sellis T (1994) The retrieval of direction relations using R-trees, Proc. Fifth Conf. Database and Expert Systems Applications (DEXA), pp. 173–182, 1994

  • Papadias D, Egenhofer M, Sharma J (1996) Hierarchical reasoning about direction relations, Proc. Fourth ACM Workshop Advances in Geographic Information Systems, pp. 105–112, 1996

  • Sellis TK, Roussopoulos N, Faloutsos C (1987) The R+−tree: a dynamic index for multi-dimensional objects, In Proc. of the 13th Int. Conf. on Very Large Data Bases, pp. 507–518, 1987

  • Shekhar S, Ravada S, Fetterer A, Liu X, Lu CT (1999) Spatial Databases: accomplishments and research needs. IEEE Trans Knowl Data Eng 11(1):45–55

    Article  Google Scholar 

  • Shi J, Liu YS (2007) Quantitative direction relations query technology based on open shape. Comput Eng 33(22):89–94

    Google Scholar 

  • Skiadopoulos S, Giannoukos C, Sarkas N et al (2005) Computing and managing cardinal direction relations. IEEE Trans Knowl Data Eng 17(12):1610–1623

    Article  Google Scholar 

  • Sleit A, Al-Nsour E (2014) Corner-based splitting: an improved node splitting algorithm for R-tree. J Inf Sci 40(2):222–236

    Article  Google Scholar 

  • Sun HL, Ceng R (2005) Representation of direction relations and the retrieve of such relations based on R-tree. J Qiqihar Univ 21(2):46–50

    Google Scholar 

  • Tanin NN (2006) The RD-tree allowing data in interior nodes of the R-tree, The 2nd IEEE International Conference on Cybernetics & Intelligent Systems Robotics, Automation & Mechatronics, pp. 1–6, 2006

  • Theodoridis Y, Papadias D (1995) Range queries involving spatial relations: a performance analysis, Proc. Second Conf. SpatialInformation Theory (COSIT), pp. 537–551, 1995

  • Theodoridis ES, Sellis TK (2000) Efficient cost models for spatial queries using R-Trees. IEEE Trans Knowl Data Eng 12(1):19–32

    Article  Google Scholar 

  • Theodoridis Y, Papadias D, Stefanakis E (1996) Supporting direction relations in spatial database systems, Proc. Seventh Int’l Symp. Spatial Data Handling, 1996

  • Theodoridis Y, Papadias D, Stefanakis E, Sellis T (1998) Direction relations and two-dimensional range queries: optimization techniques. Data Knowl Eng 27(3):313–336

    Article  Google Scholar 

  • Wang ZH, Yan HW (2012) Spatial queries based on direction relations with the case of vector rivers data, 2012 International Symposium on Geomatics for Integrated Water Resources Management, pp. 1–4, 2012

  • Wang JB, Gao H, Li JZ (2012) An index supporting spatial approximate keyword search on disks. J Comput Res Dev 49(10):2142–2152

    Google Scholar 

  • Xia Y, Zhu XY, Su KH (2007) Spatial direction query based on cone model. Geospat Inf 5(3):65–67

    Google Scholar 

  • Xiao YQ, Zhang J, Jing N, Li J (2004) Direction relation query processing using R-trees. J Softw 15(1):103–111

    Google Scholar 

  • Xie XL, Xiong Z, Zhou GQ, Cai GY (2014) On massive spatial data cloud storage and quad-tree index based on the Hbase. WIT Trans Inf Commun Technol 49:691–698

    Article  Google Scholar 

  • Zhang ZB, JZhang P, Li RY, Yang J (2010) A R-tree-based fine directional query filtering, In the 4th International Conference on Internet Computing for Science and Engineering, pp. 126–130, 2010

Download references

Acknowledgments

This work is supported by the National Nature Science Foundation of China (No.41071241), Nature Science Foundation of Hubei Province (No. 2014CFB911), National High Technology Research and Development Program of China (No.2014AA12140100), Central Geological Exploration Fund of China (No.2014-0102), Fundamental Research Funds for the Central Universities of China & Excellent Young Teachers Fund for China University of Geosciences (No. CUGL100242).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xiao Jun Tan.

Additional information

Communicated by: H. A. Babaie

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lin, W.H., Tan, X.J., Liu, F.J. et al. A new directional query method for polygon dataset in spatial database. Earth Sci Inform 8, 775–786 (2015). https://doi.org/10.1007/s12145-015-0206-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12145-015-0206-6

Keywords

Navigation