Results 51 to 60 of about 16,602 (259)
An Approach of XML Query Evaluation Based Model Checking
In this paper, we show the process inspired by model checking which integrate temporal logic to the application of semi-structured data query. We investigate the potential ofatechnique based on CTL (Computation Tree Logic) model checking for evaluating ...
Yan-Mei Li, Shao-Bin Huang, Ya Li, Li Xu
doaj +1 more source
Decidable XPath Fragments in the Real World
XPath is arguably the most popular query language for selecting elements in XML documents. Besides query evaluation, query satisfiability and containment are the main computational problems for XPath; they are useful, for instance, to detect dead code or
David Baelde, Anthony Lick, S. Schmitz
semanticscholar +1 more source
SMIL State: an architecture and implementation for adaptive time-based web applications [PDF]
In this paper we examine adaptive time-based web applications (or presentations). These are interactive presentations where time dictates which parts of the application are presented (providing the major structuring paradigm), and that require ...
D Bulterman +3 more
core +2 more sources
Semantic Query on Materials Data Based on Mapping MatML to an OWL Ontology
MatML plays an important role in materials data applications while structure-aware query techniques (e.g., XPath and XQuery) are used to search the content of MatML. However, both XPath and XQuery cannot efficiently retrieve sets of MatML on a conceptual
Xiaoming Zhang, Changjun Hu, Huayu Li
doaj +1 more source
Survey over Existing Query and Transformation Languages [PDF]
A widely acknowledged obstacle for realizing the vision of the Semantic Web is the inability of many current Semantic Web approaches to cope with data available in such diverging representation formalisms as XML, RDF, or Topic Maps.
Bolzer, Oliver +6 more
core +2 more sources
Path Queries on Compressed XML [PDF]
Central to any XML query language is a path language such as XPath which operates on the tree structure of the XML document. We demonstrate in this paper that the tree structure can be e#ectively compressed and manipulated using techniques derived ...
Abiteboul +19 more
core +2 more sources
We propose reformulation of discovery of data structure within a web page as relations between sets of document nodes. We start by reformulating web page analysis as finding expressions in extension of XPath. Then we propose to automatically discover these XPath expressions with InferXPath meta-language.
Gajda, Michał J. +3 more
openaire +2 more sources
Використання сучасних веб-технологій для побудови тематичного пошукового робота-краулера аналізатора
Дана стаття є описом теорії побудови сучасних інтелектуальних роботів-пошуковців. Головна ідея полягає в використанні, вже дуже відомих в наш час, технологій таких, як NHibernate, XPath, XML та ін.
Олена Іллівна Чумаченко
doaj +1 more source
Automata Approach to XML Data Indexing
The internal structure of XML documents can be viewed as a tree. Trees are among the fundamental and well-studied data structures in computer science. They express a hierarchical structure and are widely used in many applications.
Eliška Šestáková, Jan Janoušek
doaj +1 more source
Alternating register automata on finite words and trees [PDF]
We study alternating register automata on data words and data trees in relation to logics. A data word (resp. data tree) is a word (resp. tree) whose every position carries a label from a finite alphabet and a data value from an infinite domain.
Diego Figueira
doaj +1 more source

