SPACE-EFFICIENT PREPROCESSING SCHEMES FOR RANGE MINIMUM QUERIES ON STATIC ARRAYS

Given a static array of n totally ordered objects, the range minimum query problem is to build a data structure that allows to answer efficiently subsequent on-line queries of the form of the position of a minimum element in the subarray ranging from i to j. The authors focus on two settings, where...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:SIAM journal on computing 2011-01, Vol.40 (2), p.465-492
Hauptverfasser: FISCHER, Johannes, HEUN, Volker
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 492
container_issue 2
container_start_page 465
container_title SIAM journal on computing
container_volume 40
creator FISCHER, Johannes
HEUN, Volker
description Given a static array of n totally ordered objects, the range minimum query problem is to build a data structure that allows to answer efficiently subsequent on-line queries of the form of the position of a minimum element in the subarray ranging from i to j. The authors focus on two settings, where (1) the input array is available at query time, and (2) the input array is available only at construction time. In setting (1), the authors show new data structures (a) of size ... bits and query time O(c(n)) for any positive integer function ... for an arbitrary constant 0 < ε < 1, or (b) with O(nH(k)) + o(n) bits and O(1) query time, where H(k) denotes the empirical entropy of kth order of the input array. In setting (2), the authors give a data structure of size 2n+o(n) bits and query time O(1). All data structures can be constructed in linear time and almost in-place. (ProQuest: ... denotes formulae/symbols omitted.)
doi_str_mv 10.1137/090779759
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_907969684</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2410930571</sourcerecordid><originalsourceid>FETCH-LOGICAL-c384t-abd31a2232ad539b1a28a485419db9567b118de06468a62fe53c5cb431053e593</originalsourceid><addsrcrecordid>eNpdkMtqwzAQRUVpoWnaRf_AFErpwq1kSZa0NEZOBPGjtrPoysgvSHAetZJF_74KCVl0NQNz5nI5ADwj-IEQZp9QQMYEo-IGTBAU1GUIoVswgVAwl2LB7sGDMWsIESEIT0BWZEEoXRlFKlQyKZ0sl1mehrIoVDJzinAuY1k4UZo7eZDMpBOrRMXL2PlaylzZS5o4RRmUKnSCPA--i0dw1-vBdE-XOQXLSJbh3F2kMxUGC7fBnBxcXbcYac_Dnm5trdruXBNOCRJtLajPaoR420Gf-Fz7Xt9R3NCmJhhBijsq8BS8nXP34-7n2JlDtVmZphsGve12R1NZD8IXPieWfPlHrnfHcWvLVdyqEh71T9D7GWrGnTFj11f7cbXR42-FYHUyW13NWvb1EqhNo4d-1NtmZa4PHvGo4L7Af7jJbjg</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>879792564</pqid></control><display><type>article</type><title>SPACE-EFFICIENT PREPROCESSING SCHEMES FOR RANGE MINIMUM QUERIES ON STATIC ARRAYS</title><source>SIAM Journals Online</source><source>Business Source Complete</source><creator>FISCHER, Johannes ; HEUN, Volker</creator><creatorcontrib>FISCHER, Johannes ; HEUN, Volker</creatorcontrib><description>Given a static array of n totally ordered objects, the range minimum query problem is to build a data structure that allows to answer efficiently subsequent on-line queries of the form of the position of a minimum element in the subarray ranging from i to j. The authors focus on two settings, where (1) the input array is available at query time, and (2) the input array is available only at construction time. In setting (1), the authors show new data structures (a) of size ... bits and query time O(c(n)) for any positive integer function ... for an arbitrary constant 0 &lt; ε &lt; 1, or (b) with O(nH(k)) + o(n) bits and O(1) query time, where H(k) denotes the empirical entropy of kth order of the input array. In setting (2), the authors give a data structure of size 2n+o(n) bits and query time O(1). All data structures can be constructed in linear time and almost in-place. (ProQuest: ... denotes formulae/symbols omitted.)</description><identifier>ISSN: 0097-5397</identifier><identifier>EISSN: 1095-7111</identifier><identifier>DOI: 10.1137/090779759</identifier><language>eng</language><publisher>Philadelphia, PA: Society for Industrial and Applied Mathematics</publisher><subject>Applied sciences ; Arrays ; Combinatorics ; Combinatorics. Ordered structures ; Computer science; control theory; systems ; Construction ; Data processing. List processing. Character string processing ; Data structures ; Entropy ; Exact sciences and technology ; Graph theory ; Information retrieval ; Mathematical analysis ; Mathematical functions ; Mathematics ; Memory organisation. Data processing ; Miscellaneous ; On-line systems ; Optimization algorithms ; Preprocessing ; Queries ; Sciences and techniques of general use ; Software ; Studies ; Theoretical computing</subject><ispartof>SIAM journal on computing, 2011-01, Vol.40 (2), p.465-492</ispartof><rights>2015 INIST-CNRS</rights><rights>Copyright Society for Industrial and Applied Mathematics 2011</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c384t-abd31a2232ad539b1a28a485419db9567b118de06468a62fe53c5cb431053e593</citedby><cites>FETCH-LOGICAL-c384t-abd31a2232ad539b1a28a485419db9567b118de06468a62fe53c5cb431053e593</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,3171,27901,27902</link.rule.ids><backlink>$$Uhttp://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&amp;idt=24259869$$DView record in Pascal Francis$$Hfree_for_read</backlink></links><search><creatorcontrib>FISCHER, Johannes</creatorcontrib><creatorcontrib>HEUN, Volker</creatorcontrib><title>SPACE-EFFICIENT PREPROCESSING SCHEMES FOR RANGE MINIMUM QUERIES ON STATIC ARRAYS</title><title>SIAM journal on computing</title><description>Given a static array of n totally ordered objects, the range minimum query problem is to build a data structure that allows to answer efficiently subsequent on-line queries of the form of the position of a minimum element in the subarray ranging from i to j. The authors focus on two settings, where (1) the input array is available at query time, and (2) the input array is available only at construction time. In setting (1), the authors show new data structures (a) of size ... bits and query time O(c(n)) for any positive integer function ... for an arbitrary constant 0 &lt; ε &lt; 1, or (b) with O(nH(k)) + o(n) bits and O(1) query time, where H(k) denotes the empirical entropy of kth order of the input array. In setting (2), the authors give a data structure of size 2n+o(n) bits and query time O(1). All data structures can be constructed in linear time and almost in-place. (ProQuest: ... denotes formulae/symbols omitted.)</description><subject>Applied sciences</subject><subject>Arrays</subject><subject>Combinatorics</subject><subject>Combinatorics. Ordered structures</subject><subject>Computer science; control theory; systems</subject><subject>Construction</subject><subject>Data processing. List processing. Character string processing</subject><subject>Data structures</subject><subject>Entropy</subject><subject>Exact sciences and technology</subject><subject>Graph theory</subject><subject>Information retrieval</subject><subject>Mathematical analysis</subject><subject>Mathematical functions</subject><subject>Mathematics</subject><subject>Memory organisation. Data processing</subject><subject>Miscellaneous</subject><subject>On-line systems</subject><subject>Optimization algorithms</subject><subject>Preprocessing</subject><subject>Queries</subject><subject>Sciences and techniques of general use</subject><subject>Software</subject><subject>Studies</subject><subject>Theoretical computing</subject><issn>0097-5397</issn><issn>1095-7111</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2011</creationdate><recordtype>article</recordtype><sourceid>8G5</sourceid><sourceid>BENPR</sourceid><sourceid>GUQSH</sourceid><sourceid>M2O</sourceid><recordid>eNpdkMtqwzAQRUVpoWnaRf_AFErpwq1kSZa0NEZOBPGjtrPoysgvSHAetZJF_74KCVl0NQNz5nI5ADwj-IEQZp9QQMYEo-IGTBAU1GUIoVswgVAwl2LB7sGDMWsIESEIT0BWZEEoXRlFKlQyKZ0sl1mehrIoVDJzinAuY1k4UZo7eZDMpBOrRMXL2PlaylzZS5o4RRmUKnSCPA--i0dw1-vBdE-XOQXLSJbh3F2kMxUGC7fBnBxcXbcYac_Dnm5trdruXBNOCRJtLajPaoR420Gf-Fz7Xt9R3NCmJhhBijsq8BS8nXP34-7n2JlDtVmZphsGve12R1NZD8IXPieWfPlHrnfHcWvLVdyqEh71T9D7GWrGnTFj11f7cbXR42-FYHUyW13NWvb1EqhNo4d-1NtmZa4PHvGo4L7Af7jJbjg</recordid><startdate>20110101</startdate><enddate>20110101</enddate><creator>FISCHER, Johannes</creator><creator>HEUN, Volker</creator><general>Society for Industrial and Applied Mathematics</general><scope>IQODW</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>3V.</scope><scope>7RQ</scope><scope>7WY</scope><scope>7WZ</scope><scope>7X2</scope><scope>7XB</scope><scope>87Z</scope><scope>88A</scope><scope>88F</scope><scope>88I</scope><scope>88K</scope><scope>8AL</scope><scope>8FE</scope><scope>8FG</scope><scope>8FH</scope><scope>8FK</scope><scope>8FL</scope><scope>8G5</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>ATCPS</scope><scope>AZQEC</scope><scope>BBNVY</scope><scope>BENPR</scope><scope>BEZIV</scope><scope>BGLVJ</scope><scope>BHPHI</scope><scope>CCPQU</scope><scope>D1I</scope><scope>DWQXO</scope><scope>FRNLG</scope><scope>F~G</scope><scope>GNUQQ</scope><scope>GUQSH</scope><scope>HCIFZ</scope><scope>JQ2</scope><scope>K60</scope><scope>K6~</scope><scope>K7-</scope><scope>KB.</scope><scope>L.-</scope><scope>L6V</scope><scope>LK8</scope><scope>M0C</scope><scope>M0K</scope><scope>M0N</scope><scope>M1Q</scope><scope>M2O</scope><scope>M2P</scope><scope>M2T</scope><scope>M7P</scope><scope>M7S</scope><scope>MBDVC</scope><scope>P5Z</scope><scope>P62</scope><scope>PATMY</scope><scope>PDBOC</scope><scope>PQBIZ</scope><scope>PQBZA</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>PYCSY</scope><scope>Q9U</scope><scope>S0W</scope><scope>U9A</scope><scope>7SC</scope><scope>8FD</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20110101</creationdate><title>SPACE-EFFICIENT PREPROCESSING SCHEMES FOR RANGE MINIMUM QUERIES ON STATIC ARRAYS</title><author>FISCHER, Johannes ; HEUN, Volker</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c384t-abd31a2232ad539b1a28a485419db9567b118de06468a62fe53c5cb431053e593</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2011</creationdate><topic>Applied sciences</topic><topic>Arrays</topic><topic>Combinatorics</topic><topic>Combinatorics. Ordered structures</topic><topic>Computer science; control theory; systems</topic><topic>Construction</topic><topic>Data processing. List processing. Character string processing</topic><topic>Data structures</topic><topic>Entropy</topic><topic>Exact sciences and technology</topic><topic>Graph theory</topic><topic>Information retrieval</topic><topic>Mathematical analysis</topic><topic>Mathematical functions</topic><topic>Mathematics</topic><topic>Memory organisation. Data processing</topic><topic>Miscellaneous</topic><topic>On-line systems</topic><topic>Optimization algorithms</topic><topic>Preprocessing</topic><topic>Queries</topic><topic>Sciences and techniques of general use</topic><topic>Software</topic><topic>Studies</topic><topic>Theoretical computing</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>FISCHER, Johannes</creatorcontrib><creatorcontrib>HEUN, Volker</creatorcontrib><collection>Pascal-Francis</collection><collection>CrossRef</collection><collection>ProQuest Central (Corporate)</collection><collection>Career &amp; Technical Education Database</collection><collection>ABI/INFORM Collection</collection><collection>ABI/INFORM Global (PDF only)</collection><collection>Agricultural Science Collection</collection><collection>ProQuest Central (purchase pre-March 2016)</collection><collection>ABI/INFORM Global (Alumni Edition)</collection><collection>Biology Database (Alumni Edition)</collection><collection>Military Database (Alumni Edition)</collection><collection>Science Database (Alumni Edition)</collection><collection>Telecommunications (Alumni Edition)</collection><collection>Computing Database (Alumni Edition)</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Natural Science Collection</collection><collection>ProQuest Central (Alumni) (purchase pre-March 2016)</collection><collection>ABI/INFORM Collection (Alumni Edition)</collection><collection>Research Library (Alumni Edition)</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>Agricultural &amp; Environmental Science Collection</collection><collection>ProQuest Central Essentials</collection><collection>Biological Science Collection</collection><collection>ProQuest Central</collection><collection>Business Premium Collection</collection><collection>Technology Collection</collection><collection>Natural Science Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Materials Science Collection</collection><collection>ProQuest Central Korea</collection><collection>Business Premium Collection (Alumni)</collection><collection>ABI/INFORM Global (Corporate)</collection><collection>ProQuest Central Student</collection><collection>Research Library Prep</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Computer Science Collection</collection><collection>ProQuest Business Collection (Alumni Edition)</collection><collection>ProQuest Business Collection</collection><collection>Computer Science Database</collection><collection>Materials Science Database</collection><collection>ABI/INFORM Professional Advanced</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Biological Science Collection</collection><collection>ABI/INFORM Global</collection><collection>Agricultural Science Database</collection><collection>Computing Database</collection><collection>Military Database</collection><collection>Research Library</collection><collection>Science Database</collection><collection>Telecommunications Database</collection><collection>Biological Science Database</collection><collection>Engineering Database</collection><collection>Research Library (Corporate)</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>Environmental Science Database</collection><collection>Materials Science Collection</collection><collection>ProQuest One Business</collection><collection>ProQuest One Business (Alumni)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>Environmental Science Collection</collection><collection>ProQuest Central Basic</collection><collection>DELNET Engineering &amp; Technology Collection</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>SIAM journal on computing</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>FISCHER, Johannes</au><au>HEUN, Volker</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>SPACE-EFFICIENT PREPROCESSING SCHEMES FOR RANGE MINIMUM QUERIES ON STATIC ARRAYS</atitle><jtitle>SIAM journal on computing</jtitle><date>2011-01-01</date><risdate>2011</risdate><volume>40</volume><issue>2</issue><spage>465</spage><epage>492</epage><pages>465-492</pages><issn>0097-5397</issn><eissn>1095-7111</eissn><abstract>Given a static array of n totally ordered objects, the range minimum query problem is to build a data structure that allows to answer efficiently subsequent on-line queries of the form of the position of a minimum element in the subarray ranging from i to j. The authors focus on two settings, where (1) the input array is available at query time, and (2) the input array is available only at construction time. In setting (1), the authors show new data structures (a) of size ... bits and query time O(c(n)) for any positive integer function ... for an arbitrary constant 0 &lt; ε &lt; 1, or (b) with O(nH(k)) + o(n) bits and O(1) query time, where H(k) denotes the empirical entropy of kth order of the input array. In setting (2), the authors give a data structure of size 2n+o(n) bits and query time O(1). All data structures can be constructed in linear time and almost in-place. (ProQuest: ... denotes formulae/symbols omitted.)</abstract><cop>Philadelphia, PA</cop><pub>Society for Industrial and Applied Mathematics</pub><doi>10.1137/090779759</doi><tpages>28</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0097-5397
ispartof SIAM journal on computing, 2011-01, Vol.40 (2), p.465-492
issn 0097-5397
1095-7111
language eng
recordid cdi_proquest_miscellaneous_907969684
source SIAM Journals Online; Business Source Complete
subjects Applied sciences
Arrays
Combinatorics
Combinatorics. Ordered structures
Computer science
control theory
systems
Construction
Data processing. List processing. Character string processing
Data structures
Entropy
Exact sciences and technology
Graph theory
Information retrieval
Mathematical analysis
Mathematical functions
Mathematics
Memory organisation. Data processing
Miscellaneous
On-line systems
Optimization algorithms
Preprocessing
Queries
Sciences and techniques of general use
Software
Studies
Theoretical computing
title SPACE-EFFICIENT PREPROCESSING SCHEMES FOR RANGE MINIMUM QUERIES ON STATIC ARRAYS
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-17T12%3A38%3A59IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=SPACE-EFFICIENT%20PREPROCESSING%20SCHEMES%20FOR%20RANGE%20MINIMUM%20QUERIES%20ON%20STATIC%20ARRAYS&rft.jtitle=SIAM%20journal%20on%20computing&rft.au=FISCHER,%20Johannes&rft.date=2011-01-01&rft.volume=40&rft.issue=2&rft.spage=465&rft.epage=492&rft.pages=465-492&rft.issn=0097-5397&rft.eissn=1095-7111&rft_id=info:doi/10.1137/090779759&rft_dat=%3Cproquest_cross%3E2410930571%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=879792564&rft_id=info:pmid/&rfr_iscdi=true