Sciweavers

294 search results - page 3 / 59
» Efficiently Processing Queries on Interval-and-Value Tuples ...
Sort
View
ER
2008
Springer
157views Database» more  ER 2008»
14 years 11 months ago
Retune: Retrieving and Materializing Tuple Units for Effective Keyword Search over Relational Databases
The existing approaches of keyword search over relational databases always identify the relationships between tuples on the fly, which are rather inefficient as such relational rel...
Guoliang Li, Jianhua Feng, Lizhu Zhou
ICDE
2009
IEEE
160views Database» more  ICDE 2009»
14 years 7 months ago
Perm: Processing Provenance and Data on the Same Data Model through Query Rewriting
Data provenance is information that describes how a given data item was produced. The provenance includes source and intermediate data as well as the transformations involved in pr...
Boris Glavic, Gustavo Alonso
ICDE
2007
IEEE
138views Database» more  ICDE 2007»
15 years 10 months ago
Representing and Querying Correlated Tuples in Probabilistic Databases
Probabilistic databases have received considerable attention recently due to the need for storing uncertain data produced by many real world applications. The widespread use of pr...
Prithviraj Sen, Amol Deshpande
IDEAS
2005
IEEE
109views Database» more  IDEAS 2005»
15 years 3 months ago
Efficient Relational Joins with Arithmetic Constraints on Multiple Attributes
We introduce and study a new class of queries that we refer to as ACMA (arithmetic constraints on multiple attributes) queries. Such combinatorial queries require the simultaneous...
Chuang Liu, Lingyun Yang, Ian T. Foster
PODS
2006
ACM
98views Database» more  PODS 2006»
15 years 9 months ago
Processing queries on tree-structured data efficiently
This is a survey of algorithms, complexity results, and general solution techniques for efficiently processing queries on tree-structured data. I focus on query languages that com...
Christoph Koch