Managing metadata for distributed information servers.
dc.contributor.author | Hinds, Nigel Collin | |
dc.contributor.advisor | Ravishankar, Chinya V. | |
dc.date.accessioned | 2016-08-30T17:59:27Z | |
dc.date.available | 2016-08-30T17:59:27Z | |
dc.date.issued | 1999 | |
dc.identifier.uri | http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqm&rft_dat=xri:pqdiss:9959776 | |
dc.identifier.uri | https://hdl.handle.net/2027.42/132152 | |
dc.description.abstract | The amount of available information on the World Wide Web (WWW) and the access frequencies have grown rapidly with network size, but methods to locate and access desired data remain rudimentary. As a result, the information consumer must sift inefficiently through large amounts of data. Users are increasingly interested in accessing structured data sets such as phone books which contain names, addresses and phone numbers, or product catalogs which typically contain product names, features and prices. This pattern resembles distributed database access more than traditional file or document system access. The problem of finding data of interest, from a large set of distributed sites, has been called <italic>information discovery</italic>. This study explores information discovery issues associated with the rapid growth of catalog information available at Internet Web sites. We present the design and implementation of the Domain Specific Metadata Service (DSMS), a general distributed index system that improves metadata discovery on large networks. The primary feature of this architecture is its novel use of hierarchical metadata to describe Web site contents. We have found that using hierarchical metadata to organize and distribute indices can facilitate the search of metadata. We present experimental results demonstrating search response times and scalability improvements. Finally, we present the design and testing of a cache consistency manager to mitigate the effects of communication overhead in our distributed system. Simulation results show that hierarchical grouping of replica peers can provide efficient update dissemination as well as fault tolerance. | |
dc.format.extent | 119 p. | |
dc.language | English | |
dc.language.iso | EN | |
dc.subject | Distributed Information | |
dc.subject | Information Discovery | |
dc.subject | Managing | |
dc.subject | Metadata | |
dc.subject | Servers | |
dc.subject | World Wide Web | |
dc.title | Managing metadata for distributed information servers. | |
dc.type | Thesis | |
dc.description.thesisdegreename | PhD | en_US |
dc.description.thesisdegreediscipline | Applied Sciences | |
dc.description.thesisdegreediscipline | Computer science | |
dc.description.thesisdegreegrantor | University of Michigan, Horace H. Rackham School of Graduate Studies | |
dc.description.bitstreamurl | http://deepblue.lib.umich.edu/bitstream/2027.42/132152/2/9959776.pdf | |
dc.owningcollname | Dissertations and Theses (Ph.D. and Master's) |
Files in this item
Remediation of Harmful Language
The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.
Accessibility
If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.