1888 search results - page 40 / 378 » Algorithms for Querying by Spatial Structure |
83
Voted
SCCC
2003
IEEE
15 years 3 months ago
2003
IEEE
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
161
click to vote
VLDB
2007
ACM
15 years 10 months ago
2007
ACM
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
ER
2007
Springer
15 years 4 months ago
2007
Springer
Ensuring the semantic and topological correctness of spatial data is an important requirement in geographical information systems and spatial database systems in order to preserve ...
DEXA
2004
Springer
15 years 3 months ago
2004
Springer
Topological predicates between spatial objects have always been a main area of research on spatial data handling, reasoning, and query languages. The focus of research has definit...
180
click to vote
ICDE
2006
IEEE
15 years 11 months ago
2006
IEEE
We study the problem of continuous relational query processing in Internet-scale overlay networks realized by distributed hash tables. We concentrate on the case of continuous two...