Sciweavers

3368 search results - page 141 / 674
» The Complexity of Query Reliability
Sort
View
ICDE
2006
IEEE
189views Database» more  ICDE 2006»
16 years 3 months ago
Algebraic Optimization of Nested XPath Expressions
The XPath language incorporates powerful primitives for formulating queries containing nested subexpressions which are existentially or universally quantified. However, even the b...
Matthias Brantner, Carl-Christian Kanne, Guido Moe...
WWW
2005
ACM
16 years 3 months ago
A fast XPATH evaluation technique with the facility of updates
This paper addresses the problem of fast retrieval of data from XML documents by providing a labeling schema that can easily handle simple as well as complex XPATH queries and als...
Ashish Virmani, Suchit Agarwal, Rahul Thathoo, She...
DBPL
2009
Springer
144views Database» more  DBPL 2009»
15 years 9 months ago
General Database Statistics Using Entropy Maximization
Abstract. We propose a framework in which query sizes can be estimated from arbitrary statistical assertions on the data. In its most general form, a statistical assertion states t...
Raghav Kaushik, Christopher Ré, Dan Suciu
DEXA
1994
Springer
81views Database» more  DEXA 1994»
15 years 6 months ago
Supporting Information Disclosure in an Evolving Environment
Even if high-level query languages are used, query formulation may cause problems. This is notably so in case of large and complex application domains. Typical examples of these ki...
Arthur H. M. ter Hofstede, Henderik Alex Proper, T...
114
Voted
ACTA
2002
111views more  ACTA 2002»
15 years 2 months ago
Adding a path connectedness operator to FO+poly (linear)
In the constraint database community, FO+poly and FO+linear have been proposed as foundations for spatial database query languages. One of the strengths of this approach is that t...
Chris Giannella, Dirk Van Gucht