Sciweavers

610 search results - page 23 / 122
» Efficient Query Evaluation on Probabilistic Databases
Sort
View
ICDE
2010
IEEE
241views Database» more  ICDE 2010»
15 years 9 months ago
FlexPref: A Framework for Extensible Preference Evaluation in Database Systems
Personalized database systems give users answers tailored to their personal preferences. While numerous preference evaluation methods for databases have been proposed (e.g., skylin...
Justin J. Levandoski, Mohamed F. Mokbel, Mohamed E...
SIGMOD
2009
ACM
134views Database» more  SIGMOD 2009»
15 years 10 months ago
Keyword query cleaning using hidden Markov models
In this paper, we consider the problem of keyword query cleaning for structured databases from a probabilistic approach. Keyword query cleaning consists of rewriting the user quer...
Ken Q. Pu
ICDE
2008
IEEE
115views Database» more  ICDE 2008»
15 years 4 months ago
Probabilistic adaptive load balancing for parallel queries
— In the context of adaptive query processing (AQP), several techniques have been proposed for dynamically adapting/redistributing processor load assignments throughout a computa...
Daniel M. Yellin, Jorge Buenabad Chávez, No...
WEBDB
2005
Springer
129views Database» more  WEBDB 2005»
15 years 3 months ago
Processing Top-N Queries in P2P-based Web Integration Systems with Probabilistic Guarantees
Efficient query processing in P2P-based Web integration systems poses a variety of challenges resulting from the strict decentralization and limited knowledge. As a special probl...
Katja Hose, Marcel Karnstedt, Kai-Uwe Sattler, Dan...
ICDE
2006
IEEE
155views Database» more  ICDE 2006»
15 years 11 months ago
Designing and Evaluating an XPath Dialect for Linguistic Queries
Linguistic research and natural language processing employ large repositories of ordered trees. XML, a standard ordered tree model, and XPath, its associated language, are natural...
Steven Bird, Yi Chen, Susan B. Davidson, Haejoong ...