Sciweavers

2853 search results - page 61 / 571
» On the Efficiency of Provenance Queries
Sort
View
ICDCS
2009
IEEE
14 years 7 months ago
Fragmentation Design for Efficient Query Execution over Sensitive Distributed Databases
The balance between privacy and utility is a classical problem with an increasing impact on the design of modern information systems. On the one side it is crucial to ensure that ...
Valentina Ciriani, Sabrina De Capitani di Vimercat...
ICDE
2010
IEEE
568views Database» more  ICDE 2010»
15 years 9 months ago
Reverse Top-k Queries
Rank-aware query processing has become essential for many applications that return to the user only the top-k objects based on the individual user's preferences. Top-k queries...
Akrivi Vlachou, Christos Doulkeridis, Kjetil N&osl...
XSYM
2007
Springer
123views Database» more  XSYM 2007»
15 years 3 months ago
Let a Single FLWOR Bloom
To globally optimize execution plans for XQuery expressions, a plan generator must generate and compare plan alternatives. In proven compiler architectures, the unit of plan genera...
Matthias Brantner, Carl-Christian Kanne, Guido Moe...
VLDB
2001
ACM
123views Database» more  VLDB 2001»
15 years 2 months ago
User-Optimizer Communication using Abstract Plans in Sybase ASE
imizer Communication using Abstract Plans in Sybase ASE Query optimizers are error prone, due to both their nature and the increased search space that modern query processing requ...
Mihnea Andrei, Patrick Valduriez
STOC
2000
ACM
97views Algorithms» more  STOC 2000»
15 years 2 months ago
Quantum lower bounds by quantum arguments
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
Andris Ambainis