A Design for a List Merging Network

In inverted file database systems (and in a number of other applications), much of the processing consists of merging two or more previously sorted lists based on a Boolean expression. Conventional general purpose computers are not well suited for this type of operation, with even well written progr...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on computers 1979-06, Vol.C-28 (6), p.406-413
1. Verfasser:	Hollaar
Format:	Artikel
Sprache:	eng
Schlagworte:	Backend processors binary tree networks computer system architecture inverted file databases nonnumeric processing pipelined networks sorted list merging special-purpose LSI processors system design
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

container_end_page	413
container_issue	6
container_start_page	406
container_title	IEEE transactions on computers
container_volume	C-28
creator	Hollaar
description	In inverted file database systems (and in a number of other applications), much of the processing consists of merging two or more previously sorted lists based on a Boolean expression. Conventional general purpose computers are not well suited for this type of operation, with even well written programs utilizing less than 10 percent of the available memory capacity for actual processing of data. However, a low-cost special purpose backend processor can be used to efficiently handle the list merging operations, freeing the conventional processor for other uses.
doi_str_mv	10.1109/TC.1979.1675380
format	Article
fullrecord	<record><control><sourceid>crossref_RIE</sourceid><recordid>TN_cdi_ieee_primary_1675380</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1675380</ieee_id><sourcerecordid>10_1109_TC_1979_1675380</sourcerecordid><originalsourceid>FETCH-LOGICAL-c259t-617d837d57ecfe0c0cb948dfd9164d14728a2bdf8fb7fcc1d8923f44224547983</originalsourceid><addsrcrecordid>eNpFj0tLxDAUhYMoOI6uXbgpuG7n3jRpcpdDfULVTV2HNo9SH1NJCuK_12EKrs7inO_Ax9glQoEItGnrAklRgZWSpYYjtkIpVU4kq2O2AkCdUynglJ2l9AYAFQdasettduPTOOyyMMWsy5oxzdmTj8O4G7JnP39P8f2cnYTuI_mLJdfs9e62rR_y5uX-sd42ueWS5rxC5XSpnFTeBg8WbE9Cu-AIK-FQKK473rugQ6-Cteg08TIIwbmQQpEu12xz-LVxSin6YL7i-NnFH4Ng9o6mrc3e0SyOf8TVgRi99__rpf0FJV5LFg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Design for a List Merging Network</title><source>IEEE Electronic Library (IEL)</source><creator>Hollaar</creator><creatorcontrib>Hollaar</creatorcontrib><description>In inverted file database systems (and in a number of other applications), much of the processing consists of merging two or more previously sorted lists based on a Boolean expression. Conventional general purpose computers are not well suited for this type of operation, with even well written programs utilizing less than 10 percent of the available memory capacity for actual processing of data. However, a low-cost special purpose backend processor can be used to efficiently handle the list merging operations, freeing the conventional processor for other uses.</description><identifier>ISSN: 0018-9340</identifier><identifier>EISSN: 1557-9956</identifier><identifier>DOI: 10.1109/TC.1979.1675380</identifier><identifier>CODEN: ITCOB4</identifier><language>eng</language><publisher>IEEE</publisher><subject>Backend processors ; binary tree networks ; computer system architecture ; inverted file databases ; nonnumeric processing ; pipelined networks ; sorted list merging ; special-purpose LSI processors ; system design</subject><ispartof>IEEE transactions on computers, 1979-06, Vol.C-28 (6), p.406-413</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c259t-617d837d57ecfe0c0cb948dfd9164d14728a2bdf8fb7fcc1d8923f44224547983</citedby><cites>FETCH-LOGICAL-c259t-617d837d57ecfe0c0cb948dfd9164d14728a2bdf8fb7fcc1d8923f44224547983</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/1675380$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>314,780,784,796,27923,27924,54757</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1675380$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Hollaar</creatorcontrib><title>A Design for a List Merging Network</title><title>IEEE transactions on computers</title><addtitle>TC</addtitle><description>In inverted file database systems (and in a number of other applications), much of the processing consists of merging two or more previously sorted lists based on a Boolean expression. Conventional general purpose computers are not well suited for this type of operation, with even well written programs utilizing less than 10 percent of the available memory capacity for actual processing of data. However, a low-cost special purpose backend processor can be used to efficiently handle the list merging operations, freeing the conventional processor for other uses.</description><subject>Backend processors</subject><subject>binary tree networks</subject><subject>computer system architecture</subject><subject>inverted file databases</subject><subject>nonnumeric processing</subject><subject>pipelined networks</subject><subject>sorted list merging</subject><subject>special-purpose LSI processors</subject><subject>system design</subject><issn>0018-9340</issn><issn>1557-9956</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1979</creationdate><recordtype>article</recordtype><recordid>eNpFj0tLxDAUhYMoOI6uXbgpuG7n3jRpcpdDfULVTV2HNo9SH1NJCuK_12EKrs7inO_Ax9glQoEItGnrAklRgZWSpYYjtkIpVU4kq2O2AkCdUynglJ2l9AYAFQdasettduPTOOyyMMWsy5oxzdmTj8O4G7JnP39P8f2cnYTuI_mLJdfs9e62rR_y5uX-sd42ueWS5rxC5XSpnFTeBg8WbE9Cu-AIK-FQKK473rugQ6-Cteg08TIIwbmQQpEu12xz-LVxSin6YL7i-NnFH4Ng9o6mrc3e0SyOf8TVgRi99__rpf0FJV5LFg</recordid><startdate>197906</startdate><enddate>197906</enddate><creator>Hollaar</creator><general>IEEE</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>197906</creationdate><title>A Design for a List Merging Network</title><author>Hollaar</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c259t-617d837d57ecfe0c0cb948dfd9164d14728a2bdf8fb7fcc1d8923f44224547983</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1979</creationdate><topic>Backend processors</topic><topic>binary tree networks</topic><topic>computer system architecture</topic><topic>inverted file databases</topic><topic>nonnumeric processing</topic><topic>pipelined networks</topic><topic>sorted list merging</topic><topic>special-purpose LSI processors</topic><topic>system design</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Hollaar</creatorcontrib><collection>CrossRef</collection><jtitle>IEEE transactions on computers</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Hollaar</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Design for a List Merging Network</atitle><jtitle>IEEE transactions on computers</jtitle><stitle>TC</stitle><date>1979-06</date><risdate>1979</risdate><volume>C-28</volume><issue>6</issue><spage>406</spage><epage>413</epage><pages>406-413</pages><issn>0018-9340</issn><eissn>1557-9956</eissn><coden>ITCOB4</coden><abstract>In inverted file database systems (and in a number of other applications), much of the processing consists of merging two or more previously sorted lists based on a Boolean expression. Conventional general purpose computers are not well suited for this type of operation, with even well written programs utilizing less than 10 percent of the available memory capacity for actual processing of data. However, a low-cost special purpose backend processor can be used to efficiently handle the list merging operations, freeing the conventional processor for other uses.</abstract><pub>IEEE</pub><doi>10.1109/TC.1979.1675380</doi><tpages>8</tpages></addata></record>
fulltext	fulltext_linktorsrc
identifier	ISSN: 0018-9340
ispartof	IEEE transactions on computers, 1979-06, Vol.C-28 (6), p.406-413
issn	0018-9340 1557-9956
language	eng
recordid	cdi_ieee_primary_1675380
source	IEEE Electronic Library (IEL)
subjects	Backend processors binary tree networks computer system architecture inverted file databases nonnumeric processing pipelined networks sorted list merging special-purpose LSI processors system design
title	A Design for a List Merging Network
url	https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-11T10%3A53%3A13IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Design%20for%20a%20List%20Merging%20Network&rft.jtitle=IEEE%20transactions%20on%20computers&rft.au=Hollaar&rft.date=1979-06&rft.volume=C-28&rft.issue=6&rft.spage=406&rft.epage=413&rft.pages=406-413&rft.issn=0018-9340&rft.eissn=1557-9956&rft.coden=ITCOB4&rft_id=info:doi/10.1109/TC.1979.1675380&rft_dat=%3Ccrossref_RIE%3E10_1109_TC_1979_1675380%3C/crossref_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1675380&rfr_iscdi=true