05005nam 22007935 450 991014420950332120200706111307.01-280-30686-697866103068623-540-24603-710.1007/b94902(CKB)1000000000212285(DE-He213)978-3-540-24603-9(SSID)ssj0000203931(PQKBManifestationID)11181378(PQKBTitleCode)TC0000203931(PQKBWorkID)10174067(PQKB)11150550(MiAaPQ)EBC3087737(PPN)155189573(EXLCZ)99100000000021228520121227d2004 u| 0engurnn#008mamaatxtrdacontentcrdamediacrrdacarrierModel-Checking Based Data Retrieval An Application to Semistructured and Temporal Data /by Elisa Quintarelli1st ed. 2004.Berlin, Heidelberg :Springer Berlin Heidelberg :Imprint: Springer,2004.1 online resource (XVII, 135 p.)Lecture Notes in Computer Science,0302-9743 ;2917Bibliographic Level Mode of Issuance: Monograph3-540-20971-9 Includes bibliographical references.1. Introduction -- 2. Semantics Based on Bisimulation -- 3. Model-Checking Based Data Retrieval -- 4. Temporal Aspects of Semistructured Data -- 5. Related Works -- 6. Conclusion.This thesis deals with the problems of characterizing the semantics of and assuring efficient execution for database query languages, where the database contains semistructured and time-varying information. This area of technology is of much interest and significance for databases and knowledge bases; it also presents many challenging research problems deserving an in-depth investigation.Thus, the topic of Elisa Quintarelli’s dissertation is well chosen and totally appropriate to the current research trends. In her thesis, Elisa addresses a number of related problems. However, her work and contributions concentrate on two main problems. The first is the definition of an effective graph-based approach to the formalization of query languages for semistructured and temporal information. In her approach, query execution is viewed as the process of matching the query graph with the database instance graph; therefore, query execution reduces to searching the database for subgraphs that are similar to the given query graph. The search for such matches can be supported through the computational process of biosimulation. This approach is used to de?ne the semantics of several languages, including graphical languages, such as G-Log and GraphLog, semistructured information languages, such as Lorel, and temporal languages, such as TSS-QL. Both graph-based approaches and biosimulation had been used by previous authors for defining query languages and their semantics; however, this work goes well beyond previous approaches by integrating and refining these techniques into a flexible and powerful paradigm that Elisa demonstrates to be effective on a spectrum of languages and a suite of alt- native semantics.Lecture Notes in Computer Science,0302-9743 ;2917Data structures (Computer science)Database managementInformation storage and retrievalApplication softwareInformation technologyBusiness—Data processingData Structures and Information Theoryhttps://scigraph.springernature.com/ontologies/product-market-codes/I15009Database Managementhttps://scigraph.springernature.com/ontologies/product-market-codes/I18024Information Storage and Retrievalhttps://scigraph.springernature.com/ontologies/product-market-codes/I18032Information Systems Applications (incl. Internet)https://scigraph.springernature.com/ontologies/product-market-codes/I18040IT in Businesshttps://scigraph.springernature.com/ontologies/product-market-codes/522000Data structures (Computer science).Database management.Information storage and retrieval.Application software.Information technology.Business—Data processing.Data Structures and Information Theory.Database Management.Information Storage and Retrieval.Information Systems Applications (incl. Internet).IT in Business.025.04Quintarelli Elisaauthttp://id.loc.gov/vocabulary/relators/aut597777MiAaPQMiAaPQMiAaPQBOOK9910144209503321Model-Checking Based Data Retrieval1026858UNINA