Sciweavers

109 search results - page 12 / 22
» Optimization Using Tuple Subsumption
Sort
View
ICDE
1999
IEEE
151views Database» more  ICDE 1999»
14 years 8 months ago
Data Integration by Describing Sources with Constraint Databases
We develop a data integration approach for the efficient evaluation of queries over autonomous source databases. The approach is based on some novel applications and extensions of...
Xun Cheng, Guozhu Dong, Tzekwan Lau, Jianwen Su
IPM
2006
167views more  IPM 2006»
13 years 7 months ago
Browsing mixed structured and unstructured data
Both structured and unstructured data, as well as structured data representing several different types of tuples, may be integrated into a single list for browsing or retrieval. D...
Robert M. Losee
SIGMOD
2009
ACM
137views Database» more  SIGMOD 2009»
14 years 7 months ago
Robust and efficient algorithms for rank join evaluation
In the rank join problem we are given a relational join R1 1 R2 and a function that assigns numeric scores to the join tuples, and the goal is to return the tuples with the highes...
Jonathan Finger, Neoklis Polyzotis
EDBTW
2006
Springer
13 years 11 months ago
Using Temporal Semantics for Live Media Stream Queries
Querying live media streams is a challenging problem that becomes an essential requirement in a growing number of applications. We address the problem of evaluating continuous quer...
Bin Liu, Amarnath Gupta, Ramesh Jain
SIGMOD
2003
ACM
136views Database» more  SIGMOD 2003»
14 years 7 months ago
A Characterization of the Sensitivity of Query Optimization to Storage Access Cost Parameters
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
Frederick Reiss, Tapas Kanungo