Sciweavers

76 search results - page 5 / 16
» Approximate Structural Matching over Ordered XML Documents
Sort
View
ICDE
2010
IEEE
371views Database» more  ICDE 2010»
14 years 7 months ago
TASM: Top-k Approximate Subtree Matching
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...
Nikolaus Augsten, Denilson Barbosa, Michael H. B&o...
ECIR
2003
Springer
13 years 9 months ago
Aggregated Feature Retrieval for MPEG-7
In this paper we present an initial study on the use of both high and low level MPEG-7 descriptions for video retrieval. A brief survey of current XML indexing techniques shows tha...
Jiamin Ye, Alan F. Smeaton
SIGMOD
2002
ACM
127views Database» more  SIGMOD 2002»
14 years 7 months ago
Approximate XML joins
XML is widely recognized as the data interchange standard for tomorrow, because of its ability to represent data from a wide variety of sources. Hence, XML is likely to be the for...
Sudipto Guha, H. V. Jagadish, Nick Koudas, Divesh ...
RIDE
2002
IEEE
14 years 14 days ago
Enhancive Index for Structured Document
Structured documents, especially the XML documents, are made up of a few logical components, such as title, sections, subsections and paragraphs. The components in each structured...
Xiaoling Wang, Ji-Rong Wen, Yisheng Dong, Wenyin L...
HIPEAC
2010
Springer
13 years 11 months ago
Accelerating XML Query Matching through Custom Stack Generation on FPGAs
Abstract. Publish-subscribe systems present the state of the art in information dissemination to multiple users. Such systems have evolved from simple topic-based to the current XM...
Roger Moussalli, Mariam Salloum, Walid A. Najjar, ...