Sciweavers

493 search results - page 51 / 99
» Consensus answers for queries over probabilistic databases
Sort
View
87
Voted
ICDE
2002
IEEE
91views Database» more  ICDE 2002»
15 years 4 months ago
Lossy Reduction for Very High Dimensional Data
We consider the use of data reduction techniques for the problem of approximate query answering. We focus on applications for which accurate answers to selective queries are requi...
Chris Jermaine, Edward Omiecinski
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
16 years 15 days ago
Querying Data under Access Limitations
Data sources on the web are often accessible through web interfaces that present them as relational tables, but require certain attributes to be mandatorily selected, e.g., via a w...
Andrea Calì, Davide Martinenghi
PODS
2000
ACM
137views Database» more  PODS 2000»
15 years 3 months ago
Query Containment for Data Integration Systems
The problem of query containment is fundamental to many aspects of database systems, including query optimization, determining independence of queries from updates, and rewriting ...
Todd D. Millstein, Alon Y. Levy, Marc Friedman
APWEB
2010
Springer
15 years 4 months ago
Optimizing Query Processing for the Hidden Web
Abstract. The term Deep Web (sometimes also called Hidden Web) refers to the data content that is created dynamically as the result of a specific search on the Web. In this respec...
Andrea Calì, Davide Martinenghi
EDBT
2008
ACM
150views Database» more  EDBT 2008»
15 years 11 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin