This book is devoted to the study of the semantics and assuring the efficient execution of database query languages, where the database contains semistructured and time-varying information. The primary focus of the work presented is the definition of an effective graph-based approach to the formalization of query languages for semistructured and temporal information; as a result, query execution can be reduced to searching the database for subgraphs that are similar to the given query graph and thus can be supported through bisimualtion. By integrating and refining graph-based methods and bisimulation, the author develops a powerful and flexible paradigm. The second research challenge solved is that of efficient implementation by modeling graphical queries as formulas in modal logic and interpreting database instance graphs as Kripke transition systems.
| ISBN: | 9783540209713 |
| Publication date: | 6th February 2004 |
| Author: | Elisa Quintarelli |
| Publisher: | Springer an imprint of Springer Berlin Heidelberg |
| Format: | Paperback |
| Pagination: | 134 pages |
| Series: | Lecture Notes in Computer Science |
| Genres: |
Algorithms and data structures Information theory Business mathematics and systems Data warehousing Information retrieval Applied computing Business applications Databases |
This book is devoted to the study of the semantics and assuring the efficient execution of database query languages, where the database contains semistructured and time-varying information. The primary focus of the work presented is the definition of an effective graph-based approach to the formalization of query languages for semistructured and temporal information; as a result, query execution can be reduced to searching the database for subgraphs that are similar to the given query graph and thus can be supported through bisimualtion. By integrating and refining graph-based methods and bisimulation, the author develops a powerful and flexible paradigm. The second research challenge solved is that of efficient implementation by modeling graphical queries as formulas in modal logic and interpreting database instance graphs as Kripke transition systems.
Model-Checking Based Data Retrieval features in the following genres: Algorithms and data structures, Information theory, Business mathematics and systems, Data warehousing, Information retrieval, Applied computing, Business applications, Databases
Model-Checking Based Data Retrieval is available in Paperback
Model-Checking Based Data Retrieval was written by Elisa Quintarelli and published by Springer an imprint of Springer Berlin Heidelberg
Model-Checking Based Data Retrieval has 134 pages
Yes it is part of Lecture Notes in Computer Science series