{"id":{"repo_id":"uiuc","oai_identifier":"oai:www.ideals.illinois.edu:2142/66444"},"canonical_url":"https://search.dev.ndltd.org/etd/uiuc/oai:www.ideals.illinois.edu:2142/66444","repository":{"repo_id":"uiuc","name":"University of Illinois - Urbana-Champaign","base_url":"https://www.ideals.illinois.edu/oai-pmh"},"display":{"title":"On the Design and Scheduling of an Index Processing System for Very Large Databases","abstract":"One of the major operations in an inverted file or indexed retrieval system is the combining of two or more lists of pointers to items in the database, based on a Boolean expression, to form composite lists of pointers of interests. While this is a simple operation, it is not performed efficiently by a general purpose digital computer. In this thesis, we present the organization and operation of an index processing system which offers speed increases in performing this operation. The effects of the design parameters, such as merge network configuration, disk storage system architecture, query complexity and arrival rate, and postings list length and overlaps, on the performance of this system are examined, using both analytical techniques and simulations. Five algorithms for scheduling the merge trees are also defined and their effects on system performance studied. Results of these studies will allow the implementor of a very large text database to select the system configuration and scheduling algorithms which would produce the greatest performance under a specific users software environment.","abstract_html":"One of the major operations in an inverted file or indexed retrieval system is the combining of two or more lists of pointers to items in the database, based on a Boolean expression, to form composite lists of pointers of interests. While this is a simple operation, it is not performed efficiently by a general purpose digital computer. In this thesis, we present the organization and operation of an index processing system which offers speed increases in performing this operation. The effects of the design parameters, such as merge network configuration, disk storage system architecture, query complexity and arrival rate, and postings list length and overlaps, on the performance of this system are examined, using both analytical techniques and simulations. Five algorithms for scheduling the merge trees are also defined and their effects on system performance studied. Results of these studies will allow the implementor of a very large text database to select the system configuration and scheduling algorithms which would produce the greatest performance under a specific users software environment.","abstract_has_math":false,"creators":["Huang, Hui-Ming"],"institution":"University of Illinois at Urbana-Champaign","degree_name":"Ph.D.","degree_level":"Dissertation","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2014,"date_issued":"2014-12-13T18:02:17Z","date_published":"2014-12-13T18:02:17Z","updated_at":"2026-07-22T22:25:55Z","subjects":["Computer Science"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier","label":"Identifier","values":["(UMI)AAI8108547"],"render_values":[{"text":"(UMI)AAI8108547","href":null,"code":true}]}]},"links":{"outbound_url":"http://hdl.handle.net/2142/66444","outbound_label":"Handle","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:creator","label":"Author","values":["Huang, Hui-Ming"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2014-12-13T18:02:17Z","10000-01-01","1980"]},{"key":"dc:type","label":"Dc Type","values":["text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Dissertation"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Ph.D."]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["University of Illinois at Urbana-Champaign"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Computer Science"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language","label":"Dc Language","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["http://hdl.handle.net/2142/66444","(UMI)AAI8108547"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["One of the major operations in an inverted file or indexed retrieval system is the combining of two or more lists of pointers to items in the database, based on a Boolean expression, to form composite lists of pointers of interests. While this is a simple operation, it is not performed efficiently by a general purpose digital computer. In this thesis, we present the organization and operation of an index processing system which offers speed increases in performing this operation. The effects of the design parameters, such as merge network configuration, disk storage system architecture, query complexity and arrival rate, and postings list length and overlaps, on the performance of this system are examined, using both analytical techniques and simulations. Five algorithms for scheduling the merge trees are also defined and their effects on system performance studied. Results of these studies will allow the implementor of a very large text database to select the system configuration and scheduling algorithms which would produce the greatest performance under a specific users software environment.","Made available in DSpace on 2014-12-13T18:02:17Z (GMT). No. of bitstreams: 1 8108547.pdf: 5019847 bytes, checksum: 386cfb2f077b5fc4cab2f65e5c8639a8 (MD5) Previous issue date: 1980","Embargo set by: Seth Robbins for item 66622 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","163 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1980."]},{"key":"dc:title","label":"Title","values":["On the Design and Scheduling of an Index Processing System for Very Large Databases"]}]}],"canonical_facts":{"dc:creator":["Huang, Hui-Ming"],"dc:date":["2014-12-13T18:02:17Z","10000-01-01","1980"],"dc:description":["One of the major operations in an inverted file or indexed retrieval system is the combining of two or more lists of pointers to items in the database, based on a Boolean expression, to form composite lists of pointers of interests. While this is a simple operation, it is not performed efficiently by a general purpose digital computer. In this thesis, we present the organization and operation of an index processing system which offers speed increases in performing this operation. The effects of the design parameters, such as merge network configuration, disk storage system architecture, query complexity and arrival rate, and postings list length and overlaps, on the performance of this system are examined, using both analytical techniques and simulations. Five algorithms for scheduling the merge trees are also defined and their effects on system performance studied. Results of these studies will allow the implementor of a very large text database to select the system configuration and scheduling algorithms which would produce the greatest performance under a specific users software environment.","Made available in DSpace on 2014-12-13T18:02:17Z (GMT). No. of bitstreams: 1 8108547.pdf: 5019847 bytes, checksum: 386cfb2f077b5fc4cab2f65e5c8639a8 (MD5) Previous issue date: 1980","Embargo set by: Seth Robbins for item 66622 Lift date: Forever Reason: Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","Restricted to the U of I community idenfinitely during batch ingest of legacy ETDs","U of I Only","163 p.","Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1980."],"dc:identifier":["http://hdl.handle.net/2142/66444","(UMI)AAI8108547"],"dc:language":["eng"],"dc:subject":["Computer Science"],"dc:title":["On the Design and Scheduling of an Index Processing System for Very Large Databases"],"dc:type":["text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Dissertation"],"thesis:degree_name":["Ph.D."],"thesis:institution_name":["University of Illinois at Urbana-Champaign"]},"updated_at":"2026-07-22T22:25:55Z"}