Algorithms for acyclic database schemes

Authors:
Mihalis Yannakakis
Affiliations:
-
Venue:
VLDB '81 Proceedings of the seventh international conference on Very Large Data Bases - Volume 7
Year:
1981

Citing 18
Cited 87

A simplied universal relation assumption and its properties

ACM Transactions on Database Systems (TODS)
Computational problems related to the design of normal form relational schemas

ACM Transactions on Database Systems (TODS)
The theory of joins in relational databases

ACM Transactions on Database Systems (TODS)
Efficient optimization of a class of relational expressions

ACM Transactions on Database Systems (TODS)
Testing implications of data dependencies

ACM Transactions on Database Systems (TODS)
Synthesizing third normal form relations from functional dependencies

ACM Transactions on Database Systems (TODS)
Multivalued dependencies and a new normal form for relational databases

ACM Transactions on Database Systems (TODS)
On the menbership problem for functional and multivalued dependencies in relational databases

ACM Transactions on Database Systems (TODS)
Equivalences Among Relational Expressions with the Union and Difference Operators

Journal of the ACM (JACM)
On the Complexity of Testing Implications of Functional and Join Dependencies

Journal of the ACM (JACM)
On the Equivalence of Database Models

Journal of the ACM (JACM)
Testing satisfaction of functional dependencies

Journal of the ACM (JACM)
A relational model of data for large shared data banks

Communications of the ACM
Principles of Database Systems

Principles of Database Systems
Can we use the universal instance assumption without using nulls?

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Real-world MVD's

SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
Properties of acyclic database schemes

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
A complete axiomatization for a large class of dependencies in relational datatbases

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing

On the properties and characterization of connection-trap-free schemes

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Query Evaluation via Tree-Decompositions

ICDT '01 Proceedings of the 8th International Conference on Database Theory
Containment for XPath Fragments under DTD Constraints

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Generating Relations from XML Documents

ICDT '03 Proceedings of the 9th International Conference on Database Theory
Hypertree Decompositions: A Survey

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning

LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Generalized Model-Checking Problems for First-Order Logic

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On the Hardness of Learning Acyclic Conjunctive Queries

ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
View-Based Query Answering and Query Containment over Semistructured Data

DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
Towards Discovery of Deep and Wide First-Order Structures: A Case Study in the Domain of Mutagenicity

DS '01 Proceedings of the 4th International Conference on Discovery Science
An incremental algorithm for computing ranked full disjunctions

Journal of Computer and System Sciences
Computational properties of argument systems satisfying graph-theoretic constraints

Artificial Intelligence
Exporting and interactively querying Web service-accessed sources: The CLIDE System

ACM Transactions on Database Systems (TODS)
On the minimization of XPath queries

Journal of the ACM (JACM)
Efficiently enumerating results of keyword search over data graphs

Information Systems
On the complexity of deriving schema mappings from database instances

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tree-width and functional dependencies in databases

Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Graph-based query rewriting for knowledge sharing between peer ontologies

Information Sciences: an International Journal
Generating all maximal induced subgraphs for hereditary and connected-hereditary graph properties

Journal of Computer and System Sciences
A unified apriori-like algorithm for conjunctive query containment

IDEAS '08 Proceedings of the 2008 international symposium on Database engineering & applications
XPath leashed

ACM Computing Surveys (CSUR)
Heuristic Methods for Hypertree Decomposition

MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
A Logical Approach to Constraint Satisfaction

Complexity of Constraints
Uniform Constraint Satisfaction Problems and Database Theory

Complexity of Constraints
Faster join-projects and sparse matrix multiplications

Proceedings of the 12th International Conference on Database Theory
Deciding equivalence of top--down XML transformations in polynomial time

Journal of Computer and System Sciences
The Monadic Second-order Logic Evaluation Problem on Finite Colored Trees: a Database-theoretic Approach

Fundamenta Informaticae
Block-wise construction of acyclic relational features with monotone irreducibility and relevancy properties

ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Semantics and complexity of SPARQL

ACM Transactions on Database Systems (TODS)
Generalized hypertree decompositions: NP-hardness and tractable variants

Journal of the ACM (JACM)
Efficient algorithms for descendant-only tree pattern queries

Information Systems
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions

ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
HyperConsistency Width for Constraint Satisfaction: Algorithms and Complexity Results

Graph Theory, Computational Intelligence and Thought
Pure Nash equilibria: hard and easy games

Journal of Artificial Intelligence Research
A tractability result for reasoning with incomplete first-order knowledge bases

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Algorithms for propositional model counting

Journal of Discrete Algorithms
Constraint satisfaction with bounded treewidth revisited

Journal of Computer and System Sciences
Schema mapping discovery from data instances

Journal of the ACM (JACM)
Critical remarks on belief updating in Bayesian networks

CI '07 Proceedings of the Third IASTED International Conference on Computational Intelligence
Polynomial constraints for sets with cardinality bounds

FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Probabilistic reasoning in Bayesian networks: a relational database approach

AI'03 Proceedings of the 16th Canadian society for computational studies of intelligence conference on Advances in artificial intelligence
Algorithms for propositional model counting

LPAR'07 Proceedings of the 14th international conference on Logic for programming, artificial intelligence and reasoning
Efficient algorithms for the tree homeomorphism problem

DBPL'07 Proceedings of the 11th international conference on Database programming languages
Tractable hypergraph properties for constraint satisfaction and conjunctive queries

Proceedings of the forty-second ACM symposium on Theory of computing
Positive higher-order queries

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The power of tree projections: local consistency, greedy algorithms, and larger islands of tractability

Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Tree-width for first order formulae

CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Constraint satisfaction with succinctly specified relations

Journal of Computer and System Sciences
Database theory: query languages

Algorithms and theory of computation handbook
Efficient enumeration for conjunctive queries over x-underbar structures

CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Foundations of Semantic Web databases

Journal of Computer and System Sciences
Optimizing the distributed evaluation of stratified programs via structural analysis

LPNMR'11 Proceedings of the 11th international conference on Logic programming and nonmonotonic reasoning
Gaussian logic for predictive classification

ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II
Structural tractability of constraint optimization

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
H-DB: a hybrid quantitative-structural sql optimizer

Proceedings of the 20th ACM international conference on Information and knowledge management
Arboricity: An acyclic hypergraph decomposition problem motivated by database theory

Discrete Applied Mathematics
Union rewritings for XPath fragments

Proceedings of the 15th Symposium on International Database Engineering & Applications
Boosting tuple propagation in multi-relational classification

Proceedings of the 15th Symposium on International Database Engineering & Applications
Extension Preservation Theorems on Classes of Acyclic Finite Structures

SIAM Journal on Computing
A new n-ary existential quantifier in description logics

KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence
Database query processing using finite cursor machines

ICDT'07 Proceedings of the 11th international conference on Database Theory
First-Order queries over one unary function

CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Caching frequent XML query patterns

APWeb'06 Proceedings of the 2006 international conference on Advanced Web and Network Technologies, and Applications
Conjunctive query evaluation by search tree revisited

ICDT'05 Proceedings of the 10th international conference on Database Theory
An abstract framework for generating maximal answers to queries

ICDT'05 Proceedings of the 10th international conference on Database Theory
Hypertree decompositions: structure, algorithms, and applications

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Querying faceted databases

SWDB'04 Proceedings of the Second international conference on Semantic Web and Databases
On finding acyclic subhypergraphs

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Incrementally computing ordered answers of acyclic conjunctive queries

NGITS'06 Proceedings of the 6th international conference on Next Generation Information Technologies and Systems
Static analysis and optimization of semantic web queries

PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Efficient approximations of conjunctive queries

PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Some characterizations of γ and β-acyclicity of hypergraphs

Information Processing Letters
Constraint optimization problems and bounded tree-width revisited

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
The Monadic Second-order Logic Evaluation Problem on Finite Colored Trees: a Database-theoretic Approach

Fundamenta Informaticae
On acyclic conjunctive queries and constant delay enumeration

CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Structural tractability of enumerating CSP solutions

Constraints
Semantic acyclicity on graph databases

Proceedings of the 32nd symposium on Principles of database systems
Querying graph databases

Proceedings of the 32nd symposium on Principles of database systems
The complexity of mining maximal frequent subgraphs

Proceedings of the 32nd symposium on Principles of database systems
Tractable counting of the answers to conjunctive queries

Journal of Computer and System Sciences
Static analysis and optimization of semantic web queries

ACM Transactions on Database Systems (TODS) - Invited papers issue
Decomposing combinatorial auctions and set packing problems

Journal of the ACM (JACM)
The complexity of weighted counting for acyclic conjunctive queries

Journal of Computer and System Sciences
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries

Journal of the ACM (JACM)
Tractable queries for lightweight description logics

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Skew strikes back: new developments in the theory of join algorithms

ACM SIGMOD Record

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many real-world situations can be captured by a set of functional dependencies and a single join dependency of a particular form called acyclic [B..]. The join dependency corresponds to a natural decomposition into meaningfull objects (an acyclic database scheme). Our purpose in this paper is to describe efficient algorithms in this setting for various problems, such as computing projections, minimizing joins, inferring dependencies, and testing for dependency satisfaction.