Sciweavers

1000 search results - page 86 / 200
» Provenance for Aggregate Queries
Sort
View
XSYM
2007
Springer
123views Database» more  XSYM 2007»
14 years 4 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»
14 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»
14 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
NDT
2010
13 years 8 months ago
A Scalable Framework for Serializable XQuery
This paper focuses on an aspect that is widely neglected in native XML database management systems: support for concurrent transactional access. We analyze the isolation requireme...
Sebastian Bächle, Theo Härder
CORR
2008
Springer
122views Education» more  CORR 2008»
13 years 10 months ago
Breaking One-Round Key-Agreement Protocols in the Random Oracle Model
In this work we deal with one-round key-agreement protocols, called Merkle's Puzzles, in the random oracle model, where the players Alice and Bob are allowed to query a rando...
Miroslava Sotáková