Parameterized complexity for the database theorist
ACM SIGMOD Record
XPath processing in a nutshell
ACM SIGMOD Record
XPath Containment in the Presence of Disjunction, DTDs, and Variables
ICDT '03 Proceedings of the 9th International Conference on Database Theory
XPath processing in a nutshell
ACM SIGMOD Record
Monadic datalog and the expressive power of languages for Web information extraction
Journal of the ACM (JACM)
Logic-based web information extraction
ACM SIGMOD Record
Conditional XPath, the first order complete XPath dialect
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Conjunctive queries over trees
PODS '04 Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient algorithms for processing XPath queries
ACM Transactions on Database Systems (TODS)
Semantic characterizations of navigational XPath
ACM SIGMOD Record
ACM Transactions on Database Systems (TODS) - Special Issue: SIGMOD/PODS 2004
Conjunctive queries over trees
Journal of the ACM (JACM)
Processing queries on tree-structured data efficiently
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Structural characterizations of the semantics of XPath as navigation tool on a document
Proceedings of the twenty-fifth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Characterizing EF and EX tree logics
Theoretical Computer Science - Concurrency theory (CONCUR 2004)
Comparing XML path expressions
Proceedings of the 2006 ACM symposium on Document engineering
Interactive learning of node selecting tree transducer
Machine Learning
Dominance constraints in stratified context unification
Information Processing Letters
The complexity of query containment in expressive fragments of XPath 2.0
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
An analysis of XQuery benchmarks
Information Systems
Effective characterizations of tree logics
Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Theoretical Computer Science
Logics and Automata for Totally Ordered Trees
RTA '08 Proceedings of the 19th international conference on Rewriting Techniques and Applications
ACM Computing Surveys (CSUR)
Applying model-checking to solve queries on semistructured data
Computer Languages, Systems and Structures
Recursion in XQuery: put your distributivity safety belt on
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Efficient maintenance techniques for views over active documents
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Completeness and Complexity of Multi-modal CTL
Electronic Notes in Theoretical Computer Science (ENTCS)
Satisfiability and relevance for queries over active documents
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
The complexity of query containment in expressive fragments of XPath 2.0
Journal of the ACM (JACM)
Efficient inclusion checking for deterministic tree automata and XML Schemas
Information and Computation
Finding state solutions to temporal logic queries
IFM'07 Proceedings of the 6th international conference on Integrated formal methods
On safety, computability and local property of web queries
APWeb'08 Proceedings of the 10th Asia-Pacific web conference on Progress in WWW research and development
Logic in databases: report on the LID 2008 workshop
ACM SIGMOD Record
The model checking problem for prefix classes of second-order logic: a survey
Fields of logic and computation
Automata for positive core XPath queries on compressed documents
LPAR'06 Proceedings of the 13th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
N-ary queries by tree automata
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
A formal comparison of visual web wrapper generators
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
WDEE: web data extraction by example
DASFAA'05 Proceedings of the 10th international conference on Database Systems for Advanced Applications
Web and semantic web query languages: a survey
Proceedings of the First international conference on Reasoning Web
Learning n-ary node selecting tree transducers from completely annotated examples
ICGI'06 Proceedings of the 8th international conference on Grammatical Inference: algorithms and applications
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
Journal of Discrete Algorithms
Query induction with schema-guided pruning strategies
The Journal of Machine Learning Research
LICS '13 Proceedings of the 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science
| Hi-index | 0.00 |
Monadic query languages over trees currently receive considerable interest in the database community, as the problem of selecting nodes from a tree is the most basic and widespread database query problem in the context of XML. Partly a survey of recent work done by the authors and their group on logical query languages for this problem and their expressiveness, this paper provides a number of new results related to the complexity of such languages over so-called axis relations (such as "child" or "descendant") which are motivated by their presence in the XPath standard or by their utility for data extraction (wrapping).