382 search results - page 54 / 77 » Data Structures for Dynamic Queries: An Analytical and Exper... |
JIIS
2002
13 years 7 months ago
2002
Adaptable similarity queries based on quadratic form distance functions are widely popular in data mining application domains including multimedia, CAD, molecular biology or medica...
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...
ICDE
2009
IEEE
14 years 2 months ago
2009
IEEE
— Existing stream processing systems are optimized for a specific metric, which may limit their applicability to diverse applications and environments. This paper presents XFlow...
ESANN
2001
13 years 9 months ago
2001
Over the years the amount and range of electronic text stored on the WWW has expanded rapidly, overwhelming both users and tools designed to index and search the information. It is...
DL
2000
Springer
13 years 12 months ago
2000
Springer
Text documents often contain valuable structured data that is hidden in regular English sentences. This data is best exploited if available as a relational table that we could use...