Effective, Efficient Retrieval in a Network of Digital Information Objects
| dc.contributor.author | France, Robert Karl | en |
| dc.contributor.committeechair | Fox, Edward A. | en |
| dc.contributor.committeemember | Hitchingham, Eileen | en |
| dc.contributor.committeemember | Ramakrishnan, Naren | en |
| dc.contributor.committeemember | Heath, Lenwood S. | en |
| dc.contributor.committeemember | Kafura, Dennis G. | en |
| dc.contributor.department | Computer Science | en |
| dc.date.accessioned | 2014-03-14T20:19:15Z | en |
| dc.date.adate | 2001-11-27 | en |
| dc.date.available | 2014-03-14T20:19:15Z | en |
| dc.date.issued | 2001-11-26 | en |
| dc.date.rdate | 2002-11-27 | en |
| dc.date.sdate | 2001-11-27 | en |
| dc.description.abstract | Although different authors mean different thing by the term "digital libraries," one common thread is that they include or are built around collections of digital objects. Digital libraries also provide services to large communities, one of which is almost always search. Digital library collections, however, have several characteristic features that make search difficult. They are typically very large. They typically involve many different kinds of objects, including but not limited to books, e-published documents, images, and hypertexts, and often including items as esoteric as subtitled videos, simulations, and entire scientific databases. Even within a category, these objects may have widely different formats and internal structure. Furthermore, they are typically in complex relationships with each other and with such non-library objects as persons, institutions, and events. Relationships are a common feature of traditional libraries in the form of "See / See also" pointers, hierarchical relationships among categories, and relations between bibliographic and non-bibliographic objects such as having an author or being on a subject. Binary relations (typically in the form of directed links) are a common representational tool in computer science for structures from trees and graphs to semantic networks. And in recent years the World-Wide Web has made the construct of linked information objects commonplace for millions. Despite this, relationships have rarely been given "first-class" treatment in digital library collections or software. MARIAN is a digital library system designed and built to store, search over, and retrieve large numbers of diverse objects in a network of relationships. It is designed to run efficiently over large collections of digital library objects. It addresses the problem of object diversity through a system of classes unified by common abilities including searching and presentation. Divergent internal structure is exposed and interpreted using a simple and powerful graphical representation, and varied format through a unified system of presentation. Most importantly, MARIAN collections are designed to specifically include relations in the form of an extensible collection of different sorts of links. This thesis presents MARIAN and argues that it is both effective and efficient. MARIAN is effective in that it provides new and useful functionality to digital library end-users, and in that it makes constructing, modifying, and combining collections easy for library builders and maintainers. MARIAN is efficient since it works from an abstract presentation of search over networked collections to define on the one hand common operations required to implement a broad class of search engines, and on the other performance standards for those operations. Although some operations involve a high minimum cost under the most general assumptions, lower costs can be achieved when additional constraints are present. In particular, it is argued that the statistics of digital library collections can be exploited to obtain significant savings. MARIAN is designed to do exactly that, and in evidence from early versions appears to succeed. In conclusion, MARIAN presents a powerful and flexible platform for retrieval on large, diverse collections of networked information, significantly extending the representation and search capabilities of digital libraries. | en |
| dc.description.degree | Ph. D. | en |
| dc.identifier.other | etd-11272001-124212 | en |
| dc.identifier.sourceurl | http://scholar.lib.vt.edu/theses/available/etd-11272001-124212/ | en |
| dc.identifier.uri | http://hdl.handle.net/10919/29754 | en |
| dc.publisher | Virginia Tech | en |
| dc.relation.haspart | RKFetd.pdf | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | weighted sets | en |
| dc.subject | class manager | en |
| dc.subject | information retrieval | en |
| dc.subject | information network | en |
| dc.subject | indexing | en |
| dc.subject | digital library | en |
| dc.subject | MARIAN | en |
| dc.subject | stopping rules | en |
| dc.subject | searching | en |
| dc.subject | NDLTD | en |
| dc.title | Effective, Efficient Retrieval in a Network of Digital Information Objects | en |
| dc.type | Dissertation | en |
| thesis.degree.discipline | Computer Science | en |
| thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
| thesis.degree.level | doctoral | en |
| thesis.degree.name | Ph. D. | en |
Files
Original bundle
1 - 1 of 1