Sciweavers

708 search results - page 123 / 142
» A Genetic Algorithm for Database Query Optimization
Sort
View
PODS
2003
ACM
158views Database» more  PODS 2003»
14 years 7 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
SIGMOD
2002
ACM
135views Database» more  SIGMOD 2002»
14 years 7 months ago
StatiX: making XML count
The availability of summary data for XML documents has many applications, from providing users with quick feedback about their queries, to cost-based storage design and query opti...
Juliana Freire, Jayant R. Haritsa, Maya Ramanath, ...
ICDE
2005
IEEE
122views Database» more  ICDE 2005»
14 years 1 months ago
Signature-based Filtering Techniques for Structural Joins of XML Data
Queries on XML documents typically combine selections on element contents, and, via path expressions, the structural relationships between tagged elements. Efficient support for ...
Huan Huo, Guoren Wang, Chuan Yang, Rui Zhou
SSD
2005
Springer
153views Database» more  SSD 2005»
14 years 1 months ago
Constrained Shortest Path Computation
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...
TCS
1998
13 years 7 months ago
Foundations of Aggregation Constraints
We introduce a new constraint domain, aggregation constraints, that is useful in database query languages, and in constraint logic programming languages that incorporate aggregate...
Kenneth A. Ross, Divesh Srivastava, Peter J. Stuck...