2099 search results - page 347 / 420 » Similarity for Conceptual Querying |
102
click to vote
KDD
2007
ACM
16 years 1 months ago
2007
ACM
We present a document routing and index partitioning scheme for scalable similarity-based search of documents in a large corpus. We consider the case when similarity-based search ...
121
click to vote
SIGMOD
2004
ACM
16 years 1 months ago
2004
ACM
Increasing popularity of XML in recent years has generated much interest in query processing over graph-structured data. To support efficient evaluation of path expressions, many ...
ICDE
2010
IEEE
16 years 1 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...
121
click to vote
ICDE
2010
IEEE
15 years 8 months ago
2010
IEEE
Data anonymization techniques have been the subject of intense investigation in recent years, for many kinds of structured data, including tabular, item set and graph data. They e...
119
click to vote
EDBT
2009
ACM
15 years 8 months ago
2009
ACM
Materialized views (MV) can significantly improve the query performance of relational databases. In this paper, we consider MVs to optimize complex scenarios where many heterogen...