792 search results - page 98 / 159 » Computing Iceberg Queries Efficiently |
133
Voted
ASUNAM
2010
IEEE
15 years 4 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
103
Voted
IPPS
1998
IEEE
15 years 7 months ago
1998
IEEE
Multi-dimensional index structures such as R-trees enable fast searching in high-dimensional spaces. They differ from uni-dimensional structures in the following aspects: (1) inde...
115
click to vote
ACSC
2004
IEEE
15 years 6 months ago
2004
IEEE
Indexes are the key technology underpinning efficient text search. A range of algorithms have been developed for fast query evaluation and for index creation, but update algorithm...
213
Voted
SIGMOD
2009
ACM
16 years 3 months ago
2009
ACM
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
141
Voted
DAGM
2010
Springer
15 years 3 months ago
2010
Springer
Content-based image retrieval requires a natural image (e.g, a photo) as query, but the absence of such a query image is usually the reason for a search. An easy way to express the...