Sciweavers

591 search results - page 24 / 119
» The complexity of XPath query evaluation
Sort
View
DEBS
2008
ACM
13 years 10 months ago
On static determination of temporal relevance for incremental evaluation of complex event queries
Evaluation of complex event queries over time involves storing information about those events that are relevant for, i.e., might contribute to, future answers. We call the period ...
François Bry, Michael Eckert
WISE
2006
Springer
14 years 2 months ago
SCEND: An Efficient Semantic Cache to Adequately Explore Answerability of Views
Maintaining a semantic cache of materialized XPath views inside or outside the database, is a novel, feasible and efficient approach to accelerate XML query processing. However, th...
Guoliang Li, Jianhua Feng, Na Ta, Yong Zhang, Lizh...
ICDT
2007
ACM
97views Database» more  ICDT 2007»
14 years 3 months ago
Combining Temporal Logics for Querying XML Documents
Close relationships between XML navigation and temporal logics have been discovered recently, in particular between logics LTL and CTL⋆ and XPath navigation, and between the µ-c...
Marcelo Arenas, Pablo Barceló, Leonid Libki...
DEBS
2010
ACM
13 years 3 months ago
Distributed structural and value XML filtering
Many XML filtering systems have emerged in recent years identifying XML data that structurally match XPath queries in an efficient way. However, apart from structural matching, it...
Iris Miliaraki, Manolis Koubarakis
LICS
2005
IEEE
14 years 2 months ago
Looping Caterpillars
There are two main paradigms for querying semi structured data: regular path queries and XPath. The aim of this paper is to provide a synthesis between these two. This synthesis i...
Evan Goris, Maarten Marx