Highly Expressive Query Languages for Unordered Data Trees

Theory of Computing Systems - United States
doi 10.1007/s00224-015-9617-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Logics for Unordered Trees With Data Constraints

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
2019English

The Expressive Power of Temporal Relational Query Languages

IEEE Transactions on Knowledge and Data Engineering
Computational TheoryComputer Science ApplicationsInformation SystemsMathematics
1997English

Comparing the Succinctness of Monadic Query Languages Over Finite Trees

RAIRO - Theoretical Informatics and Applications
MathematicsComputer Science ApplicationsSoftware
2004English

Data Complexity of Query Answering in Expressive Description Logics via Tableaux

Journal of Automated Reasoning
Computational TheorySoftwareArtificial IntelligenceMathematics
2008English

Trajectory Databases: Data Models, Uncertainty and Complete Query Languages

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Definability Problems for Graph Query Languages

2013English

Finite Query Languages for Sequence Databases

1995English

Mining Databases and Data Streams With Query Languages and Rules

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

Naturally Embedded Query Languages

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1992English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy