Syntactic Characterization of Tree Database Schemas

Authors:
Nathan Goodman;Oded Shmueli
Affiliations:
Computer Science Department, Boston University, Boston, MA and Harvard University, Cambridge, Massachusetts;Computer Science Department, Technion-Israel Institute of Technology, Haifa 32000, Israel and Harvard University, Cambridge, Massachusetts
Venue:
Journal of the ACM (JACM)
Year:
1983

Citing 10
Cited 16

A simplied universal relation assumption and its properties

ACM Transactions on Database Systems (TODS)
Tree queries: a simple class of relational queries

ACM Transactions on Database Systems (TODS)
Maximal objects and the semantics of universal relation databases

ACM Transactions on Database Systems (TODS)
Using Semi-Joins to Solve Relational Queries

Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes

Journal of the ACM (JACM)
Degrees of acyclicity for hypergraphs and relational database schemes

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The U. R. strikes back

PODS '82 Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems
Properties of acyclic database schemes

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Analysis and design of relational schemata for database systems.

Analysis and design of relational schemata for database systems.

Distributed query processing

ACM Computing Surveys (CSUR)
The equivalence of solving queries and producing tree projections (extended abstract)

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
Sagiv,Y-On finite FD-acyclicity

PODS '86 Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems
A necessary condition for a doubly recursive rule to be equivalent to a linear recursive rule

SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
A polynomial time algorithm for testing implications of a join dependency and embodied functional dependencies

SIGMOD '88 Proceedings of the 1988 ACM SIGMOD international conference on Management of data
Attribute agreement

PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Linearization of Nonlinear Recursive Rules

IEEE Transactions on Software Engineering
Solving queries by tree projections

ACM Transactions on Database Systems (TODS)
Quasilinear algorithms for processing relational calculus expressions (preliminary report)

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of acyclic conjunctive queries

Journal of the ACM (JACM)
GYO reductions, canonical connections, tree and cyclic schemas and tree projections

PODS '83 Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems
Generalized hypertree decompositions: NP-hardness and tractable variants

Journal of the ACM (JACM)
Tree Projections: Game Characterization and Computational Aspects

Graph Theory, Computational Intelligence and Thought
On the power of structural decompositions of graph-based representations of constraint problems

Artificial Intelligence
A REVIEW OF TREE CONVEX SETS TEST

Computational Intelligence
Tree projections and structural decomposition methods: Minimality and game-theoretic characterization

Theoretical Computer Science

Quantified Score

Hi-index	0.01

Syntactic Characterization of Tree Database Schemas

Quantified Score

Visualization

Abstract