Sciweavers

2662 search results - page 378 / 533
» Data Compression Support in Databases
Sort
View
SIGMOD
2007
ACM
181views Database» more  SIGMOD 2007»
16 years 6 months ago
Progressive and selective merge: computing top-k with ad-hoc ranking functions
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...
Dong Xin, Jiawei Han, Kevin Chen-Chuan Chang
SIGMOD
2003
ACM
108views Database» more  SIGMOD 2003»
16 years 6 months ago
Composing XSL Transformations with XML Publishing Views
While the XML Stylesheet Language for Transformations (XSLT) was not designed as a query language, it is well-suited for many query-like operations on XML documents including sele...
Chengkai Li, Philip Bohannon, Henry F. Korth, P. P...
SIGMOD
2001
ACM
221views Database» more  SIGMOD 2001»
16 years 6 months ago
Adaptable Query Optimization and Evaluation in Temporal Middleware
Time-referenced data are pervasive in most real-world databases. Recent advances in temporal query languages show that such database applications may benefit substantially from bu...
Giedrius Slivinskas, Christian S. Jensen, Richard ...
EDBT
2002
ACM
129views Database» more  EDBT 2002»
16 years 6 months ago
Schema-Driven Evaluation of Approximate Tree-Pattern Queries
Abstract. We present a simple query language for XML, which supports hierarchical, Boolean-connected query patterns. The interpretation of a query is founded on cost-based query tr...
Torsten Schlieder
SIGMOD
2006
ACM
121views Database» more  SIGMOD 2006»
16 years 11 days ago
Derby/S: a DBMS for sample-based query answering
Although approximate query processing is a prominent way to cope with the requirements of data analysis applications, current database systems do not provide integrated and compre...
Anja Klein, Rainer Gemulla, Philipp Rösch, Wo...