Robbers, marshals, and guards: game theoretic and logical characterizations of hypertree width
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On the Hardness of Learning Acyclic Conjunctive Queries
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
Relational Association Rules: Getting WARMeR
Proceedings of the ESF Exploratory Workshop on Pattern Detection and Discovery
DS '01 Proceedings of the 4th International Conference on Discovery Science
Weighted hypertree decompositions and optimal query plans
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Computing cores for data exchange: new algorithms and practical solutions
Proceedings of the twenty-fourth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Query answering exploiting structural properties
ACM SIGMOD Record
Equivalence of queries combining set and bag-set semantics
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Prediction-hardness of acyclic conjunctive queries
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Data integration: the teenage years
VLDB '06 Proceedings of the 32nd international conference on Very large data bases
Deciding equivalences among conjunctive aggregate queries
Journal of the ACM (JACM)
Weighted hypertree decompositions and optimal query plans
Journal of Computer and System Sciences
Generalized hypertree decompositions: np-hardness and tractable variants
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient core computation in data exchange
Journal of the ACM (JACM)
A unified theory of structural tractability for constraint satisfaction problems
Journal of Computer and System Sciences
Tree-width and functional dependencies in databases
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Heuristic Methods for Hypertree Decomposition
MICAI '08 Proceedings of the 7th Mexican International Conference on Artificial Intelligence: Advances in Artificial Intelligence
Querying structured information sources on the web
Proceedings of the 10th International Conference on Information Integration and Web-based Applications & Services
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
Equivalence of queries that are sensitive to multiplicities
The VLDB Journal — The International Journal on Very Large Data Bases
Generalized hypertree decompositions: NP-hardness and tractable variants
Journal of the ACM (JACM)
Non-binary constraints and optimal dual-graph representations
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Answer-set programming with bounded treewidth
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
On the power of structural decompositions of graph-based representations of constraint problems
Artificial Intelligence
dRDF: entailment for domain-restricted RDF
ESWC'08 Proceedings of the 5th European semantic web conference on The semantic web: research and applications
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Proceedings of the forty-second ACM symposium on Theory of computing
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
Querying structured information sources on the Web
International Journal of Metadata, Semantics and Ontologies
Database theory: query languages
Algorithms and theory of computation handbook
Conjunctive queries determinacy and rewriting
Proceedings of the 14th International Conference on Database Theory
The complexity of evaluating tuple generating dependencies
Proceedings of the 14th International Conference on Database Theory
On generalization and subsumption for ordered clauses
JSAI'05 Proceedings of the 2005 international conference on New Frontiers in Artificial Intelligence
On finding acyclic subhypergraphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
A unified framework for heterogeneous patterns
Information 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
Proceedings of the 15th International Conference on Database Theory
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
Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues
Theory and Practice of Logic Programming
Environmental service discovery based on semantically annotated OGC service descriptions
Proceedings of the 28th Annual ACM Symposium on Applied Computing
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
Tractable Hypergraph Properties for Constraint Satisfaction and Conjunctive Queries
Journal of the ACM (JACM)
ACM Transactions on Database Systems (TODS) - Invited papers issue
Skew strikes back: new developments in the theory of join algorithms
ACM SIGMOD Record
| Hi-index | 0.00 |