Sciweavers

738 search results - page 80 / 148
» High-Performance Extensible Indexing
Sort
View
BTW
2007
Springer
153views Database» more  BTW 2007»
13 years 11 months ago
Efficient Time-Travel on Versioned Text Collections
: The availability of versioned text collections such as the Internet Archive opens up opportunities for time-aware exploration of their contents. In this paper, we propose time-tr...
Klaus Berberich, Srikanta J. Bedathur, Gerhard Wei...
CINQ
2004
Springer
180views Database» more  CINQ 2004»
13 years 11 months ago
Interactivity, Scalability and Resource Control for Efficient KDD Support in DBMS
The conflict between resource consumption and query performance in the data mining context often has no satisfactory solution. This not only stands in sharp contrast to the need of...
Matthias Gimbel, Michael Klein, Peter C. Lockemann
ESA
2006
Springer
136views Algorithms» more  ESA 2006»
13 years 11 months ago
Approximation in Preemptive Stochastic Online Scheduling
Abstract. We present a first constant performance guarantee for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release ...
Nicole Megow, Tjark Vredeveld
EDBT
2010
ACM
155views Database» more  EDBT 2010»
13 years 11 months ago
Suffix tree construction algorithms on modern hardware
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...
Dimitris Tsirogiannis, Nick Koudas
CIKM
2006
Springer
13 years 9 months ago
Processing relaxed skylines in PDMS using distributed data summaries
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...
Katja Hose, Christian Lemke, Kai-Uwe Sattler