Efficient Evaluation of N-Ary Conjunctive Queries Over Trees and Graphs

doi 10.1145/1183550.1183555
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

Regular N-Ary Queries in Trees and Variable Independence

IFIP International Federation for Information Processing
English

Static Optimization of Conjunctive Queries With Sliding Windows Over Infinite Streams

2004English

The Number of M-Ary Search Trees on N Keys

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
1997English

Mining Association Rules of Simple Conjunctive Queries

2008English

Optimizing Conjunctive Queries That Contain Untyped Variables

SIAM Journal on Computing
MathematicsComputer Science
1983English

Query Driven Hypothesis Generation for Answering Queries Over NLP Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2012English

Efficient In-Network Evaluation of Multiple Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

The Fine Classification of Conjunctive Queries and Parameterized Logarithmic Space

ACM Transactions on Computation Theory
Computational TheoryTheoretical Computer ScienceMathematics
2015English

Using Reformulation Trees to Optimize Queries Over Distributed Heterogeneous Sources

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy