Sciweavers

390 search results - page 19 / 78
» Approximate Query Answering in Locally Closed Databases
Sort
View
VLDB
2004
ACM
227views Database» more  VLDB 2004»
15 years 3 months ago
Approximate NN queries on Streams with Guaranteed Error/performance Bounds
In data stream applications, data arrive continuously and can only be scanned once as the query processor has very limited memory (relative to the size of the stream) to work with...
Nick Koudas, Beng Chin Ooi, Kian-Lee Tan, Rui Zhan...
ICDT
2012
ACM
293views Database» more  ICDT 2012»
13 years 5 days ago
On the complexity of query answering over incomplete XML documents
Previous studies of incomplete XML documents have identified three main sources of incompleteness – in structural information, data values, and labeling – and addressed data ...
Amélie Gheerbrant, Leonid Libkin, Tony Tan
SIGMOD
2012
ACM
212views Database» more  SIGMOD 2012»
13 years 6 days 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
ER
2001
Springer
136views Database» more  ER 2001»
15 years 2 months ago
A Randomized Approach for the Incremental Design of an Evolving Data Warehouse
A Data Warehouse (DW) can be used to integrate data from multiple distributed data sources. A DW can be seen as a set of materialized views that determine its schema and its conten...
Dimitri Theodoratos, Theodore Dalamagas, Alkis Sim...
ICDE
2007
IEEE
219views Database» more  ICDE 2007»
15 years 11 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...