Sciweavers

458 search results - page 54 / 92
» Evaluation of partial path queries on xml data
Sort
View
FAW
2008
Springer
225views Algorithms» more  FAW 2008»
15 years 6 months ago
Versioning Tree Structures by Path-Merging
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
Khaireel A. Mohamed, Tobias Langner, Thomas Ottman...
DEBU
2000
147views more  DEBU 2000»
15 years 4 months ago
Adaptive Query Processing for Internet Applications
As the area of data management for the Internet has gained in popularity, recent work has focused on effectively dealing with unpredictable, dynamic data volumes and transfer rate...
Zachary G. Ives, Alon Y. Levy, Daniel S. Weld, Dan...
PODS
1999
ACM
160views Database» more  PODS 1999»
15 years 8 months ago
Queries with Incomplete Answers over Semistructured Data
Semistructured data occur in situations where information lacks a homogeneous structure and is incomplete. Yet, up to now the incompleteness of information has not been re ected b...
Yaron Kanza, Werner Nutt, Yehoshua Sagiv
ICDE
2003
IEEE
161views Database» more  ICDE 2003»
16 years 5 months ago
Structural Join Order Selection for XML Query Optimization
Structural join operations are central to evaluating queries against XML data, and are typically responsible for consuming a lion's share of the query processing time. Thus, ...
Yuqing Wu, Jignesh M. Patel, H. V. Jagadish
ICDM
2005
IEEE
147views Data Mining» more  ICDM 2005»
15 years 10 months ago
Partial Elastic Matching of Time Series
We consider the problem of elastic matching of time series. We propose an algorithm that determines a subsequence of a target time series that best matches a query series. In the ...
Longin Jan Latecki, Vasileios Megalooikonomou, Qia...