Sciweavers

479 search results - page 43 / 96
» Efficient Processing of XML Tree Pattern Queries
Sort
View
ER
2008
Springer
123views Database» more  ER 2008»
13 years 11 months ago
Modeling and Querying E-Commerce Data in Hybrid Relational-XML DBMSs
Abstract. Data in many industrial application systems are often neither completely structured nor unstructured. Consequently semi-structured data models such as XML have become pop...
Lipyeow Lim, Haixun Wang, Min Wang
DEXA
2006
Springer
136views Database» more  DEXA 2006»
14 years 25 days ago
Faster Twig Pattern Matching Using Extended Dewey ID
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Recently, Lu et al. [7] proposed the TJFast algorithm ...
Chung Keung Poon, Leo Yuen
FUIN
2006
139views more  FUIN 2006»
13 years 9 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
XMLSEC
2003
ACM
14 years 2 months ago
Access control of XML documents considering update operations
As a large quantity of information is presented in XML format on the Web, there are increasing demands for XML security. Until now, research on XML security has been focused on th...
Chung-Hwan Lim, Seog Park, Sang Hyuk Son
CORR
2012
Springer
222views Education» more  CORR 2012»
12 years 4 months ago
A limit process for partial match queries in random quadtrees
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the classical model where the d...
Nicolas Broutin, Ralph Neininger, Henning Sulzbach