1179 search results - page 211 / 236 » Querying XML in Timber |
WINET
2002
13 years 8 months ago
2002
Abstract. The widespread deployment of inexpensive communications technology, computational resources in the networking infrastructure, and network-enabled end devices poses an int...
ICDE
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
WWW
2007
ACM
14 years 9 months ago
2007
ACM
Extractors and taggers turn unstructured text into entityrelation (ER) graphs where nodes are entities (email, paper, person, conference, company) and edges are relations (wrote, ...
EDBT
2010
ACM
14 years 3 months ago
2010
ACM
Schemas, and more generally metadata specifying structural and semantic constraints, are invaluable in data management. They facilitate conceptual design and enable checking of da...
DASFAA
2005
IEEE
14 years 2 months ago
2005
IEEE
The fundamental drawback of unstructured peer-to-peer (P2P) networks is the flooding-based query processing protocol that seriously limits their scalability. As a result, a signiï...