Two-dimensional distributed inverted files

Term-partitioned indexes are generally inefficient for the evaluation of conjunctive queries, as they require the communication of long posting lists. On the other side, document-partitioned indexes incur in excessive overheads as the evaluation of every query involves the participation of all the p...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor principal: Feuerstein, E.
Otros Autores: Marin, M., Mizrahi, M., Gil-Costa, V., Baeza-Yates, R.
Formato: Acta de conferencia Capítulo de libro
Lenguaje:Inglés
Publicado: 2009
Acceso en línea:Registro en Scopus
DOI
Handle
Registro en la Biblioteca Digital
Aporte de:Registro referencial: Solicitar el recurso aquí
LEADER 05775caa a22005897a 4500
001 PAPER-8348
003 AR-BaUEN
005 20230518203809.0
008 190411s2009 xx ||||fo|||| 00| 0 eng|d
024 7 |2 scopus  |a 2-s2.0-70350625173 
040 |a Scopus  |b spa  |c AR-BaUEN  |d AR-BaUEN 
100 1 |a Feuerstein, E. 
245 1 0 |a Two-dimensional distributed inverted files 
260 |c 2009 
270 1 0 |m Feuerstein, E.; Departamento de Computación, FCEyN, Universidad de Buenos AiresArgentina 
506 |2 openaire  |e Política editorial 
504 |a Badue, C., Baeza-Yates, R., Ribeiro, B., Ziviani, N., Distributed query processing using partitioned inverted files, , SPIRE 2001 
504 |a Baeza-Yates, R, Ribeiro-Neto, B, Modern Information Retrieval; Costa, G.V., Marin, M., Reyes, N., Parallel query processing on distributed clustering indexes (2009) Journal of Discrete Algorithms, 7, pp. 03-17 
504 |a Jeong, B.S., Omiecinski, E., Inverted file partitioning schemes in multiple disk systems (1995) IEEE Trans. Parallel and Distributed Systems, 16 (2), pp. 142-153 
504 |a Lucchese, C., Orlando, S., Perego, R., Silvestri, F.: Mining query logs to optimize index partitioning in parallel web search engines. In: INFOSCALE (2007); MacFarlane, A.A., McCann, J.A., Robertson, S.E., Parallel search using partitioned inverted files, , SPIRE 2000 
504 |a Marin, M., Costa, G.V., High-performance distributed inverted files (2007) CIKM 2007 
504 |a Marin, M., Gomez-Pantoja, C., Gonzalez, S., Gil-Costa, V.: Scheduling Intersection Queries in Term Partitioned Inverted Files. In: Luque, E., Margalef, T., Benítez, D. (eds.) Euro-Par 2008. LNCS, 5168, pp. 434-443. Springer, Heidelberg (2008); Moffat, A., Webber, W., Zobel, J., Baeza-Yates, R., A pipelined architecture for distributed text query evaluation (2007) Information Retrieval, 10 (3), pp. 205-231 
504 |a Ribeiro-Neto, B.A., Barbosa, R.A., Query performance for tightly coupled distributed digital libraries (1998) ACM Conf. Digital Libraries, pp. 182-190 
504 |a Stanfill, C.: Partitioned posting files: a parallel inverted file structure for information retrieval. In: SIGIR (1990); Suel, T., Mathur, C., Wu, J.W., Zhang, J., Delis, A., Kharrazi, M., Long, X., Shanmugasundaram, K., ODISSEA: A peer-to-peer architecture for scalable web search and information retrieval (2003) WWW 
504 |a Tang, C., Dwarkadas, S.: Hybrid global-local indexing for efficient peer-to-peer information retrieval. In: NSDI (2004); Tomasic, A., García-Molina, H., Performance issues in distributed shared-nothing information-retrieval systems (1996) Information Processing & Management, 32 (6), pp. 647-665 
504 |a Xi, W., Sornil, O., Luo, M., Fox, E.A.: Hybrid partition inverted files: Experimental validation. In: Agosti, M., Thanos, C. (eds.) ECDL 2002, 2458, p. 422. Springer, Heidelberg (2002); Zhang, J., Suel, T.: Optimized inverted list assignment in distributed search engine architectures. In: IEEE IPDPS 2007(2007); Zhong, M., Shen, K., Seiferas, J.I., Correlation-aware object placement for multiobject operations (2008) ICDCS 2008, pp. 512-521 
504 |a Zobel, J., Moffat, A., Inverted files for text search engines (2006) ACM Computing Surveys, 38 (2) 
520 3 |a Term-partitioned indexes are generally inefficient for the evaluation of conjunctive queries, as they require the communication of long posting lists. On the other side, document-partitioned indexes incur in excessive overheads as the evaluation of every query involves the participation of all the processors, therefore their scalability is not adequate for real systems. We propose to arrange a set of processors in a two-dimensional array, applying term-partitioning at row level and document-partitioning at column level. Choosing the adequate number of rows and columns given the available number of processors, together with the selection of the proper ways of partitioning the index over that topology is the subject of this paper. © 2009 Springer.  |l eng 
593 |a Departamento de Computación, FCEyN, Universidad de Buenos Aires, Argentina 
593 |a Yahoo Research Latin America, Santiago, Chile 
690 1 0 |a CONJUNCTIVE QUERIES 
690 1 0 |a INVERTED FILES 
690 1 0 |a REAL SYSTEMS 
690 1 0 |a TWO-DIMENSIONAL ARRAYS 
690 1 0 |a INFORMATION RETRIEVAL 
690 1 0 |a INFORMATION SERVICES 
690 1 0 |a TWO DIMENSIONAL 
690 1 0 |a TOWERS 
700 1 |a Marin, M. 
700 1 |a Mizrahi, M. 
700 1 |a Gil-Costa, V. 
700 1 |a Baeza-Yates, R. 
711 2 |c Saariselka  |d 25 August 2009 through 27 August 2009  |g Código de la conferencia: 77796 
773 0 |d 2009  |g v. 5721 LNCS  |h pp. 206-213  |p Lect. Notes Comput. Sci.  |n Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)  |x 03029743  |w (AR-BaUEN)CENRE-983  |z 3642037836  |z 9783642037832  |t 16th International Symposium on String Processing and Information Retrieval, SPIRE 2009 
856 4 1 |u https://www.scopus.com/inward/record.uri?eid=2-s2.0-70350625173&doi=10.1007%2f978-3-642-03784-9_20&partnerID=40&md5=05186d6ded60d07e1f912881fbc35b88  |y Registro en Scopus 
856 4 0 |u https://doi.org/10.1007/978-3-642-03784-9_20  |y DOI 
856 4 0 |u https://hdl.handle.net/20.500.12110/paper_03029743_v5721LNCS_n_p206_Feuerstein  |y Handle 
856 4 0 |u https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v5721LNCS_n_p206_Feuerstein  |y Registro en la Biblioteca Digital 
961 |a paper_03029743_v5721LNCS_n_p206_Feuerstein  |b paper  |c PE 
962 |a info:eu-repo/semantics/article  |a info:ar-repo/semantics/artículo  |b info:eu-repo/semantics/publishedVersion 
963 |a VARI 
999 |c 69301