Probabilistic reasoning in intelligent systems: networks of plausible inference
Probabilistic reasoning in intelligent systems: networks of plausible inference
Practical selectivity estimation through adaptive sampling
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Elements of information theory
Elements of information theory
A probabilistic relational model for the integration of IR and databases
SIGIR '93 Proceedings of the 16th annual international ACM SIGIR conference on Research and development in information retrieval
A probabilistic relational model and algebra
ACM Transactions on Database Systems (TODS)
Wavelet-based histograms for selectivity estimation
SIGMOD '98 Proceedings of the 1998 ACM SIGMOD international conference on Management of data
Probabilistic frame-based systems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Approximate computation of multidimensional aggregates of sparse data using wavelets
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Join synopses for approximate query answering
SIGMOD '99 Proceedings of the 1999 ACM SIGMOD international conference on Management of data
Learning in graphical models
A tutorial on learning with Bayesian networks
Learning in graphical models
Approximate Query Processing Using Wavelets
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
Selectivity Estimation Without the Attribute Value Independence Assumption
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
Learning Probabilistic Relational Models
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Towards a Theory Revision Approach for the Vertical Fragmentation of Object Oriented Databases
SBIA '02 Proceedings of the 16th Brazilian Symposium on Artificial Intelligence: Advances in Artificial Intelligence
Approximate Query Processing: Taming the TeraBytes
Proceedings of the 27th International Conference on Very Large Data Bases
Learning with Concept Hierarchies in Probabilistic Relational Data Mining
WAIM '02 Proceedings of the Third International Conference on Advances in Web-Age Information Management
On schema matching with opaque column names and data values
Proceedings of the 2003 ACM SIGMOD international conference on Management of data
Beyond Independence: Probabilistic Models for Query Approximation on Binary Transaction Data
IEEE Transactions on Knowledge and Data Engineering
ACM SIGKDD Explorations Newsletter
Selectivity Estimation for XML Twigs
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Fast computation of database operations using graphics processors
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Conditional selectivity for statistics on query expressions
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
A formal analysis of information disclosure in data exchange
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
CORDS: automatic discovery of correlations and soft functional dependencies
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
Towards a robust query optimizer: a principled and practical approach
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
Consistently estimating the selectivity of conjuncts of predicates
VLDB '05 Proceedings of the 31st international conference on Very large data bases
Content-based routing: different plans for different data
VLDB '05 Proceedings of the 31st international conference on Very large data bases
PRL: A probabilistic relational language
Machine Learning
Graph-based synopses for relational selectivity estimation
Proceedings of the 2006 ACM SIGMOD international conference on Management of data
GORDIAN: efficient and scalable discovery of composite keys
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Consistent selectivity estimation via maximum entropy
The VLDB Journal — The International Journal on Very Large Data Bases
Fast computation of database operations using graphics processors
SIGGRAPH '05 ACM SIGGRAPH 2005 Courses
Compressed histograms with arbitrary bucket layouts for selectivity estimation
Information Sciences: an International Journal
A formal analysis of information disclosure in data exchange
Journal of Computer and System Sciences
Optimized stratified sampling for approximate query processing
ACM Transactions on Database Systems (TODS)
Selectivity estimation of range queries based on data density approximation via cosine series
Data & Knowledge Engineering
The history of histograms (abridged)
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
SASH: a self-adaptive histogram set for dynamically changing workloads
VLDB '03 Proceedings of the 29th international conference on Very large data bases - Volume 29
Model-driven data acquisition in sensor networks
VLDB '04 Proceedings of the Thirtieth international conference on Very large data bases - Volume 30
Detecting attribute dependencies from query feedback
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Probabilistic graphical models and their role in databases
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Foundations and Trends in Databases
Linked Bernoulli Synopses: Sampling along Foreign Keys
SSDBM '08 Proceedings of the 20th international conference on Scientific and Statistical Database Management
Mining Conditional Cardinality Patterns for Data Warehouse Query Optimization
DaWaK '08 Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery
Approximate lineage for probabilistic databases
Proceedings of the VLDB Endowment
PRIB '08 Proceedings of the Third IAPR International Conference on Pattern Recognition in Bioinformatics
Note: Order statistics and estimating cardinalities of massive data sets
Discrete Applied Mathematics
TuG synopses for approximate query answering
ACM Transactions on Database Systems (TODS)
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Query optimizers: time to rethink the contract?
Proceedings of the 2009 ACM SIGMOD International Conference on Management of data
Continuous Spatial Authentication
SSTD '09 Proceedings of the 11th International Symposium on Advances in Spatial and Temporal Databases
A new look at generating multi-join continuous query plans: A qualified plan generation problem
Data & Knowledge Engineering
Continuous authentication on relational streams
The VLDB Journal — The International Journal on Very Large Data Bases
Bayesian reasoning for sensor group-queries and diagnosis
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Understanding cardinality estimation using entropy maximization
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Sharing-aware horizontal partitioning for exploiting correlations during query processing
Proceedings of the VLDB Endowment
ACM Transactions on Database Systems (TODS)
Optimization of sub-query processing in distributed data integration systems
Journal of Network and Computer Applications
Data generation using declarative constraints
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
The VC-dimension of SQL queries and selectivity estimation through sampling
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Spatial selectivity estimation using compressed histogram information
APWeb'05 Proceedings of the 7th Asia-Pacific web conference on Web Technologies Research and Development
Query evaluation on a database given by a random graph
ICDT'07 Proceedings of the 11th international conference on Database Theory
Learning approximate MRFs from large transaction data
PKDD'06 Proceedings of the 10th European conference on Principle and Practice of Knowledge Discovery in Databases
Database security protection via inference detection
ISI'06 Proceedings of the 4th IEEE international conference on Intelligence and Security Informatics
Understanding cardinality estimation using entropy maximization
ACM Transactions on Database Systems (TODS)
Understanding tuberculosis epidemiology using structured statistical models
Artificial Intelligence in Medicine
Synopses for Massive Data: Samples, Histograms, Wavelets, Sketches
Foundations and Trends in Databases
Sharing statistics for SPARQL federation optimization, with emphasis on benchmark quality
ESWC'12 Proceedings of the 9th international conference on The Semantic Web: research and applications
Selection and pruning algorithms for bitmap index selection problem using data mining
DaWaK'07 Proceedings of the 9th international conference on Data Warehousing and Knowledge Discovery
Efficiently adapting graphical models for selectivity estimation
The VLDB Journal — The International Journal on Very Large Data Bases
Selectivity estimation for hybrid queries over text-rich data graphs
Proceedings of the 16th International Conference on Extending Database Technology
Data Quality of Query Results with Generalized Selection Conditions
Operations Research
Efficient co-processor utilization in database query processing
Information Systems
Modelling relational statistics with Bayes Nets
Machine Learning
Exploring optimization and caching for efficient collection operations
Automated Software Engineering
Hi-index | 0.00 |
Estimating the result size of complex queries that involve selection on multiple attributes and the join of several relations is a difficult but fundamental task in database query processing. It arises in cost-based query optimization, query profiling, and approximate query answering. In this paper, we show how probabilistic graphical models can be effectively used for this task as an accurate and compact approximation of the joint frequency distribution of multiple attributes across multiple relations. Probabilistic Relational Models (PRMs) are a recent development that extends graphical statistical models such as Bayesian Networks to relational domains. They represent the statistical dependencies between attributes within a table, and between attributes across foreign-key joins. We provide an efficient algorithm for constructing a PRM front a database, and show how a PRM can be used to compute selectivity estimates for a broad class of queries. One of the major contributions of this work is a unified framework for the estimation of queries involving both select and foreign-key join operations. Furthermore, our approach is not limited to answering a small set of predetermined queries; a single model can be used to effectively estimate the sizes of a wide collection of potential queries across multiple tables. We present results for our approach on several real-world databases. For both single-table multi-attribute queries and a general class of select-join queries, our approach produces more accurate estimates than standard approaches to selectivity estimation, using comparable space and time.