Sciweavers

147 search results - page 2 / 30
» Size Bounds and Query Plans for Relational Joins
Sort
View
EDBT
1994
ACM
149views Database» more  EDBT 1994»
13 years 9 months ago
On the Estimation of Join Result Sizes
Abstract. Good estimates of join result sizes are critical for query optimization in relational database management systems. We address the problem of incrementally obtaining accur...
Arun N. Swami, K. Bernhard Schiefer
ICDT
1999
ACM
97views Database» more  ICDT 1999»
13 years 10 months ago
Optimizing Large Join Queries in Mediation Systems
In data integration systems, queries posed to a mediator need to be translated into a sequence of queries to the underlying data sources. In a heterogeneous environment, with sour...
Ramana Yerneni, Chen Li, Jeffrey D. Ullman, Hector...
SIGMOD
2006
ACM
112views Database» more  SIGMOD 2006»
14 years 5 months ago
Join minimization in XML-to-SQL translation: an algebraic approach
Consider an XML view defined over a relational database, and a user query specified over this view. This user XML query is typically processed using the following steps: (a) our t...
Murali Mani, Song Wang, Daniel J. Dougherty, Elke ...
TDM
2004
174views Database» more  TDM 2004»
13 years 7 months ago
Relational Approach to Logical Query Optimization of XPath
To be able to handle the ever growing volumes of XML documents, effective and efficient data management solutions are needed. Managing XML data in a relational DBMS has great pote...
Maurice van Keulen
VLDB
2004
ACM
161views Database» more  VLDB 2004»
14 years 5 months ago
Supporting top-k join queries in relational databases
Ranking queries produce results that are ordered on some computed score. Typically, these queries involve joins, where users are usually interested only in the top-k join results....
Ihab F. Ilyas, Walid G. Aref, Ahmed K. Elmagarmid