2001 search results - page 261 / 401 » Indexing in a Hypertext Database |
CIKM
2006
Springer
14 years 2 months ago
2006
Springer
We propose to adapt the newly emerged cache-oblivious model to relational query processing. Our goal is to automatically achieve an overall performance comparable to that of fine-...
EDBT
2010
ACM
14 years 1 months ago
2010
ACM
Suffix trees are indexing structures that enhance the performance of numerous string processing algorithms. In this paper, we propose cache-conscious suffix tree construction algo...
EDBT
2009
ACM
14 years 1 months ago
2009
ACM
Range queries for querying the current and future positions of the moving objects have received growing interests in the research community. Existing methods, however, assume that...
CIKM
2006
Springer
14 years 10 days ago
2006
Springer
Peer Data Management Systems (PDMS) are a natural extension of heterogeneous database systems. One of the main tasks in such systems is efficient query processing. Insisting on co...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
We propose a series of methods to represent the evolution of a field of science at different levels: namely micro, meso and macro levels. We use a previously introduced asymmetric...