166 search results - page 23 / 34 » Matching Large XML Schemas |
ERCIMDL
2006
Springer
13 years 11 months ago
2006
Springer
Libraries, museums, and other organizations make their electronic contents available to a growing number of users on the Web. A large fraction of the information published is store...
ICDE
2005
IEEE
14 years 9 months ago
2005
IEEE
Order-based element labeling for tree-structured XML data is an important technique in XML processing. It lies at the core of many fundamental XML operations such as containment j...
IANDC
2011
13 years 2 months ago
2011
Query answering algorithms on Xml streams check answer candidates on the fly in order to avoid the unnecessary buffering whenever possible. The delay and concurrency of a query ...
ICDE
2010
IEEE
14 years 7 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...
ESWS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Ontology matching has become an important field of research over the last years. Although many different approaches have been proposed, only few of them are committed t...