Efficient algorithms for spatial configuration information retrieval

Authors:
Haibin Sun
Affiliations:
College of Information Science and Engineering, Shandong University of Science and Technology, Qingdao 266510, China and Hisense state key laboratory of digital multimedia technology, Qingdao 2660 ...
Venue:
Knowledge-Based Systems
Year:
2009

Citing 13
Cited 0

Spatial query processing in an object-oriented database system

SIGMOD '86 Proceedings of the 1986 ACM SIGMOD international conference on Management of data
Constraint satisfaction algorithms

Computational Intelligence
The R*-tree: an efficient and robust access method for points and rectangles

SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Visual information retrieval

Communications of the ACM
Content-based retrieval using heuristic search

Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval
Maintaining knowledge about temporal intervals

Communications of the ACM
R-trees: a dynamic index structure for spatial searching

SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Picture Similarity Retrieval Using the 2D Projection Interval Representation

IEEE Transactions on Knowledge and Data Engineering
Algorithms for Querying by Spatial Structure

VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects

VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
On the Forward Checking Algorithm

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Dynamic Variable Ordering in CSPs

CP '95 Proceedings of the First International Conference on Principles and Practice of Constraint Programming
Cardinal directions between spatial objects: the pairwise-consistency problem

Information Sciences—Informatics and Computer Science: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of spatial configuration information retrieval is a constraint satisfaction problem (CSP), which can be solved using traditional CSP algorithms. But the spatial data can be reorganized using index techniques like R-tree and the spatial data are approximated by their minimum bounding rectangles (MBRs), so the spatial configuration information retrieval is actually based on the MBRs and some special techniques can be studied. This paper studies the mapping relationships among the spatial relations for real spatial objects, the corresponding spatial relations for their MBRs and the corresponding spatial relations between the intermediate nodes and the MBRs in R-tree. Three algorithms are designed and studied, and their performances are compared.