Sciweavers

610 search results - page 27 / 122
» Efficient Query Evaluation on Probabilistic Databases
Sort
View
VLDB
2007
ACM
126views Database» more  VLDB 2007»
16 years 21 days ago
Querying Complex Structured Databases
Correctly generating a structured query (e.g., an XQuery or a SQL query) requires the user to have a full understanding of the database schema, which can be a daunting task. Alter...
Cong Yu, H. V. Jagadish
IDEAS
2005
IEEE
109views Database» more  IDEAS 2005»
15 years 6 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
ICDE
1999
IEEE
151views Database» more  ICDE 1999»
16 years 1 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
99
Voted
ICPR
2010
IEEE
15 years 3 months ago
Improving the Efficiency of Content-Based Multimedia Exploration
Visual exploration systems enable users to search, browse, and explore voluminous multimedia databases in an interactive and playful manner. Whether users know the database's ...
Christian Beecks, Sascha Wiedenfeld, Thomas Seidl
124
Voted
ICDT
2010
ACM
211views Database» more  ICDT 2010»
15 years 10 months ago
Probabilistic Data Exchange
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
Ronald Fagin, Benny Kimelfeld, Phokion Kolaitis