245 search results - page 29 / 49 » An Indexing Framework for Peer-to-Peer Systems |
IS
2006
13 years 9 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
13 years 8 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...
SIGMOD
2007
ACM
14 years 9 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...
SSDBM
2002
IEEE
14 years 2 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...
SSD
2001
Springer
14 years 1 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...