Regular N-Ary Queries in Trees and Variable Independence

IFIP International Federation for Information Processing
doi 10.1007/978-0-387-09680-3_29
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer US

Related search

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

2006English

The Number of M-Ary Search Trees on N Keys

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
1997English

Skarbek's Algorithm for T-Ary Trees

Computer Journal
Computer Science
2005English

Monadic Datalog and Regular Tree Pattern Queries

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

Learning Regular Sets From Queries and Counterexamples

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
1987English

Drawing Ordered (K − 1)–Ary Trees on K–Grids

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Enhanced Regular Path Queries on Semistructured Databases

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Adding Regular Expressions to Graph Reachability and Pattern Queries

2011English

Rewriting Regular XPath Queries on XML Views

2007English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy