A probabilistic relational algebra for the integration of information retrieval and database systems
ACM Transactions on Information Systems (TOIS)
ProbView: a flexible probabilistic database system
ACM Transactions on Database Systems (TODS)
Rank aggregation methods for the Web
Proceedings of the 10th international conference on World Wide Web
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Optimizing search engines using clickthrough data
Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining
Evaluating probabilistic queries over imprecise data
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Learning to rank using gradient descent
ICML '05 Proceedings of the 22nd international conference on Machine learning
Working Models for Uncertain Data
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Clean Answers over Dirty Databases: A Probabilistic Approach
ICDE '06 Proceedings of the 22nd International Conference on Data Engineering
Creating probabilistic databases from information extraction models
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Management of probabilistic data: foundations and challenges
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient query evaluation on probabilistic databases
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Data integration with uncertainty
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Ranking queries on uncertain data: a probabilistic threshold approach
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A survey of top-k query processing techniques in relational database systems
ACM Computing Surveys (CSUR)
Sliding-window top-k queries on uncertain streams
Proceedings of the VLDB Endowment
Conditioning probabilistic databases
Proceedings of the VLDB Endowment
Learning to create data-integrating queries
Proceedings of the VLDB Endowment
Efficient Processing of Top-k Queries in Uncertain Databases
ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Semantics of Ranking Queries for Probabilistic Data and Expected Ranks
ICDE '09 Proceedings of the 2009 IEEE International Conference on Data Engineering
On the semantics and evaluation of top-k queries in probabilistic databases
ICDEW '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering Workshop
Consensus answers for queries over probabilistic databases
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
PrDB: managing and exploiting rich correlations in probabilistic databases
The VLDB Journal — The International Journal on Very Large Data Bases
Models for incomplete and probabilistic information
EDBT'06 Proceedings of the 2006 international conference on Current Trends in Database Technology
Probabilistic ranking over relations
Proceedings of the 13th International Conference on Extending Database Technology
Consistent query answers in inconsistent probabilistic databases
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Relevance and ranking in online dating systems
Proceedings of the 33rd international ACM SIGIR conference on Research and development in information retrieval
Supporting ranking queries on uncertain and incomplete data
The VLDB Journal — The International Journal on Very Large Data Bases
Metric spaces in data mining: applications to clustering
SIGSPATIAL Special
A generic framework for handling uncertain data with local correlations
Proceedings of the VLDB Endowment
Ranking continuous probabilistic datasets
Proceedings of the VLDB Endowment
Efficient and effective similarity search over probabilistic data based on earth mover's distance
Proceedings of the VLDB Endowment
Proceedings of the VLDB Endowment
k-nearest neighbors in uncertain graphs
Proceedings of the VLDB Endowment
Similarity search and mining in uncertain databases
Proceedings of the VLDB Endowment
Tractability in probabilistic databases
Proceedings of the 14th International Conference on Database Theory
(Approximate) uncertain skylines
Proceedings of the 14th International Conference on Database Theory
Asymptotically efficient algorithms for skyline probabilities of uncertain data
ACM Transactions on Database Systems (TODS)
Provenance for aggregate queries
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient query answering in probabilistic RDF graphs
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Robust ranking of uncertain data
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Handling ER-topk query on uncertain streams
DASFAA'11 Proceedings of the 16th international conference on Database systems for advanced applications - Volume Part I
Efficient probabilistic reverse nearest neighbor query processing on uncertain data
Proceedings of the VLDB Endowment
A truly dynamic data structure for top-k queries on uncertain data
SSDBM'11 Proceedings of the 23rd international conference on Scientific and statistical database management
Database foundations for scalable RDF processing
RW'11 Proceedings of the 7th international conference on Reasoning web: semantic technologies for the web of data
Continuous probabilistic count queries in wireless sensor networks
SSTD'11 Proceedings of the 12th international conference on Advances in spatial and temporal databases
Getting critical categories of a data set
WAIM'11 Proceedings of the 12th international conference on Web-age information management
MUD: Mapping-based query processing for high-dimensional uncertain data
Information Sciences: an International Journal
Top-k best probability queries on probabilistic data
DASFAA'12 Proceedings of the 17th international conference on Database Systems for Advanced Applications - Volume Part II
On the semantics of top-k ranking for objects with uncertain data
Computers & Mathematics with Applications
Probabilistic frequent pattern growth for itemset mining in uncertain databases
SSDBM'12 Proceedings of the 24th international conference on Scientific and Statistical Database Management
Probabilistic ranking in fuzzy object databases
Proceedings of the 21st ACM international conference on Information and knowledge management
Probabilistic top-k dominating queries in uncertain databases
Information Sciences: an International Journal
Efficient pruning algorithm for top-K ranking on dataset with value uncertainty
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Context-aware top-K processing using views
Proceedings of the 22nd ACM international conference on Conference on information & knowledge management
Hi-index | 0.00 |
The dramatic growth in the number of application domains that naturally generate probabilistic, uncertain data has resulted in a need for efficiently supporting complex querying and decision-making over such data. In this paper, we present a unified approach to ranking and top-k query processing in probabilistic databases by viewing it as a multi-criteria optimization problem, and by deriving a set of features that capture the key properties of a probabilistic dataset that dictate the ranked result. We contend that a single, specific ranking function may not suffice for probabilistic databases, and we instead propose two parameterized ranking functions, called PRFω and PRFe, that generalize or can approximate many of the previously proposed ranking functions. We present novel generating functions-based algorithms for efficiently ranking large datasets according to these ranking functions, even if the datasets exhibit complex correlations modeled using probabilistic and/xor trees or Markov networks. We further propose that the parameters of the ranking function be learned from user preferences, and we develop an approach to learn those parameters. Finally, we present a comprehensive experimental study that illustrates the effectiveness of our parameterized ranking functions, especially PRFe, at approximating other ranking functions and the scalability of our proposed algorithms for exact or approximate ranking.