databaseprogramminglanguages (DBPL) meeting was held in Trondeheim, Norway on August 28-29, 2005. the issues which formed the part of the symposium include, the vertical approach embodied in database and programming...
详细信息
databaseprogramminglanguages (DBPL) meeting was held in Trondeheim, Norway on August 28-29, 2005. the issues which formed the part of the symposium include, the vertical approach embodied in database and programminglanguages such as XPath, and the horizontal approach as found in programminglanguages such as Duce. the issues regarding the problem of data integration were discussed such as the expression of global schema as a constraint set and secondly, the complications of node identity. the problem of compiling pattern matching was also considered, and a method was proposed that utilizes the schema of the input value to generate efficient code.
the proceedings contain 18 papers. the topics discussed include: patterns and types for querying XML documents;dual syntax for XML languages;efficiently enumerating results of keyword search;inconsistency tolerance in...
详细信息
ISBN:
(纸本)3540309519
the proceedings contain 18 papers. the topics discussed include: patterns and types for querying XML documents;dual syntax for XML languages;efficiently enumerating results of keyword search;inconsistency tolerance in P2P data integration: an epistemic logic approach;XML data integration with identification;XML subtree queries: specification and composition;on the expressive power of XQuery fragments;type-based optimization for regular patterns;efficient memory representation of XML documents;minimizing tree automata for unranked trees;dependency-preserving normalization of relational and XML data;complexity and approximation of fixing numerical attributes in databases under integrity constraints;and consistent query answers on numerical databases under aggregate constraints.
Computer technology has transformed the way people interact online within society. the integration of (GIoT) combines Artificial Intelligence (AI) and Internet of things (IoT) technology, offering numerous benefits in...
详细信息
ISBN:
(数字)9798331511890
ISBN:
(纸本)9798331511906
Computer technology has transformed the way people interact online within society. the integration of (GIoT) combines Artificial Intelligence (AI) and Internet of things (IoT) technology, offering numerous benefits in many fields for innovation and growth. GIoT helps with real-time applications for data prediction and alerts. Based on the authors' understanding and searches in scholarly databases, less bibliometric analysis has yet been performed on Generative Artificial Intelligence (GAI) for the IoT, even though such analyses are crucial for research development in this field. this study conducted a thorough bibliometric examination of GAI applications in the IoT over the period from 2014 to 2024. the analysis is based on a dataset of 296 documents sourced from the Scopus database. the bibliometric review was conducted using the Biblioshiny application, a tool available within the Bibliometric package in the R programming language. Top literature sources, major fields of study, nations, well-known authors, popular subjects, authorship, citations, author-keywords, and co-keywords were all subjected to bibliometric analysis.
XML is successful as a machine processable data interchange format, but it is often too verbose for human use. For this reason, many XML languages permit an alternative more legible non-XML syntax. XSLT styleshects ar...
详细信息
XML is successful as a machine processable data interchange format, but it is often too verbose for human use. For this reason, many XML languages permit an alternative more legible non-XML syntax. XSLT styleshects are often used to convert from the XML syntax to the alternative syntax;however, such transformations are not reversible since no general tool exists to automatically parse the alternative syntax back into XML. We present XSugar, which makes it possible to manage dual syntax for XML languages. An XSugar specification is built around a context-free grammar that unifies the two syntaxes of a language. Given such a specification, the XSugar tool can translate from alternative syntax to XML and vice versa. Moreover, the tool statically checks that the transformations are reversible and that all XML documents generated from the alternative syntax are valid according to a given XML schema. (C) 2008 Elsevier B.V. All rights reserved.
the problem of extracting consistent information from relational databases violating integrity constraints on numerical data is addressed. In particular, aggregate constraints defined as linear inequalities on aggrega...
详细信息
ISBN:
(纸本)3540309519
the problem of extracting consistent information from relational databases violating integrity constraints on numerical data is addressed. In particular, aggregate constraints defined as linear inequalities on aggregate-sum queries on input data are considered. the notion of repair as consistent set of updates at attribute-value level is exploited, and the characterization of several data-complexity issues related to repairing data and computing consistent query answers is provided.
Unstructured p2p database systems are usually characterized by the presence of schema mappings among peers. In these systems, the detection of corrupted mappings is a key problem. A corrupted mapping fails in matching...
详细信息
ISBN:
(纸本)3540309519
Unstructured p2p database systems are usually characterized by the presence of schema mappings among peers. In these systems, the detection of corrupted mappings is a key problem. A corrupted mapping fails in matching the target or the source schema, hence it is not able to transform data conforming to a schema S-i into data conforming to a schema S-j, nor it can be used for effective query reformulation. this paper describes a novel technique for maintaining mappings in XML p2p databases, based on a semantic notion of mapping correctness.
this paper presents an environment to support high-level databaseprogramming in the multi-paradigm declarative programming language Curry. We define an application programming interface (API) that abstracts from the ...
详细信息
ISBN:
(纸本)9783540774419
this paper presents an environment to support high-level databaseprogramming in the multi-paradigm declarative programming language Curry. We define an application programming interface (API) that abstracts from the concrete database access methods. the API supports transactions and exploits Curry's type system to ensure a strict separation between queries and updates. In order to ensure database updates that are safe w.r.t. an intended data model (e.g., containing specific relations between entities), we assume a description of the data dependencies in the entity-relationship (ER) model from which all access and update operations related to the database are generated. We propose a representation of ER diagrams in the declarative language Curry so that they can be constructed by various tools and then translated into this representation. Furthermore, we have implemented a compiler from this representation into a Curry program that provides safe access and update operations based on the API for databaseprogramming.
A frequent task encountered in XML processing is to filter an input document to produce a subdocument;that is, a document whose root-to-leaf paths are root-to-leaf paths of the original document and which inherits the...
详细信息
ISBN:
(纸本)3540309519
A frequent task encountered in XML processing is to filter an input document to produce a subdocument;that is, a document whose root-to-leaf paths are root-to-leaf paths of the original document and which inherits the tree structure of the original document. these are what we mean by subtree queries, and while they are similar to XPath filters, they cannot be naturally specified either in XPath or in XQuery. Special-purpose subtree query languages provide a natural idiom for specifying this class of queries, but both composition and evaluation are problematic. In this paper we show that for natural fragments of XPath, the resulting subtree query languages are closed tinder composition. this closure property allows a sequence of subtree queries to be rewritten as a single subtree query, which can then be evaluated either by a subtree-query specific evaluator or via translation to XQuery. We provide a set of composition algorithms for each common XPath fragment and discuss their complexity.
XQuery is known to be a powerful XML query language with many bells and whistles. For many common queries we do not need all the expressive power of XQuery. We investigate the effect of omitting certain features of XQ...
详细信息
ISBN:
(纸本)3540309519
XQuery is known to be a powerful XML query language with many bells and whistles. For many common queries we do not need all the expressive power of XQuery. We investigate the effect of omitting certain features of XQuery on the expressive power of the language. We start from a simple base fragment which can be extended by several optional features being aggregation functions such as count and sum, sequence generation, node construction, position information in for loops, and recursion. In this way we obtain 64 different XQuery fragments which can be divided into 17 different equivalence classes such that two fragments can express the same functions iff they are in the same equivalence class. Moreover, we investigate the relationships between these equivalence classes.
暂无评论