685 search results - page 83 / 137 » Efficient Filtering Query Indexing in Data Stream |
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...
SIGMOD
2004
ACM
14 years 7 months ago
2004
ACM
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
SSDBM
2002
IEEE
14 years 18 days ago
2002
IEEE
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
TKDE
2012
11 years 10 months ago
2012
— We present a query formulation language (called MashQL) in order to easily query and fuse structured data on the web. The main novelty of MashQL is that it allows people with l...
VLDB
2003
ACM
14 years 8 months ago
2003
ACM
The efficient retrieval of data items on set-valued attributes is an important research topic that has attracted little attention so far. We studied and modified four index structu...