Sciweavers

486 search results - page 15 / 98
» Evaluating Top-k Queries over Web-Accessible Databases
Sort
View
ICDE
2008
IEEE
118views Database» more  ICDE 2008»
16 years 2 months ago
Robust Runtime Optimization of Data Transfer in Queries over Web Services
Self-managing solutions have recently attracted a lot of interest from the database community. The need for self-* properties is more evident in distributed applications comprising...
Anastasios Gounaris, Christos Yfoulis, Rizos Sakel...
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
14 years 4 months ago
Sensitivity analysis and explanations for robust query evaluation in probabilistic databases
Probabilistic database systems have successfully established themselves as a tool for managing uncertain data. However, much of the research in this area has focused on efficient...
Bhargav Kanagal, Jian Li, Amol Deshpande
SIGMOD
2006
ACM
153views Database» more  SIGMOD 2006»
16 years 1 months ago
Interactive query formulation over web service-accessed sources
Integration systems typically support only a restricted set of queries over the schema they export. The reason is that the participating information sources contribute limited con...
Michalis Petropoulos, Alin Deutsch, Yannis Papakon...
ICDE
2010
IEEE
202views Database» more  ICDE 2010»
16 years 1 months ago
Ranked Queries over Sources with Boolean Query Interfaces without Ranking Support
Many online or local data sources provide powerful querying mechanisms but limited ranking capabilities. For instance, PubMed allows users to submit highly expressive Boolean keywo...
Panagiotis G. Ipeirotis, Vagelis Hristidis, Yuheng...
ICDE
2008
IEEE
132views Database» more  ICDE 2008»
16 years 2 months ago
The Space Complexity of Processing XML Twig Queries Over Indexed Documents
Abstract-- Current twig join algorithms incur high memory costs on queries that involve child-axis nodes. In this paper we provide an analytical explanation for this phenomenon. In...
Mirit Shalem, Ziv Bar-Yossef