806 search results - page 71 / 162 » An Optimal Dynamic Data Structure for Stabbing-Semigroup Que... |
117
click to vote
WEBDB
1998
Springer
15 years 5 months ago
1998
Springer
Semistructured graph-based databases have been proposed as well-suited stores for World-Wide Web data. Yet so far, languages for querying such data are too complex for casual Web ...
105
click to vote
ALGORITHMICA
2002
15 years 1 months ago
2002
In recent years there has been an upsurge of interest in spatial databases. A major issue is how to manipulate efficiently massive amounts of spatial data stored on disk in multidi...
118
click to vote
DAGSTUHL
2004
15 years 2 months ago
2004
We present the Priority R-tree, or PR-tree, which is the first R-tree variant that always answers a window query using O((N/B)1-1/d + T/B) I/Os, where N is the number of ddimensio...
223
click to vote
ICDE
2005
IEEE
16 years 2 months ago
2005
IEEE
Query processing in traditional information management systems has moved from an exact match model to more flexible paradigms allowing cooperative retrieval by aggregating the dat...
155
click to vote
SIGMOD
2007
ACM
16 years 1 months ago
2007
ACM
We propose to demonstrate EaseDB, the first cache-oblivious query processor for in-memory relational query processing. The cacheoblivious notion from the theory community refers t...