Advertisement

Optimization of Restricted Searches in Web Directories Using Hybrid Data Structures

  • Fidel Cacheda
  • Victor Carneiro
  • Carmen Guerrero
  • Angel Viña
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2633)

Abstract

The need of efficient tools in order to manage, retrieve and filter the information in the WWW is clear. Web directories are taxonomies for the classification of Web documents. These kind of information retrieval systems present a specific type of search where the document collection is restricted to one area of the category graph. This paper introduces a specific data architecture for Web directories that improves the performance of restricted searches. That architecture is based on a hybrid data structure composed of an inverted file with multiple embedded signature files. Two variants are presented: hybrid architecture with total information and with partial information. This architecture has been analyzed by means of developing both variants to be compared with a basic model. The performance of the restricted queries was clearly improved, especially the hybrid model with partial information, which yielded a positive response under any load of the search system.1

Keywords

Hybrid Model Directed Acyclic Graph Partial Information Information Retrieval System Total Information 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. Agosti, M. Melucci. “Information Retrieval on the Web”, in: M. Agosti, F. Crestani, G. Pasi (Eds). Lectures on Information Retrieval: Third European Summer-School, ESSIR 2000. Revised Lectures, Springer-Verlag, Berlin Heidelberg, 2001, 242–285.CrossRefGoogle Scholar
  2. 2.
    R. Baeza-Yates, B. Ribeiro-Neto, “Searching the Web”. In R. Baeza-Yates, B. Ribeiro-Neto, “Modern Information Retrieval”. chapter 13, pps: 367–395. Addison Wesley.Google Scholar
  3. 3.
    S. Brin, L. Page, “The anatomy of a large-scale hypertextual web search engine”. The 7th International World Wide Web Conference, Abril 1998.Google Scholar
  4. 4.
    F. Cacheda, A. Viña, “Experiencies retrieving information in the World Wide Web”. 6th IEEE Symposium on Computers and Communications, pp 72–79, 2001.Google Scholar
  5. 5.
    F. Cacheda, A. Viña, “Superimposing Codes Representing Hierarchical Information in Web directories”. 3rd International Workshop on Web Information and Data management (WIDM’01), in ACM CIKM 2001.Google Scholar
  6. 6.
    D. Cutting, J. Pedersen, “Optimizations for dynamic inverted index maintenance”. 13th International Conference on Research and Development in Information Retrieval, 1990.Google Scholar
  7. 7.
    C. Faloutsos, S. Christodoulakis, “Description and performance analysis of signature file methods”. ACM TOOIS, 5(3), 237–257.Google Scholar
  8. 8.
    G. Gonnet, “Unstructured data bases or very efficient text searching”. ACM PODS, volumen 2, 117–124, Atlanta, USA.Google Scholar
  9. 9.
    D. K. Harman, E. Fox, R. Baeza-Yates, W. Lee, “Inverted files”. In W. Frakes y R. Baeza-Yates, “Information Retrieval: Data structures and algorithms, chapter 3, pps: 28–43. Prentice-Hall, 1992.Google Scholar
  10. 10.
    G. Jacobson, B. Krishnamurthy, D. Srivastava, D. Suciu, “Focusing Search in Hierarchical Structures with Directory Sets”. Seventh International Conference on Information and Knowledge Management (CIKM), 1998.Google Scholar
  11. 11.
    Y. Labrou, T. Finin, “Yahoo! as an ontology — Using Yahoo! categories to describe documents”. Eighth International Conference on Information Knowledge Management, pp. 180–187, 1999.Google Scholar
  12. 12.
    W. Lam, M. Ruiz, P. Srinivasan, “Automatic Text Categorization and Its Application to Text Retrieval”. IEEE Transactions on Knowledge and Data Engineering, Volume 116, pp. 865–879, 1999.CrossRefGoogle Scholar
  13. 13.
    C. Mooers, “Application of Random Codes to the Gathering of Statistical Information”. Bulletin 31, Zator Co., Cambridge, USA.Google Scholar
  14. 14.
    G. Navarro, “Indexing and Searching”. In R. Baeza-Yates, B. Ribeiro-Neto, “Modern Information Retrieval”, chapter 8, pp 191–228. Addison Wesley.Google Scholar
  15. 15.
    C. S. Roberts, “Partial-match retrieval via the method of superimposed codes”. Proceedings of the IEEE, 67:12, 1624–1642.Google Scholar
  16. 16.
    S. Stiassny, “Mathematical analysis of various superimposed coding methods”. American Documentation, 11(2), 155–169.Google Scholar
  17. 17.
    J. Zobel, A. Moffat, K. Ramamohanarao, “Guidelines for Presentation and Comparison of Indexing Techniques”. SIGMOD Record, 25(3):10–15, October 1996.CrossRefGoogle Scholar
  18. 18.
    J. Zobel, A. Moffat, K. Ramamohanarao, “Inverted files versus signature files for text indexing”. Transactions on Database Systems, 23(4), December 1998, pp. 453–490.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Fidel Cacheda
    • 1
  • Victor Carneiro
    • 1
  • Carmen Guerrero
    • 1
  • Angel Viña
    • 1
  1. 1.Department of Information and Communications TechnologiesFacultad de InformáticaA CoruñaSpain

Personalised recommendations