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
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Topological relations in the world of minimum bounding rectangles: a study with R-trees
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Closest pair queries in spatial databases
SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Spatial databases with application to GIS
Spatial databases with application to GIS
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
Approximate Processing of Multiway Spatial Joins in Very Large Databases
EDBT '02 Proceedings of the 8th International Conference on Extending Database Technology: Advances in Database Technology
When Is ''Nearest Neighbor'' Meaningful?
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Proceedings of the 17th International Conference on Data Engineering
A Small Set of Formal Topological Relationships Suitable for End-User Interaction
SSD '93 Proceedings of the Third International Symposium on Advances in Spatial Databases
Query relaxation for xml model
Query relaxation for xml model
IEEE Transactions on Knowledge and Data Engineering
Progressive skyline computation in database systems
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2003
On computing top-t most influential spatial sites
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Approximate joins: concepts and techniques
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Enterprise information mashups: integrating information, simply
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Relaxing join and selection queries
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
ACM Transactions on Database Systems (TODS)
Query relaxation using malleable schemas
Proceedings of the 2007 ACM SIGMOD international conference on Management of data
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficient Algorithms for Skyline Top-K Keyword Queries on XML Streams
DASFAA '09 Proceedings of the 14th International Conference on Database Systems for Advanced Applications
Processing spatial skyline queries in both vector spaces and spatial network databases
ACM Transactions on Database Systems (TODS)
Spatial Skyline Queries: An Efficient Geometric Algorithm
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
Finding skyline paths in road networks
Proceedings of the 17th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
Direction-based spatial skylines
Proceedings of the Ninth ACM International Workshop on Data Engineering for Wireless and Mobile Access
Towards similarity-based topological query languages
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
ER'05 Proceedings of the 24th international conference on Perspectives in Conceptual Modeling
A recommendation technique for spatial data
ADBIS'11 Proceedings of the 15th international conference on Advances in databases and information systems
Hi-index | 0.00 |
Relaxation and approximation techniques have been proposed as approaches for improving the quality of query results, in terms of completeness and accuracy, in environments where the user may not be able to specify the query in a complete and exact way, since data are quite heterogeneous or she may not know all the characteristics of data at hand. This problem, mainly addressed for relational and XML data, is nowadays quite relevant also for geo-spatial data, due to their increasing usage in highly critical decisional processes. Among geo-spatial queries, those based on spatial and more precisely topological relations are currently used in an increasing number of applications. As far as we know, no approach has been proposed so far for relaxing queries based on topological predicates when they return an empty or insufficient answer, in order to improve result quality and user satisfaction. In this paper, we consider this problem and we present a general relaxation strategy for, possibly multi-domain, topological selection and join queries. Two specific semantics are also provided: the first applies the minimum amount of relaxation in order to get an acceptable answer; the second relaxes the given query of a certain fixed amount, depending on the considered topological predicate. Index-based processing algorithms, for efficiently executing relaxed queries based on the proposed semantics, are also presented and a specific topological similarity function, to be used for relaxation purposes, is proposed. Experimental results show that the overhead given by query relaxation is acceptable.