Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Implementation Overview
Conclusions and Further Work
References

Index-based persistent document identifiers

Profile image of Diomidis SpinellisDiomidis Spinellis

2005

https://doi.org/10.1023/B:INRT.0000048494.05013.6A
visibility

…

description

21 pages

link

1 file

Abstract

The infrastructure of a typical search engine can be used to calculate and resolve persistent document identifiers: a string that can uniquely identify and locate a document on the Internet without reference to its original location (URL). Bookmarking a document using such an identifier allows its retrieval even if the document's URL, and, in many cases, its contents change. Web client applications can offer facilities for users to bookmark a page by reference to a search engine and the persistent identifier instead of the original URL.

Related papers

An Improved Indexing Mechanism to Index Web Documents
Pooja Gupta

2013 5th International Conference on Computational Intelligence and Communication Networks, 2013

Owing to the dynamic nature of the web, it is difficult for search engine to find the relevant documents to serve a user query. For this purpose, search engine maintains the index of downloaded documents stored in the local repository. Whenever a query comes search engine searches the index in order to find the relevant matched results to be presented to the user. The quality of the matched result depends on the information stored in the index. The more efficient is the structure of index, more efficient the performance of search engine. Generally, inverted index are based solely on the frequency of keywords present in number of documents. In order to improve the efficiency of the search engine, an improved indexing mechanism to index the web documents is being proposed that keeps the context related information integrated with the frequency of the keyword. The structure is implemented using Trie. The implementation results on various documents show that proposed index efficiently stores the documents and search is fast.

View PDFchevron_right
PowerBookmarks: a system for personalizable Web information organization, sharing, and management
Sougata Mukherjea

Computer Networks, 1999

View PDFchevron_right
Context based Web Indexing for Storage of Relevant Web Pages
nidhi tyagi

Context, 2012

A focused crawler downloads web pages that are relevant to a user specified topic. The downloaded documents are indexed with a view to optimize speed and performance in finding relevant documents for a search query at the search engine side. ...

View PDFchevron_right
A bookmarking service for organizing and sharing URLs
Nathalie Mathe

Computer Networks and ISDN Systems, 1997

Web browser bookmarking facilities predominate as the method of choice for managing URLs. In this paper, we describe some deficiencies of current bookmarking schemes, and examine an alternative to current approaches. We present WebTagge?, an implemented prototype of a personal bookmarking service that provides both individuals and groups with a customizable means of organizing and accessing Web-based information resources. In addition, the service enables users to supply feedback on the utility of these resources relative to their information needs, and provides dynamically-updated ranking of resources based on incremental user feedback. Individuals may access the service from anywhere on the Internet, and require no special software. This service greatly simplifies the process of sharing URLs within groups, in comparison with manua1 methods involving email. The underlying bookmark organization scheme is more natural and flexible than current hierarchical schemes supported by the major Web browsers, and enables rapid access to stored bookmarks. 0 1997 Published by Elsevier Science B.V.

View PDFchevron_right
A Comparison of Two Persistent Storage Tools for Implementing a Search Engine
Mike S Jackson

Persistent Object Systems: …, 2001

This paper compares two Java-based persistent storage mechanisms: a commercially available object-oriented database (OODB) system and the persistent storage tool PJama [1] on the basis of their suitability for implementing the index component of an experimental World Wide Web search engine called WWLib-TNG. Persistence is provided to the builder component of the search engine, which constructs a catalogue of Web pages. The searcher component of the engine searches the catalogue. The implementation of the builder using PJama and using an OODB were compared with respect to time taken to construct a catalogue, efficient use of disk space and scalability. The implementations of the searcher were compared on response time and scalability. The comparison showed that for this application PJama performs better than the OODB. Compared with the OODB, PJama gave 300% better build performance and was more scalable.

View PDFchevron_right
A Domain Specific Indexing Technique for Hidden Web Documents
Ritu Shandilya

2011

The web creates new challenges for information retrieval as the amount of information on the web is growing rapidly. One of the challenges is to crawl the information hidden behind a search form, as a tremendous amount of high quality content is hidden behind the search forms. This high quality information can be retrieved by hidden web crawler using a Web query front-end to the database with standard HTML form elements. The documents retrieved by a hidden web crawler are more relevant, as these documents are accessible only through dynamically generated pages, delivered in response to a query. To index these documents efficiently, the search engine requires new indexing technique that optimizes speed and performance for finding relevant documents for a search query. In this paper, a new technique to index hidden web crawled documents is being proposed that not only indexes the documents more efficiently but also gives a classification of documents. In the technique, attributes of a query interface and their value sets are employed to index the documents.

View PDFchevron_right
Information archiving with bookmarks
Mark Chignell

Proceedings of the SIGCHI conference on Human factors in computing systems - CHI '98, 1998

Boolma& are used as "personal Web information spaces" to help people remember and retrieve interesting Web pages. A study of personal Web tiormation spaces sm-veyed 322 Web users and analyzed the bookmark archives of 50 Web users. The results of this study are used to address why people make bookmarks, and how they create, use, and organize them. Recommendations for improving the organimtion, vimahxation, representation, and integration of bookmarks are provided The recommendations include simple mechauisms for tiling bookmarks at creation time, the use of time-based . . xxsmhidons with automated filters, the use of contextual inSormation in representing bookmarks, and the combhration of hierarchy formation and Web page authoring to aid in organizing and viewing bookmarks. Keywords WWW, bookmark information space, survey, empirical study, design 1 . PAPERS CHI 98 l 18-23 APRIL 1998

View PDFchevron_right
Assigning Document Identifiers to Enhance Compressibility of Web Search Engines Indexes
Fabrizio Silvestri

… of the 2004 ACM symposium on …, 2004

View PDFchevron_right
Modelling information persistence on the web
Mário J. Silva

2006

Abstract Models of web data persistency are essential tools for the designof efficient information extraction systems that repeatedlycollect and process the data. This study models the persistence ofweb data through the measurement of URL and content persistenceacross several snapshots of a national community web, collectedfor 3 years. We found that the lifetimes of URLs and contents aremodelled by logarithmic functions.

View PDFchevron_right
The electronic road: personalized content browsing
Stefanos Kollias

Multimedia, IEEE, 2003

View PDFchevron_right

References (33)

  1. Ashman, H., Electronic Document Addressing: Dealing with Change, ACM Comput- ing Surveys, 32(3), 201-212 (2000).
  2. Barabási, A.-L., Albert, R., & Jeong, H., Scale-free characteristics of random net- works: the topology of the world-wide web, Physica, A(281), 69-77 (2000).
  3. Berners-Lee, T., Masinter, L., & McCahill, M., RFC 1738: Uniform Resource Loca- tors (URL), 1994 (Dec.). Updated by RFC1808, RFC2368 (Fielding, 1995; Hoff- man et al., 1998). Status: PROPOSED STANDARD.
  4. Brin, S., & Page, L., The Anatomy of a Large-Scale Hypertextual Web Search Engine, Computer Networks, 30(1-7), 107-117 (1998), Seventh International World Wide Web Conference Proceedings (WWW7).
  5. Cerny, V., Thermodynamical Approach to the Traveling Salesman Problem: an Ef- ficient Simulation Algorithm, Journal of Optimization Theory and Applications, 45, 41-51 (1985).
  6. Chankhunthod, A., Danzig, P. B., Neerdaels, C., Schwartz, M. F., & Worrell, K. J., A Hierarchical Internet Object Cache, in USENIX Technical Conference Proceed- ings, Usenix Association, Berkeley, CA, 1996.
  7. Fielding, R., RFC 1808: Relative Uniform Resource Locators, 1995 (June). Updates RFC1738 (Berners-Lee et al., 1994). Updated by RFC2368 (Hoffman et al., 1998). Status: PROPOSED STANDARD.
  8. Forrest, S., Genetic Algorithms, ACM Computing Surveys, 28(1), 77-83 (1996).
  9. Garey, M. R., & Johnson, D. S., Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman and Company, 1979.
  10. Glover, F., Tabu Search -Part I, ORSA Journal on Computing, 1, 190-206 (1990).
  11. Goldberg, D. E., Genetic Algorithms: In Search of Optimization & Machine Learning, Addison-Wesley, 1989.
  12. Goldberg, D. E., Genetic and Evolutionary Algorithms Come of Age, Communications of the ACM, 37(3), 113-119 (1994).
  13. Grefenstette, J. J., Optimization of Control Parameters for Genetic Algorithms, IEEE Transactions on Systems, Man, and Cybernetics, 16(1), 122-128 (1986).
  14. Hitchcock, S., Carr, L., Harris, S., Hey, J. M. N., & Hall, W., Citation linking: im- proving access to online journals, pages 115-122 of Proceedings of the 2nd ACM international conference on Digital libraries, 1999.
  15. Hoffman, P., Masinter, L., & Zawinski, J., RFC 2368: The mailto URL scheme, 1998 (July). Updates RFC1738, RFC1808 (Berners-Lee et al., 1994; Fielding, 1995). Status: PROPOSED STANDARD.
  16. Holland, J. H., Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, Michigan, 1975.
  17. Karr, C. L., Genetic Algorithms for Modelling, Design, and Process Control, pages 233-238 of CIKM '93. Proceedings of the Second International Conference on Information and Knowledge Management, ACM, 1993.
  18. Knuth, D. E., The Art of Computer Programming, second edn., Vol. 2: Seminumerical Algorithms, Addison-Wesley, Reading, MA, 1981.
  19. Koulamas, C., Antony, S. R., & Jaen, R., A Survey of Simulated Annealing Applica- tions to Operations Research Problems, Omega International Journal of Manage- ment Science, 22(1), 41-56 (1994).
  20. Lawrence, S., & Giles, C. L., Searching the Web: General and Scientific Information Access, IEEE Communications, 37(1), 116-122 (1999).
  21. Lawrence, S., Giles, C. L., & Bollacker, K., Digital Libraries and Autonomous Citation Indexing, IEEE Computer, 32(6), 67-71 (1999).
  22. Lawrence, S., Pennock, D. M., Flake, G. W., Coetzee, F. M., Glover, E., Nielsen, F. Å., Kruger, A., & Giles, C. L., Persistence of Web References in Scientific Research, IEEE Computer, 34(2), 26-31 (2001).
  23. Moffat, A., Economical Inversion of Large Text Files, Computing Systems, 5(2), 125- 139 (1992).
  24. Park, S.-T., Pennock, D., Giles, L., & Krovetz, R., Analysis of Lexical Signatures for Finding Lost or Related Documents, pages 11-18 of Proceedings of the 25th Annual International ACM-SIGIR Conference on Research and Development in Information Retrieval, New York: ACM Press, for ACM, 2002.
  25. Phelps, T. A., & Wilensky, R., Robust Hyperlinks: Cheap, Everywhere, Now, in Pro- ceedings of Digital Documents and Electronic Publishing (DDEP00), 2000.
  26. Pitkow, J. E., Summary of WWW Characterizations, World Wide Web, 2(1-2), 3-13 (1999).
  27. Schneier, B., Applied Cryptography, second edn., Wiley, New York, 1996.
  28. Spinellis, D., The Design and Implementation of a Legal Text Database, pages 339- 348 of Karagiannis, D. (ed), DEXA 94: 5th International Conference on Database and Expert Systems Applications, Springer-Verlag, 1994. Lecture Notes in Com- puter Science 856.
  29. Spinellis, D., The Decay and Failures of Web References, Communications of the ACM, 46(1), 71-77 (2003).
  30. Takeda, M. K. K., Information Retrieval on the Web, ACM Computing Surveys, 32(2), 144-173 (2000).
  31. Van Laarhoven, P. J. M., & Aarts, E. H. L., Simulated Annealing: Theory and Appli- cations, D. Reidel, Dordrecht, The Nethelands, 1987.
  32. Wagner, M., Google Defies Dot-com Downturn, TechWeb, Apr. (2001), Online http://www.techweb.com/wire/story/TWB20010427S0011 (current June 2002).
  33. Zobel, J., Heinz, S., & Williams, H. E., In-memory Hash Tables for Accumulating Text Vocabularies, Information Processing Letters, 80(6), 271-277 (2001).

Related papers

Persistent identifiers-an overview
Juha Hakala

2010

This article describes five persistent identifier systems (ARK, DOI, PURL, URN and XRI) and compares their functionality against the cool URIs. The aim is to provide an overview, not to give any kind of ranking of these systems.

View PDFchevron_right
Navigating the World Wide Web: bookmark maintenance architectures
Carsten Sorensen

Interacting with Computers, 2001

The World Wide Web is increasingly becoming the preferred repository of information. The strength of this information infrastructure is also its weakness. Faced with the chaos of millions of places to go and thousands of places to remember having been, the thousands of new Web users who join every day, need a helping hand. The aim of this paper is, to highlight possible components of technologies supporting web navigation and the maintenance of indexes to web resources. The BASE framework is suggested as a means of understanding the pragmatic technological choices, and six experimental prototypes are presented and discussed. The prototypes support various aspects of bookmark maintenance and information filtering.

View PDFchevron_right
On URL and content persistence
Mário J. Silva

2005

This report presents a study of URL and content persistence among 51 million pages from a national web harvested 8 times over almost 3 years. This study differs from previous ones because it describes the evolution of a large set of web pages for several years, studying in depth the characteristics of persistent data. We found that the persistence of URLs and contents follows a logarithmic distribution. We characterized persistent URLs and contents, and identified reasons for URL death.

View PDFchevron_right
Towards Persistent Identification of Resources in Personal Information Management
Andreas Nürnberger

Persistent identification is necessary for recognition, dissemination and (external) cross-references to digital objects. Uniform Resource Identifiers (URIs) provide an established scheme for this task, but do not guarantee stable and persistent identification. In the context of (personal) archives, stability is needed when references are be stored on a medium where later changes to identifiers cannot be corrected at all or only with a very large overhead, such as WORM media or tape archives. Additionally, resources like contacts or appointments do not have a URI, while other URIs, such as file system paths or the IMAP URI, are unstable by design and cannot represent the dynamic aspects of Personal Information Management (PIM). This paper discusses problems of archiving that arise with entity identification in PIM, especially on the example of the personal file system.

View PDFchevron_right
Persistent Identifier Distributed System for Digital Libraries
massimiliano saccone, Emanuele Bellini

2009

In this paper we present an Italian initiative, involving relevant research institutions and national libraries, aimed at implementing an NBN Persistent Identifiers (PI) infrastructure based on a novel hardware/software architecture. We describe a distributed and hierarchical approach for the management of an NBN namespace and illustrate assignment policies and identifier resolution strategies based on request forwarding mechanisms. Starting from the core motivations for the assignment of "persistent identifiers" to digital objects, we draw a state of art in PI technologies, standards and initiatives, and illustrate other NBN implementations. We then describe structure and goals of our initiative and illustrate the features already implemented in our system and the results of our testing activities. Finally, we draw some conclusions and point out the future directions of our work.

View PDFchevron_right
580 California St., Suite 400
San Francisco, CA, 94104
© 2025 Academia. All rights reserved