Article

Superimposing codes representing hierarchical information in web directories

Authors:

Angel ViñaAuthors Info & Claims

WIDM '01: Proceedings of the 3rd international workshop on Web information and data management

Pages 54 - 60

https://doi.org/10.1145/502932.502943

Published: 09 November 2001 Publication History

Abstract

In this article we describe how superimposed coding can be used to represent hierarchical information, which is especially useful in categorized information retrieval systems (for example, Web directories). Superimposed coding have been widely used in signature files in a rigid manner, but our approach is more flexible and powerful. The categorization is based on a directed acyclic graph and each document is assigned to one or more nodes, using superimposed coding we represent the categorization information of each document in a signature. In this paper we explain the superimposed coding theory and how this coding technique can be applied to more flexible environments. Furthermore, we realize an exhaustive analysis of the important factors that have repercussions on the performance of the system. Finally we expose the conclusions obtained from this article.

References

[1]

Baeza-Yates, R., Ribeiro, B. Modern Information Retrieval. Addison-Wesley, ISBN:0-201-39829-X, 1999.

Digital Library

[2]

Chakrabarti, S., Dom, B., Agrawal, R., Raghavan, P. Using Taxonomy, Discriminants, and Signatures for Navigating in Text Databases. VLDB: 446-455, 1997.

Digital Library

[3]

Faloutsos, C., Christodoulakis, S. Signature files: An access method for documents and its analytical performance evaluation. ACM Transactions on Office Information Systems 2, 267-288, 1984.

Digital Library

[4]

Faloutsos, C. Access methods for text. ACM Computing Surveys, 17 (1), 49-74, 1985.

Digital Library

[5]

Faloutsos, C., Christodoulakis, S. Description and Performance Analysis of Signature File Methods for Office Filing. TOIS 5(3): 237-257, 1987.

Digital Library

[6]

Faloutsos, C., Oard, D. W. A Survey of Information Retrieval and Filtering Methods, Technical Report CS-TR- 3514, Dept. of Computer Science, Univ. of Maryland, 1995.

Digital Library

[7]

Frakes, W., Baeza-Yates, R. Information Retrieval: data structures and algorithms. Prentice-Hall, ISBN: 0-13- 463837-9, 1992.

Digital Library

[8]

Haskin, R. Special purpose processors for text retrieval. Database Engineering 4, 1, 16-29, 1981.

[9]

Jacobson, G., Krishnamurthy, B., Srivastava, D., Suciu, D. Focusing Search in Hierarchical Structures with Directory Sets. CIKM 1-9, 1998.

Digital Library

[10]

Jansen, B., Spink, A., Bateman, J., Saracevic, T. Real Life Information Retrieval: A Study Of User Queries On The Web. ACM SIGIR Forum, 32(1):5-17, 1998.

Digital Library

[11]

Mooers, C. Application of Random Codes to the Gathering of Statistical Information, Bulletin 31, Zator Co., Cambridge, Mass. Based on M.S. thesis, MIT, 1948.

[12]

Lawrence, S., Giles, C.L., Accessibility of information on the Web. Nature, 400:107-109, 1999.

[13]

Lee, D. L., Leng, C. Partitioned Signature Files: Design Issues and Performance Evaluation. TOIS 7(2): 158-180, 1989.

Digital Library

[14]

Lee, D. L., Kim, Y. M., Patel, G. Efficient Signature File Methods for Text Retrieval, IEEE Transactions on Data and Knowledge Engineering, 7(3):423-435, 1995.

Digital Library

[15]

Roberts, C.S. Partial-match retrieval via method of superimposed codes. Proc.IEEE, 67(12), 1624-42, 1979.

[16]

Stiassny, S., Mathematical Analysis of Various Superimposed Coding Methods, American Documentation, 11(2), pp. 155-169, 1960.

Cited By

Caserio CMarchi LPulcini G(2013)Hierarchical and Relational Database Accounting Systems: Critical Aspects and Trade-OffsAccounting Information Systems for Decision Making10.1007/978-3-642-35761-9_13(221-231)Online publication date: 19-Apr-2013
https://doi.org/10.1007/978-3-642-35761-9_13
Cacheda FCarneiro VGuerrero CViña A(2003)Optimization of restricted searches in web directories using hybrid data structuresProceedings of the 25th European conference on IR research10.5555/1757788.1757830(436-451)Online publication date: 14-Apr-2003
https://dl.acm.org/doi/10.5555/1757788.1757830
Cacheda FCarneiro VGuerrero CViña A(2003)Optimization of Restricted Searches in Web Directories Using Hybrid Data StructuresAdvances in Information Retrieval10.1007/3-540-36618-0_31(436-451)Online publication date: 15-Apr-2003
https://doi.org/10.1007/3-540-36618-0_31

Index Terms

Superimposing codes representing hierarchical information in web directories
1. Information systems
  1. Information retrieval
    1. Retrieval models and ranking
  2. World Wide Web
    1. Web applications
    2. Web services

Recommendations

Low-weight superimposed codes and related combinatorial structures: Bounds and applications
Abstract
A ( k , n )-superimposed code is a well known and widely used combinatorial structure that can be represented by a t × n binary matrix such that for any k columns of the matrix and for any column c chosen among these k columns, there ...
Weighted superimposed codes and constrained integer compressed sensing

We introduce a new family of codes, termed weighted superimposed codes (WSCs). This family generalizes the class of Euclidean superimposed codes (ESCs), used in multiuser identification systems. WSCs allow for discriminating all bounded, integer-valued ...
Superimposed codes and threshold group testing
Information Theory, Combinatorics, and Search Theory

We will discuss superimposed codes and non-adaptive group testing designs arising from the potentialities of compressed genotyping models in molecular biology. The given paper was motivated by the 30th anniversary of D'yachkov-Rykov recurrent upper ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences

WIDM '01: Proceedings of the 3rd international workshop on Web information and data management

November 2001

87 pages

ISBN:1581134444

DOI:10.1145/502932

Conference Chair:
Ee-Peng Lim
Nanyang Technological University, Singapore

Copyright © 2001 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 09 November 2001

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

CIKM01

Sponsor:

CIKM01: International Conference on Information and Knowledge Management

November 9 - 1, 2001

Georgia, Atlanta, USA

Upcoming Conference

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
235
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 24 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Caserio CMarchi LPulcini G(2013)Hierarchical and Relational Database Accounting Systems: Critical Aspects and Trade-OffsAccounting Information Systems for Decision Making10.1007/978-3-642-35761-9_13(221-231)Online publication date: 19-Apr-2013
https://doi.org/10.1007/978-3-642-35761-9_13
Cacheda FCarneiro VGuerrero CViña A(2003)Optimization of restricted searches in web directories using hybrid data structuresProceedings of the 25th European conference on IR research10.5555/1757788.1757830(436-451)Online publication date: 14-Apr-2003
https://dl.acm.org/doi/10.5555/1757788.1757830
Cacheda FCarneiro VGuerrero CViña A(2003)Optimization of Restricted Searches in Web Directories Using Hybrid Data StructuresAdvances in Information Retrieval10.1007/3-540-36618-0_31(436-451)Online publication date: 15-Apr-2003
https://doi.org/10.1007/3-540-36618-0_31

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents