| A metric cache for similarity search |
| Full text |
Pdf
(433 KB)
|
Source
|
Conference on Information and Knowledge Management
archive
Proceeding of the 2008 ACM workshop on Large-Scale distributed systems for information retrieval
table of contents
Napa Valley, California, USA
SESSION: Similarity search and resource selection
table of contents
Pages 43-50
Year of Publication: 2008
ISBN:978-1-60558-254-2
|
|
Authors
|
|
Fabrizio Falchi
|
ISTI-CNR, Pisa, Italy
|
|
Claudio Lucchese
|
ISTI-CNR, Pisa, Italy
|
|
Salvatore Orlando
|
Università Ca' Foscari, Venezia, Italy
|
|
Raffaele Perego
|
ISTI-CNR, Pisa, Italy
|
|
Fausto Rabitti
|
ISTI-CNR, Pisa, Italy
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 7, Downloads (12 Months): 106, Citation Count: 3
|
|
|
ABSTRACT
Similarity search in metric spaces is a general paradigm that can be used in several application fields. It can also be effectively exploited in content-based image retrieval systems, which are shifting their target towards the Web-scale dimension. In this context, an important issue becomes the design of scalable solutions, which combine parallel and distributed architectures with caching at several levels. To this end, we investigate the design of a similarity cache that works in metric spaces. It is able to answer with exact and approximate results: even when an exact match is not present in cache, our cache may return an approximate result set with quality guarantees. By conducting tests on a collection of one million high-quality digital photos, we show that the proposed caching techniques can have a significant impact on performance, like caching on text queries has been proved effective for traditional Web search engines.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
|
 |
2
|
|
 |
3
|
|
 |
4
|
Ritendra Datta , Dhiraj Joshi , Jia Li , James Z. Wang, Image retrieval: Ideas, influences, and trends of the new age, ACM Computing Surveys (CSUR), v.40 n.2, p.1-60, April 2008
[doi> 10.1145/1348246.1348248]
|
 |
5
|
|
| |
6
|
|
| |
7
|
ISO/IEC. Information technology - Multimedia content description interfaces. Part 6: Reference Software, 2003. 15938--6:2003.
|
 |
8
|
|
| |
9
|
P. Lyman and H. R. Varian. How much information, 2003. http://www.sims.berkeley.edu/how-much-info-2003.
|
| |
10
|
E. P. Markatos. On Caching Search Engine Query Results. Computer Communications, 24(2):137--143, 2001.
|
 |
11
|
|
| |
12
|
|
| |
13
|
|
 |
14
|
|
| |
15
|
|
| |
16
|
Y. Xie and D. O'Hallaron. Locality in search engine queries and its implications for caching. In Proceedings of 21st IEEE INFOCOM, 2002.
|
| |
17
|
|
CITED BY 3
|
|
Fabrizio Falchi , Claudio Lucchese , Salvatore Orlando , Raffaele Perego , Fausto Rabitti, Caching content-based queries for robust and efficient image retrieval, Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, March 24-26, 2009, Saint Petersburg, Russia
|
|
|
Sandeep Pandey , Andrei Broder , Flavio Chierichetti , Vanja Josifovski , Ravi Kumar , Sergei Vassilvitskii, Nearest-neighbor caching for content-match applications, Proceedings of the 18th international conference on World wide web, April 20-24, 2009, Madrid, Spain
|
|
|
|
|