Sciweavers

1042 search results - page 23 / 209
» Constraint Databases, Data Structures and Efficient Query Ev...
Sort
View
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
14 years 7 months ago
Constraint-Based XML Query Rewriting For Data Integration
We study the problem of answering queries through a target schema, given a set of mappings between one or more source schemas and this target schema, and given that the data is at...
Cong Yu, Lucian Popa
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
14 years 9 months ago
Efficient Keyword Search Across Heterogeneous Relational Databases
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
Mayssam Sayyadian, Hieu LeKhac, AnHai Doan, Luis G...
IDEAS
2003
IEEE
96views Database» more  IDEAS 2003»
14 years 29 days ago
Evaluating Nested Queries on XML Data
In the past few years, much attention has been paid to the study of semistructured data, i.e., data with irregular, possibly unstable, and rapidly changing structure, and, in part...
Carlo Sartiani
ICDE
2000
IEEE
161views Database» more  ICDE 2000»
13 years 11 months ago
Efficient Query Refinement in Multimedia Databases
Increasing application demands are pushing database management systems (DBMSs) towards providing adequate and efficient support for content-based retrieval over multimedia objects...
Kaushik Chakrabarti, Kriengkrai Porkaew, Sharad Me...
WAIM
2010
Springer
13 years 5 months ago
Efficient Continuous Top-k Keyword Search in Relational Databases
Keyword search in relational databases has been widely studied in recent years. Most of the previous studies focus on how to answer an instant keyword query. In this paper, we focu...
Yanwei Xu, Yoshiharu Ishikawa, Jihong Guan