Sciweavers

151 search results - page 20 / 31
» Answering approximate queries over autonomous web databases
Sort
View
ICDE
2009
IEEE
190views Database» more  ICDE 2009»
14 years 9 months ago
Progressive Keyword Search in Relational Databases
A common approach to performing keyword search over relational databases is to find the minimum Steiner trees in database graphs. These methods, however, are rather expensive as th...
Guoliang Li, Xiaofang Zhou, Jianhua Feng, Jianyong...
CORR
2007
Springer
77views Education» more  CORR 2007»
13 years 7 months ago
Query Evaluation and Optimization in the Semantic Web
We address the problem of answering Web ontology queries efficiently. An ontology is formalized as a Deductive Ontology Base (DOB), a deductive database that comprises the ontology...
Edna Ruckhaus, Eduardo Ruiz, Maria-Esther Vidal
SIGMOD
2007
ACM
112views Database» more  SIGMOD 2007»
14 years 7 months ago
A random walk approach to sampling hidden databases
A large part of the data on the World Wide Web is hidden behind form-like interfaces. These interfaces interact with a hidden backend database to provide answers to user queries. ...
Arjun Dasgupta, Gautam Das, Heikki Mannila
SIGMOD
1999
ACM
127views Database» more  SIGMOD 1999»
13 years 12 months ago
An Adaptive Query Execution System for Data Integration
Query processing in data integration occurs over network-bound, autonomous data sources. This requires extensions to traditional optimization and execution techniques for three re...
Zachary G. Ives, Daniela Florescu, Marc Friedman, ...
EDBT
2009
ACM
208views Database» more  EDBT 2009»
14 years 2 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...