245 search results - page 29 / 49 » An Indexing Framework for Peer-to-Peer Systems |
IS
2006
14 years 11 months ago
2006
Abstract. Terms which are not explicitly mentioned in the text of a document receive often a minor role in current retrieval systems. In this work we connect the management of such...
LOGCOM
2002
14 years 11 months ago
2002
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
158
click to vote
SIGMOD
2007
ACM
15 years 11 months ago
2007
ACM
The family of threshold algorithm (i.e., TA) has been widely studied for efficiently computing top-k queries. TA uses a sort-merge framework that assumes data lists are pre-sorted...
140
click to vote
SSDBM
2002
IEEE
15 years 4 months 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...
101
click to vote
SSD
2001
Springer
15 years 3 months ago
2001
Springer
The design of external index structures for one- and multidimensional extended objects is a long and well studied subject in basic database research. Today, more and more commercia...