Results 41 to 50 of about 16,602 (259)
Bottom-up automata on data trees and vertical XPath [PDF]
Logical Methods in Computer Science, 2017 A data tree is a finite tree whose every node carries a label from a finite alphabet and a datum from some infinite domain. We introduce a new model of automata over unranked data trees with a decidable emptiness problem.
Diego Figueira, Luc Segoufin
doaj +1 more source
XPath whole query optimization [PDF]
Proceedings of the VLDB Endowment, 2010 Previous work reports about SXSI, a fast XPath engine which executes tree automata over compressed XML indexes. Here, reasons are investigated why SXSI is so fast. It is shown that tree automata can be used as a general framework for fine grained XML query optimization.
Maneth, Sebastian, Nguyen, Kim
openaire +2 more sources
Wireless Communications and Mobile Computing, Volume 2022, Issue 1, 2022., 2022 In order to quickly and accurately collect the massive commodities and corresponding transaction data of large‐scale e‐commerce platforms, and improve the ability of data analysis and mining, this paper proposes a platform commodity information collection system based on splash technology.
Meng Qi, Balakrishnan Nagaraj
wiley +1 more source
Wireless Communications and Mobile Computing, Volume 2022, Issue 1, 2022., 2022 This article first established a university network education system model based on physical failure repair behavior at the big data infrastructure layer and then examined in depth the complex common causes of multiple data failures in the big data environment caused by a single physical machine failure, all based on the principle of mobile edge ...
Min Zhu, Xin Ning
wiley +1 more source
Cooperative XPath caching [PDF]
Proceedings of the 2008 ACM SIGMOD international conference on Management of data, 2008 Motivated by the fact that XML is increasingly being used in distributed applications, we propose building a cooperative caching scheme for XML documents. Our scheme allows sharing cache content among a number of peers. To facilitate sharing, a distributed prefix-based index is built based on the queries whose results are cached. In the loosely-coupled
Kostas Lillis, Evaggelia Pitoura
openaire +1 more source
Deciding definability in FO2(
Logical Methods in Computer Science, 2015 We provide a decidable characterization of regular forest languages definable in FO2(
Thomas Place, Luc Segoufin
doaj +1 more source
Reasoning & Querying – State of the Art [PDF]
, 2008 Various query languages for Web and Semantic Web data, both for practical use and as an area of research in the scientific community, have emerged in recent years.
Bry, François +2 more
core +1 more source
Mobility Integration of ERP systems
Advances in Distributed Computing and Artificial Intelligence Journal, 2015 Nowadays a lot of enterprises work with ERP systems. It usefulness is generally used in office environments and different enterprises which offer this software are developing mobile applications.
Álvaro LOZANO +2 more
doaj +1 more source
Determinization and Minimization of Automata for Nested Words Revisited
Algorithms, 2021 We consider the problem of determinizing and minimizing automata for nested words in practice. For this we compile the nested regular expressions (NREs) from the usual XPath benchmark to nested word automata (NWAs).
Joachim Niehren, Momar Sakho
doaj +1 more source
Staircase Join: Teach a Relational DBMS to Watch its (Axis) Steps [PDF]
, 2003 Relational query processors derive much of their effectiveness from the awareness of specific table properties like sort order, size, or absence of duplicate tuples.
Grust, Torsten +2 more
core +3 more sources