210 search results - page 26 / 42 » On Efficient Part-match Querying of XML Data |
ICDE
2001
IEEE
14 years 10 months ago
2001
IEEE
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
DASFAA
2010
IEEE
13 years 6 months ago
2010
IEEE
Keyword search is widely recognized as a convenient way to retrieve information from XML data. In order to precisely meet users' search concerns, we study how to effectively r...
DATESO
2009
13 years 6 months ago
2009
In recent years, many approaches to XML twig pattern query (TPQ) processing have been developed. Some algorithms are supported by a stream abstract data type. s an abstract data ty...
ICDE
2002
IEEE
14 years 10 months ago
2002
IEEE
XML and other semi-structured data may have partially specified or missing schema information, motivating the use of a structural summary which can be automatically computed from ...
APWEB
2007
Springer
14 years 25 days ago
2007
Springer
Abstract. XML provides a natural mechanism for representing semistructured and unstructured data. It becomes the basis for encoding a large variety of information, for example, the...