Sciweavers

1429 search results - page 18 / 286
» Efficient processing of XPath queries using indexes
Sort
View
JIDM
2010
155views more  JIDM 2010»
13 years 6 months ago
DeweyIDs - The Key to Fine-Grained Management of XML Documents
Because XML documents tend to be very large and are more and more collaboratively processed, their fine-grained storage and management is a must for which, in turn, a flexible tree...
Michael Peter Haustein, Theo Härder, Christia...
CIKM
1994
Springer
13 years 11 months ago
Using Path Information for Query Processing in Object-Oriented Database Systems
This paper argues that most queries in object-oriented databases require traversing from one object to another in the aggregation hierarchy. Thus, the connections between objects ...
Dik Lun Lee, Wang-Chien Lee
WWW
2007
ACM
14 years 8 months ago
Exploit sequencing views in semantic cache to accelerate xpath query evaluation
In XML databases, materializing queries and their results into views in a semantic cache can improve the performance of query evaluation by reducing computational complexity and I...
Jianhua Feng, Na Ta, Yong Zhang, Guoliang Li
DASFAA
2007
IEEE
148views Database» more  DASFAA 2007»
13 years 11 months ago
An Efficient Encoding and Labeling for Dynamic XML Data
In order to efficiently determine structural relationships among XML elements and to avoid re-labeling for updates, much research about labeling schemes has been conducted, recentl...
Jun-Ki Min, Jihyun Lee, Chin-Wan Chung
RP
2010
Springer
163views Control Systems» more  RP 2010»
13 years 5 months ago
Efficient Graph Reachability Query Answering Using Tree Decomposition
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
Fang Wei