Automatic verification of finite-state concurrent systems using temporal logic specifications
ACM Transactions on Programming Languages and Systems (TOPLAS)
Three partition refinement algorithms
SIAM Journal on Computing
CCS expressions finite state processes, and three problems of equivalence
Information and Computation
Handbook of theoretical computer science (vol. B)
A query language and optimization techniques for unstructured data
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
A query language for a Web-site management system
ACM SIGMOD Record
GraphLog: a visual formalism for real life recursion
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XML-GL: a graphical language for querying and restructuring XML documents
WWW '99 Proceedings of the eighth international conference on World Wide Web
Data on the Web: from relations to semistructured data and XML
Data on the Web: from relations to semistructured data and XML
Minimization of tree pattern queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
A Calculus of Communicating Systems
A Calculus of Communicating Systems
Containment and equivalence for an XPath fragment
Proceedings of the twenty-first ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Operational and abstract semantics of the query language G-Log
Theoretical Computer Science
G-Log: A Graph-Based Query Language
IEEE Transactions on Knowledge and Data Engineering
Querying Semistructured Heterogeneous Information
DOOD '95 Proceedings of the Fourth International Conference on Deductive and Object-Oriented Databases
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Adding Structure to Unstructured Data
ICDT '97 Proceedings of the 6th International Conference on Database Theory
Monadic Queries over Tree-Structured Data
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Concurrency and Automata on Infinite Sequences
Proceedings of the 5th GI-Conference on Theoretical Computer Science
CAV '00 Proceedings of the 12th International Conference on Computer Aided Verification
Model-Checking Based Data Retrieval
DBPL '01 Revised Papers from the 8th International Workshop on Database Programming Languages
The complexity of XPath query evaluation
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
XPath processing in a nutshell
ACM SIGMOD Record
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
The Subgraph Bisimulation Problem
IEEE Transactions on Knowledge and Data Engineering
A Graphical Environment to Query XML Data with XQuery
WISE '03 Proceedings of the Fourth International Conference on Web Information Systems Engineering
An efficient algorithm for computing bisimulation equivalence
Theoretical Computer Science
CTL Model Checking for Processing Simple XPath Queries
TIME '04 Proceedings of the 11th International Symposium on Temporal Representation and Reasoning
Efficient algorithms for processing XPath queries
VLDB '02 Proceedings of the 28th international conference on Very Large Data Bases
First order paths in ordered trees
ICDT'05 Proceedings of the 10th international conference on Database Theory
Data quality through model checking techniques
IDA'11 Proceedings of the 10th international conference on Advances in intelligent data analysis X
Hi-index | 0.00 |
The large volume and nature of data available to the casual users and programs motivate the increasing interest of the database community in studying flexible and efficient techniques for extracting and querying semistructured data. On the other hand, efficient methods have been discovered for solving the so-called model-checking problem for some modal logics. The aim of this paper is to show how some of these methods can be used for querying semistructured data. For doing that we show that semistructured data can be naturally seen as Kripke Transition Systems. To keep the presentation independent of a specific language, we introduce a graphical query language that includes some of the features of the query languages based on graphs and patterns. We show how to associate CTL formulas to queries of this language. This allows us to see the problems of solving a query as an instance of the model-checking problem for CTL that can be solved in polynomial time. We have tested the method by using a model-checker, and have studied the applicability of the method to some existing languages for semistructured databases.