Sciweavers

736 search results - page 37 / 148
» Answering Imprecise Queries over Web Databases
Sort
View
ICDT
2001
ACM
153views Database» more  ICDT 2001»
14 years 4 days ago
Estimating Range Queries Using Aggregate Data with Integrity Constraints: A Probabilistic Approach
In fast OLAP applications it is often advantageous to provide approximate answers to range queries in order to achieve very high performances. A possible solution is to inquire sum...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...
CIKM
2006
Springer
13 years 11 months ago
Information retrieval from relational databases using semantic queries
Relational databases are widely used today as a mechanism for providing access to structured data. They, however, are not suitable for typical information finding tasks of end use...
Anand Ranganathan, Zhen Liu
WWW
2011
ACM
13 years 2 months ago
FACTO: a fact lookup engine based on web tables
Recently answers for fact lookup queries have appeared on major search engines. For example, for the query {Barack Obama date of birth} Google directly shows “4 August 1961” a...
Xiaoxin Yin, Wenzhao Tan, Chao Liu
PVLDB
2010
123views more  PVLDB 2010»
13 years 6 months ago
Toward Scalable Keyword Search over Relational Data
Keyword search (KWS) over relational databases has recently received significant attention. Many solutions and many prototypes have been developed. This task requires addressing ...
Akanksha Baid, Ian Rae, Jiexing Li, AnHai Doan, Je...
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
11 years 10 months ago
Local structure and determinism in probabilistic databases
While extensive work has been done on evaluating queries over tuple-independent probabilistic databases, query evaluation over correlated data has received much less attention eve...
Theodoros Rekatsinas, Amol Deshpande, Lise Getoor