Efficient Evaluation of
Explore this paper's citation graph
Summary
This paper finds a class of queries that exactly capture efficient evaluation for HAVING queries without self-joins, and uses a novel technique to compute the marginal distributions of elements in a semiring, which may be of independent interest.
- Type
- article
- Published
- 2007-09-23
- Cited by
- 49
- References
- 29
- OpenAlex
- https://openalex.org/W89376075
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:7842839
Keywords
Computer science
References
- The State of Record Linkage and Current Research Problems
- Trio: A System for Integrated Management of Data, Accuracy, and Lineage
- Foundations of Databases
- Models for Incomplete and Probabilistic Information
- Challenges inbuilding a DBMS Resource Advisor
- OLAP over uncertain and imprecise data
- ProbView
- The merge/purge problem for large databases
- Efficient Top-k Query Evaluation on Probabilistic Data
- Aggregate operators in probabilistic databases
- Efficient aggregation algorithms for probabilistic data
- The complexity of query reliability
- Creating probabilistic databases from information extraction models
- Integrating Unstructured Data into Relational Databases
- The Complexity of Enumeration and Reliability Problems
- Representing and Querying Correlated Tuples in Probabilistic Databases
- The Management of Probabilistic Data
- Working Models for Uncertain Data
- Structured Querying of Web Text Data: A Technical Challenge
- Query Evaluation on Probabilistic Databases
Cited by
- Implementing NOT EXISTS Predicates over a Probabilistic Database
- Computing Uncertain Key Indicators from Uncertain Data
- Making massive probabilistic databases practical
- Embracing Uncertainty in Large-Scale Computational Astrophysics.
- Provenance and uncertainty
- Continuous Uncertainty in Trio
- Directional Statistics, Bayesian Methods of Earthquake Focal Mechanism Estimation, and Their Application to New Zealand Seismicity Data
- Functional Dependencies Over Possibilistic Databases: An Interpretation Based on the Possible Worlds Semantics.
- Range queries on uncertain data
- PReach: Reachability in Probabilistic Signaling Networks
- The trichotomy of HAVING queries on a probabilistic database
- Finding a residence with All Facilities using Nearest Neighbor Search
- Triangular domain extension of linear Bernstein-like trigonometric polynomial basis
- Incorporating constraints in probabilistic XML
- Query efficiency in probabilistic XML models
- Capturing continuous data and answering aggregate queries in probabilistic XML
- Query evaluation with soft-key constraints
- A survey of queries over uncertain data
- Reachability analysis in large probabilistic biological networks
- Reachability Analysis in Probabilistic Biological Networks
Related papers
- Study of a Practical and Efficient Structural Optimization Method
- Efficient adaptive experimental design
- Building process optimization through an efficient data management
- The Reference Point Optimization Approach - Methods of Efficient Implementation
- Analysis Tools for Robust and Cost Efficient Design of Composite Structures