Sciweavers

1429 search results - page 22 / 286
» Efficient processing of XPath queries using indexes
Sort
View
DPD
2006
141views more  DPD 2006»
13 years 7 months ago
Efficient parallel processing of range queries through replicated declustering
A common technique used to minimize I/O in data intensive applications is data declustering over parallel servers. This technique involves distributing data among several disks so...
Hakan Ferhatosmanoglu, Ali Saman Tosun, Guadalupe ...
BXML
2003
13 years 9 months ago
Querying transformed XML documents: Determining a sufficient fragment of the original document
Large XML documents which are stored in an XML database can be transformed further by an XSL processor using an XSLT stylesheet. In order to answer an XPath query based on the tran...
Sven Groppe, Stefan Böttcher
SIGMOD
2008
ACM
188views Database» more  SIGMOD 2008»
14 years 7 months ago
Just-in-time query retrieval over partially indexed data on structured P2P overlays
Structured peer-to-peer (P2P) overlays have been successfully employed in many applications to locate content. However, they have been less effective in handling massive amounts o...
Sai Wu, Jianzhong Li, Beng Chin Ooi, Kian-Lee Tan
CIKM
2005
Springer
14 years 1 months ago
Incremental evaluation of a monotone XPath fragment
This paper shows a scheme for incremental evaluation of XPath queries. Here, we focus on a monotone fragment of XPath, i.e., when a data is deleted from (or inserted to) the datab...
Hidetaka Matsumura, Keishi Tajima
ICDE
2008
IEEE
137views Database» more  ICDE 2008»
14 years 8 months ago
Multiple Materialized View Selection for XPath Query Rewriting
We study the problem of answering XPATH queries using multiple materialized views. Despite the efforts on answering queries using single materialized view, answering queries using ...
Byron Choi, Jeffrey Xu Yu, Kam-Fai Wong, M. Tamer ...