An XPath characterization of locally complete XML databases

Author

Cortés-Calabuig, Álvaro

Author_Institution

Math. & Comput. Sci. Dept., Univ. of Antwerp, Antwerp, Belgium

fYear

2011

fDate

11-16 April 2011

Firstpage

188

Lastpage

193

Abstract

In this paper, we report ongoing research on what we call locally complete XML databases. These data banks consist of an XML data tree together with a specification of the nodes of the tree that are completely represented in the document. The specification of completeness is defined by means of the defacto standard node selection language for XML, XPath, which makes this approach easy to implement in existing XML/XPath environments. The semantics of locally complete XML databases is given in terms of a set of possible trees. Query answering is defined for certain and possible answers, and its computational complexity is explored.

Keywords

XML; database management systems; question answering (information retrieval); tree data structures; XML data tree; XML-XPath environments; XPath characterization; completeness specification; computational complexity; data banks; locally complete XML databases; node selection language; query answering; Cognition; Context; Databases; Libraries; Semantics; Vocabulary; XML;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Engineering Workshops (ICDEW), 2011 IEEE 27th International Conference on

Conference_Location

Hannover

Print_ISBN

978-1-4244-9195-7

Electronic_ISBN

978-1-4244-9194-0

Type

conf

DOI

10.1109/ICDEW.2011.5767658

Filename

5767658