From Subject Directories to Subject Meta-directories via Declarative Programming

  • Antonio Brogi
  • Gianluca Caruso
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1990)


Subject directories and search engines are the most commonly used tools to search for information on the World Wide Web. We propose a novel notion of subject meta-directory on top of standard subject directories, which strongly resembles the way in which metasearch engines extend standard search engines. After analyzing the main choices arising in the design of subject meta-directories, we describe the implementation of WebGate, a subject meta-directory entirely written in Prolog.


Prolog Web-programming subject directories 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [2]
    G. Attardi, A. Gullì, and F. Sebastiani. Theseus: categorization by context. In Poster Proceedings of WWW’99, pages 136–137, Toronto, 1999.Google Scholar
  2. [3]
    D. Axmark, M. Widenius, and P. DuBois. MySQL Reference Manual. T.c.X. DataKonsultAB, 1999.
  3. [4]
    M. Bergman. Search Tutorial: Guide to Effective Searching of the Internet. VisualMetrics orporation, December 1999.
  4. [5]
    E. Bolognesi and A. Brogi. A Prolog meta-search engine for the world wide web. In P. Van Roy and P. Tarau, editors, Proc. Int. Workshop on Distributed and Internet rogramming with Logic and Constraint Languages (DIPLCL99), Las Cruces, SA, 1999.
  5. [6]
    D. Cabeza, M. Hermenegildo, and S. Varma. The PiLLoW/CIAO Library for nternet/WWW Programming using Computational Logic Systems. In Proc. 1st workshop on Logic Programming Tools for Internet Applications, JICSLP’96, 1996.Google Scholar
  6. [7]
    E. Chisholm and T. G. Kolda. New term weighting formulas for the vector space method in Information Retrieval. Technical report, Computer Science and Mathematics Division, Oak Ridge National Laboratory, March 1999.Google Scholar
  7. [8]
    H. Davulcu, J. Freire, M. Kifer, and I. V. Ramakrishnan. A layered architecture for querying dynamic web content. In Proceedings of the 1999 ACM SIGMOD-International Conference on Management of Data, 1999.Google Scholar
  8. [9]
    D. Gelernter. Generative Communication in Linda. ACM Transactions on Programming Languages and Systems, 7(1):80–112, January 1985.zbMATHCrossRefGoogle Scholar
  9. [11]
    Intelligent Systems Laboratory. SICStus Prolog User’s Manual. Swedish Institute of Computer Science, 1998.
  10. [12]
    S. Lawrence and C. Lee Giles. Searching the Web: General and Scientific Information Access. IEEE Communications, 37(1):116–122, 1999.CrossRefGoogle Scholar
  11. [13]
    S. Lawrence and C. Lee Giles. Accessibility of Information On the Web. Intelligence, 11(1):32–39, 2000.CrossRefGoogle Scholar
  12. [14]
    NMSU Library. Searching the Internet.
  13. [17]
    C. Lynch. Searching the Internet. Scientific American, March 1997.Google Scholar
  14. [19]
    M. Porter. An algorithm for suffix stripping. Program, 14(3):130–137, 1980.Google Scholar
  15. [20]
    G. Salton and C. Buckley. Term Weighting Approaches in Automatic Text Retrieval. Information Processing and Management, 24(3):513–523, 1988.CrossRefGoogle Scholar
  16. [22]
    C.J. van Rijsbergen. Information Retrieval. Buttleworths, 2nd edition, 1979.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Antonio Brogi
    • 1
  • Gianluca Caruso
    • 1
  1. 1.Department of Computer ScienceUniversity of PisaItaly

Personalised recommendations