Abstract
As data volume and query processing loads increase, companies that provide information retrieval services are turning to high performance parallel computing, storage and searching. In this paper we present a new paradigm of semantic parallelism dedicated to documentary databases. Based on existing parallel database techniques, our approach uses particular features of documentary databases to retrieve semantically relevant information in a more rapid and efficient way. Thus it can greatly alleviate both information overload and vocabulary problem of information retrieval. Extensive simulation results confirm the efficiency of our approach.
Work supported in part by Region Rhone-Alpes, France
References
N.Biscondi, A.Flory, L.Brunie, H.Kosch: Encapsulation of Intra-Operator Parallelism in a Parallel Match Operator. Int. Conf. ACPC'96, Springer LNCS1127 (1996)
N.Biscondi: A New Parallel Computing Approach to Documentary Databases. Research Report RR98-1, INSA de Lyon, France (1998)
N.DeClaris, D.Harman, C.Faloutsos, S.Dumais, D.Oard: Information Filtering and Retrieval: Overview, Issues and Directions. Int. Conf. of the IEEE Engineering in Medicine and Biology Society, Baltimore, USA (1994)
W.Hasan, D.Florescu, P.Valduriez: Open Issues in Parallel Query Optimization. SIGMOD Record N3, vol.25 (1996)
A. Tomasic, H.Garcia-Molina: Performance of Inverted Indices in Shared-Nothing Distributed Text Document Information Retrieval System. Int. Conf. PDIS'93
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biscondi, N. (1998). Semantic parallelism for documentary database systems. In: Sloot, P., Bubak, M., Hertzberger, B. (eds) High-Performance Computing and Networking. HPCN-Europe 1998. Lecture Notes in Computer Science, vol 1401. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037256
Download citation
DOI: https://doi.org/10.1007/BFb0037256
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64443-9
Online ISBN: 978-3-540-69783-1
eBook Packages: Springer Book Archive