The week's pick
Random Articles
Reseach Article
Article:Indexing for Efficient Term-Based Search Using Mapping Functions
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 4 - Number 8 |
| Year of Publication: 2010 |
| Authors: V. Venkata Ramana, Srinivasa Rao.P, K.K.Basheer |
10.5120/851-1189
|
V. Venkata Ramana, Srinivasa Rao.P, K.K.Basheer . Article:Indexing for Efficient Term-Based Search Using Mapping Functions. International Journal of Computer Applications. 4, 8 ( August 2010), 5-8. DOI=10.5120/851-1189
Abstract
The transformation from the received item to the searchable data structure is called Indexing. Indexing (originally called Cataloging) [11] is the oldest technique for identifying the contents of items to assist in their retrieval. The basic difference between the existing methods and the one discussed here is that these methods rely on a structure of web page linkages that lead from or to the indexed page. In contrast, our method uses the content of the pages linked to or from the indexed page for indexing. So, our method uses a structure of words used by the linked pages, whereas the current methods use the structure of the connections between linked pages.
References
- BENTLEY, J.L. and FRIEDMAN, J.H., Fast Algorithm for Constructing Minimal Spanning Trees in Coordinate Spaces, Stanford Report, STAN-CS-75-529 (1975).
- B. Babcock, M. Datar, and R. Motwani. Load shedding for aggregation queries over data streams. In Proc. of IEEE ICDE, 2004.
- BOOKSTEIN, A. and KRAFT, D., 'Operations research applied to document indexing and retrieval decisions', Journal of the ACM, 24, 410-427 (1977).
- GERALD J.KOWALSKI and MARK T.MAYBURY, ‘Information storage and retrieval systems’, vol 2, pp. 51-52 (2002)
- GOFFMAN, W., 'A searching procedure for information retrieval', Information Storage and Retrieval, 2, 294-304 (1977).
- HARPER, D. and van RIJSBERGEN, C.J., 'An evaluation of feedback in document retrieval using co-occurrence data', Journal of Documentation, 34, 189-216 (1978).
- Helen J. Peat and Peter Willett ' The Limitations of Term Co-Occurrence Data for Query Expansion in Document Retrieval Systems', JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE. 42(5):378-383, 1991
- KU, H.H. and KULLBACK, S., 'Approximating discrete probability distributions', IEEE Transactions on Information Theory, IT-15, 444-447 (1969).
- Qi Su and Jennifer Widom, ‘Indexing Relational Database Content Offline for Efficient Keyword-Based Search’, Proceedings of the 9th International Database Engineering & Application Symposium (IDEAS’05).
- VAGELIS.H, LUIS.G, YANNIS.P, Efficient IR-Style Keyword Search over Relational Databases, Proceedings of the 29th VLDB Conference, Berlin, Germany, 2003
- WHITNEY, V.K.M., 'Minimal spanning tree, Algorithm 422', Communications of the ACM, 15, 273-274 (1972).
- YU, C.T. and SALTON, G., 'Effective information retrieval using term accuracy', Communications of the ACM, 20, 135-142 (1977).
- Transaction Processing Council. http://www.tpc.org
- Q. Su and J.Widom. Indexing elational database content offline for efficient keyword-based search. Stanford University Technical Report, 2003.
- G. Wiederhold. Movie database. http://www-db.stanford.edu/pub/movies/doc.html.
Index Terms
Keywords