Sciweavers

5954 search results - page 377 / 1191
» Querying Bi-level Information
Sort
View
ICDE
2005
IEEE
147views Database» more  ICDE 2005»
16 years 14 days ago
Privacy-Preserving Top-K Queries
Processing of top-k queries has been attracting considerable attention. Much of the work assumes distributed data, with each site holding a different set of attributes for the sam...
Jaideep Vaidya, Chris Clifton
189
Voted
DAWAK
2003
Springer
16 years 2 days ago
Computing SQL Queries with Boolean Aggregates
We introduce a new method for optimization of SQL queries with nested subqueries. The method is based on the idea of Boolean aggregates, aggregates that compute the conjunction or ...
Antonio Badia
HIM
1997
Springer
162views Multimedia» more  HIM 1997»
15 years 11 months ago
Incremental Processing of Vague Queries in Interactive Retrieval Systems
The application of information retrieval techniques in interactive environments requires systems capable of efficiently processing vague queries. To reach reasonable response tim...
Ulrich Pfeifer, Stefan Pennekamp
EDBTW
2006
Springer
15 years 10 months ago
Validity-Sensitive Querying of XML Databases
We consider the problem of querying XML documents which are not valid with respect to given DTDs. We propose a framework for measuring the invalidity of XML documents and compactly...
Slawomir Staworko, Jan Chomicki
DAMON
2008
Springer
15 years 8 months ago
DSM vs. NSM: CPU performance tradeoffs in block-oriented query processing
Comparisons between the merits of row-wise storage (NSM) and columnar storage (DSM) are typically made with respect to the persistent storage layer of database systems. In this pa...
Marcin Zukowski, Niels Nes, Peter A. Boncz