87 search results - page 4 / 18 » Completeness Estimation of Range Queries in Structured Overl... |
COMPGEOM
2010
ACM
14 years 4 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
ICDE
2000
IEEE
15 years 6 days ago
2000
IEEE
Analysis of range queries on spatial (multidimensional) data is both important and challenging. Most previous analysis attempts have made certain simplifying assumptions about the...
ICDE
2007
IEEE
15 years 7 days ago
2007
IEEE
Estimating the selectivity of queries is a crucial problem in database systems. Virtually all database systems rely on the use of selectivity estimates to choose amongst the many ...
VLDB
2005
ACM
14 years 4 months ago
2005
ACM
We propose a balanced tree structure overlay on a peer-to-peer network capable of supporting both exact queries and range queries efficiently. In spite of the tree structure caus...
ATMOS
2007
14 years 13 days ago
2007
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...