BNCOD
2009
13 years 5 months ago
2009
We study the expressiveness of a positive fragment of path queries, denoted Path+ , on node-labeled trees documents. The expressiveness of Path+ is studied from two angles. First, ...
EDBTW
2006
Springer
13 years 8 months ago
2006
Springer
Regular path queries are the basic navigational component of virtually all the mechanisms for querying semistructured data commonly found in information integration applications, W...
ADC
2008
Springer
13 years 11 months ago
2008
Springer
This article describes how to implement efficient memory resident path indexes for semi-structured data. Two techniques are introduced, and they are shown to be significantly fas...
CIKM
2009
Springer
13 years 11 months ago
2009
Springer
Well-designed indices can dramatically improve query performance. Including query workload information can produce indices that yield better overall throughput while balancing the...
WWW
2007
ACM
14 years 5 months ago
2007
ACM
Many applications in analytical domains often have the need to "connect the dots" i.e., query about the structure of data. In bioinformatics for example, it is typical t...
ICDE
2005
IEEE
14 years 5 months ago
2005
IEEE
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...