Sciweavers

6650 search results - page 235 / 1330
» Mutating database queries
Sort
View
WOLLIC
2009
Springer
15 years 11 months ago
Spoilt for Choice: Full First-Order Hierarchical Decompositions
Abstract. Database design aims to find a database schema that permits the efficient processing of common types of queries and updates on future database instances. Full first-ord...
Sebastian Link
APPROX
2005
Springer
104views Algorithms» more  APPROX 2005»
15 years 10 months ago
Bounds for Error Reduction with Few Quantum Queries
We consider the quantum database search problem, where we are given a function f : [N] → {0, 1}, and are required to return an x ∈ [N] (a
Sourav Chakraborty, Jaikumar Radhakrishnan, Nandak...
CHOROCHRONOS
2003
Springer
15 years 9 months ago
Access Methods and Query Processing Techniques
Adriano Di Pasquale, Luca Forlizzi, Christian S. J...
EDBT
2008
ACM
128views Database» more  EDBT 2008»
15 years 6 months ago
BIBEX: a bibliographic exploration tool based on the DEX graph query engine
Sergio Gómez-Villamor, Gerard Soldevila-Mir...
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
16 years 4 months ago
Supporting ranking and clustering as generalized order-by and group-by
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
Chengkai Li, Min Wang, Lipyeow Lim, Haixun Wang, K...