Artículos de revistas
Paged similarity queries
Fecha
2011Registro en:
INFORMATION SCIENCES, v.181, n.13, Special Issue, p.2600-2607, 2011
0020-0255
10.1016/j.ins.2010.09.003
Autor
SERAPHIM, Enzo
SERAPHIM, Thatyana F. Piola
MOREIRA, Edmilson M.
RICOTTA, Fabio C. M.
TRAINA JR., Caetano
Institución
Resumen
An important feature of a database management systems (DBMS) is its client/server architecture, where managing shared memory among the clients and the server is always an tough issue. However, similarity queries are specially sensitive to this kind of architecture, since the answer sizes vary widely. Usually, the answers of similarity query are fully processed to be sent in full to the user, who often is interested in just parts of the answer, e.g. just few elements closer or farther to the query reference. Compelling the DBMS to retrieve the full answer, further ignoring its majority is at least a waste of server processing power. Paging the answer is a technique that splits the answer onto several pages, following client requests. Despite the success of paging on traditional queries, little work has been done to support it in similarity queries. In this work, we present a technique that not only provides paging in similarity range or k-nearest neighbor queries, but also supports them in two variations: the forward similarity query and the backward similarity query. They return elements either increasingly farther of increasingly closer to the query reference. The reported experiments show that, depending on the proportion of the interesting part over the full answer, both techniques allow answering queries much faster than it is obtained in the non-paged way. (C) 2010 Elsevier Inc. All rights reserved.