Sciweavers

409 search results - page 48 / 82
» Combining Efficient XML Compression with Query Processing
Sort
View
VLDB
1995
ACM
97views Database» more  VLDB 1995»
15 years 1 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch
ADBIS
2003
Springer
114views Database» more  ADBIS 2003»
15 years 2 months ago
Compressing Large Signature Trees
In this paper we present a new compression scheme for signature tree structures. Beyond the reduction of storage space, compression attains significant savings in terms of query pr...
Maria Kontaki, Yannis Manolopoulos, Alexandros Nan...
SIGMOD
2008
ACM
193views Database» more  SIGMOD 2008»
15 years 9 months ago
Efficient provenance storage
Scientific workflow systems are increasingly used to automate complex data analyses, largely due to their benefits over traditional approaches for workflow design, optimization, a...
Adriane Chapman, H. V. Jagadish, Prakash Ramanan
SIGIR
2008
ACM
14 years 9 months ago
Efficient top-k querying over social-tagging networks
Online communities have become popular for publishing and searching content, as well as for finding and connecting to other users. User-generated content includes, for example, pe...
Ralf Schenkel, Tom Crecelius, Mouna Kacimi, Sebast...
DOLAP
2009
ACM
15 years 4 months ago
View usability and safety for the answering of top-k queries via materialized views
In this paper, we investigate the problem of answering top-k queries via materialized views. We provide theoretical guarantees for the adequacy of a view to answer a top-k query, ...
Eftychia Baikousi, Panos Vassiliadis