Sciweavers

1038 search results - page 49 / 208
» Space-Bounded Query Approximation
Sort
View
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
15 years 12 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
Georgia Koutrika, Yannis E. Ioannidis
MIDDLEWARE
2009
Springer
15 years 6 months ago
PAQ: Persistent Adaptive Query Middleware for Dynamic Environments
Abstract. Pervasive computing applications often entail continuous monitoring tasks, issuing persistent queries that return continuously updated views of the operational environmen...
Vasanth Rajamani, Christine Julien, Jamie Payton, ...
PVLDB
2008
111views more  PVLDB 2008»
14 years 11 months ago
Approximate lineage for probabilistic databases
In probabilistic databases, lineage is fundamental to both query processing and understanding the data. Current systems s.a. Trio or Mystiq use a complete approach in which the li...
Christopher Ré, Dan Suciu
EDBT
2009
ACM
118views Database» more  EDBT 2009»
15 years 6 months ago
Flexible query answering on graph-modeled data
The largeness and the heterogeneity of most graph-modeled datasets in several database application areas make the query process a real challenge because of the lack of a complete ...
Federica Mandreoli, Riccardo Martoglia, Giorgio Vi...
VLDB
2004
ACM
98views Database» more  VLDB 2004»
15 years 5 months ago
Top-k Query Evaluation with Probabilistic Guarantees
Top-k queries based on ranking elements of multidimensional datasets are a fundamental building block for many kinds of information discovery. The best known general-purpose algor...
Martin Theobald, Gerhard Weikum, Ralf Schenkel