242 search results - page 23 / 49 » An Efficient Method for Indexing Now-relative Bitemporal dat... |
DAGSTUHL
2004
13 years 9 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...
GIS
2003
ACM
14 years 8 months ago
2003
ACM
With the proliferation of mobile computing, the ability to index efficiently the movements of mobile objects becomes important. Objects are typically seen as moving in two-dimensi...
WWW
2007
ACM
14 years 8 months ago
2007
ACM
We describe a query-driven indexing framework for scalable text retrieval over structured P2P networks. To cope with the bandwidth consumption problem that has been identified as ...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
VLDB
2002
ACM
14 years 8 months ago
2002
ACM
Abstract. We propose an indexing technique for the fast retrieval of objects in 2D images based on similarity between their boundary shapes. Our technique is robust in the presence...