3020 search results - page 101 / 604 » Similarity Queries on Structured Data in Structured Overlays |
171
click to vote
DAWAK
1999
Springer
15 years 10 months ago
1999
Springer
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
191
click to vote
JIIS
2000
15 years 6 months ago
2000
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...
147
click to vote
JCDCG
2004
Springer
15 years 11 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
144
click to vote
CHI
2011
ACM
14 years 10 months ago
2011
ACM
A key feature of relational database applications is managing plural relationships—one-to-many and many-to-many— between entities. However, since it is often infeasible to ado...
147
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
Structural summaries are data structures that preserve all structural features of XML documents in a compact form. We investigate the applicability of the most popular summaries a...