Induced Sorting Suffixes in External Memory
We present in this article an external memory algorithm, called disk SA-IS (DSA-IS), to exactly emulate the induced sorting algorithm SA-IS previously proposed for sorting suffixes in RAM. DSA-IS is a new disk-friendly method for sequentially retrieving the preceding character of a sorted suffix to...
Ausführliche Beschreibung
Gespeichert in:
| Autor*in: |
Nong, Ge [verfasserIn] |
|---|
| Format: |
Artikel |
|---|---|
| Sprache: |
Englisch |
| Erschienen: |
2015 |
|---|
| Rechteinformationen: |
Nutzungsrecht: © COPYRIGHT 2015 Association for Computing Machinery, Inc. |
|---|
| Schlagwörter: |
|---|
| Übergeordnetes Werk: |
Enthalten in: ACM transactions on information systems - New York, NY : ACM, 1983, 33(2015), 3, Seite 1-15 |
|---|---|
| Übergeordnetes Werk: |
volume:33 ; year:2015 ; number:3 ; pages:1-15 |
| Links: |
|---|
| DOI / URN: |
10.1145/2699665 |
|---|
| Katalog-ID: |
OLC1956556753 |
|---|
| LEADER | 01000caa a2200265 4500 | ||
|---|---|---|---|
| 001 | OLC1956556753 | ||
| 003 | DE-627 | ||
| 005 | 20220214203138.0 | ||
| 007 | tu | ||
| 008 | 160206s2015 xx ||||| 00| ||eng c | ||
| 024 | 7 | |a 10.1145/2699665 |2 doi | |
| 028 | 5 | 2 | |a PQ20160617 |
| 035 | |a (DE-627)OLC1956556753 | ||
| 035 | |a (DE-599)GBVOLC1956556753 | ||
| 035 | |a (PRQ)c1443-657af0f3704f5f2075bc42294582b7ad328c77ccfcdb5bc6470558b83d3b3a9d0 | ||
| 035 | |a (KEY)0121159520150000033000300001inducedsortingsuffixesinexternalmemory | ||
| 040 | |a DE-627 |b ger |c DE-627 |e rakwb | ||
| 041 | |a eng | ||
| 082 | 0 | 4 | |a 004 |q DNB |
| 084 | |a 54.00 |2 bkl | ||
| 100 | 1 | |a Nong, Ge |e verfasserin |4 aut | |
| 245 | 1 | 0 | |a Induced Sorting Suffixes in External Memory |
| 264 | 1 | |c 2015 | |
| 336 | |a Text |b txt |2 rdacontent | ||
| 337 | |a ohne Hilfsmittel zu benutzen |b n |2 rdamedia | ||
| 338 | |a Band |b nc |2 rdacarrier | ||
| 520 | |a We present in this article an external memory algorithm, called disk SA-IS (DSA-IS), to exactly emulate the induced sorting algorithm SA-IS previously proposed for sorting suffixes in RAM. DSA-IS is a new disk-friendly method for sequentially retrieving the preceding character of a sorted suffix to induce the order of the preceding suffix. For a size-n string of a constant or integer alphabet, given the RAM capacity [OMEGA][((nW).sup.0.5]), where W is the size of each I/O buffer that is large enough to amortize the overhead of each access to disk, both the CPU time and peak disk use of DSA-IS are 0(n). Our experimental study shows that on average, DSA-IS achieves the best time and space results of all of the existing external memory algorithms based on the induced sorting principle. | ||
| 540 | |a Nutzungsrecht: © COPYRIGHT 2015 Association for Computing Machinery, Inc. | ||
| 650 | 4 | |a Methods | |
| 650 | 4 | |a Memory management | |
| 650 | 4 | |a Memory partitioning | |
| 650 | 4 | |a Memory protection | |
| 650 | 4 | |a Algorithms | |
| 650 | 4 | |a Random access memory | |
| 650 | 4 | |a Memory compaction | |
| 650 | 4 | |a Engineering research | |
| 650 | 4 | |a Usage | |
| 650 | 4 | |a Information storage and retrieval | |
| 650 | 4 | |a Memory refresh (Computers) | |
| 650 | 4 | |a Memory mapping | |
| 650 | 4 | |a Research | |
| 700 | 1 | |a Chan, Wai Hong |4 oth | |
| 700 | 1 | |a Hu, Sheng Qing |4 oth | |
| 700 | 1 | |a Wu, Yi |4 oth | |
| 773 | 0 | 8 | |i Enthalten in |t ACM transactions on information systems |d New York, NY : ACM, 1983 |g 33(2015), 3, Seite 1-15 |w (DE-627)13039582X |w (DE-600)602352-6 |w (DE-576)015897974 |x 0734-2047 |7 nnns |
| 773 | 1 | 8 | |g volume:33 |g year:2015 |g number:3 |g pages:1-15 |
| 856 | 4 | 1 | |u http://dx.doi.org/10.1145/2699665 |3 Volltext |
| 912 | |a GBV_USEFLAG_A | ||
| 912 | |a SYSFLAG_A | ||
| 912 | |a GBV_OLC | ||
| 912 | |a SSG-OLC-MAT | ||
| 912 | |a SSG-OLC-BUB | ||
| 912 | |a SSG-OPC-BBI | ||
| 912 | |a GBV_ILN_70 | ||
| 912 | |a GBV_ILN_2021 | ||
| 912 | |a GBV_ILN_2190 | ||
| 912 | |a GBV_ILN_4125 | ||
| 912 | |a GBV_ILN_4317 | ||
| 936 | b | k | |a 54.00 |q AVZ |
| 951 | |a AR | ||
| 952 | |d 33 |j 2015 |e 3 |h 1-15 | ||
| author_variant |
g n gn |
|---|---|
| matchkey_str |
article:07342047:2015----::nuesrigufxsnx |
| hierarchy_sort_str |
2015 |
| bklnumber |
54.00 |
| publishDate |
2015 |
| allfields |
10.1145/2699665 doi PQ20160617 (DE-627)OLC1956556753 (DE-599)GBVOLC1956556753 (PRQ)c1443-657af0f3704f5f2075bc42294582b7ad328c77ccfcdb5bc6470558b83d3b3a9d0 (KEY)0121159520150000033000300001inducedsortingsuffixesinexternalmemory DE-627 ger DE-627 rakwb eng 004 DNB 54.00 bkl Nong, Ge verfasserin aut Induced Sorting Suffixes in External Memory 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier We present in this article an external memory algorithm, called disk SA-IS (DSA-IS), to exactly emulate the induced sorting algorithm SA-IS previously proposed for sorting suffixes in RAM. DSA-IS is a new disk-friendly method for sequentially retrieving the preceding character of a sorted suffix to induce the order of the preceding suffix. For a size-n string of a constant or integer alphabet, given the RAM capacity [OMEGA][((nW).sup.0.5]), where W is the size of each I/O buffer that is large enough to amortize the overhead of each access to disk, both the CPU time and peak disk use of DSA-IS are 0(n). Our experimental study shows that on average, DSA-IS achieves the best time and space results of all of the existing external memory algorithms based on the induced sorting principle. Nutzungsrecht: © COPYRIGHT 2015 Association for Computing Machinery, Inc. Methods Memory management Memory partitioning Memory protection Algorithms Random access memory Memory compaction Engineering research Usage Information storage and retrieval Memory refresh (Computers) Memory mapping Research Chan, Wai Hong oth Hu, Sheng Qing oth Wu, Yi oth Enthalten in ACM transactions on information systems New York, NY : ACM, 1983 33(2015), 3, Seite 1-15 (DE-627)13039582X (DE-600)602352-6 (DE-576)015897974 0734-2047 nnns volume:33 year:2015 number:3 pages:1-15 http://dx.doi.org/10.1145/2699665 Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_70 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_4125 GBV_ILN_4317 54.00 AVZ AR 33 2015 3 1-15 |
| spelling |
10.1145/2699665 doi PQ20160617 (DE-627)OLC1956556753 (DE-599)GBVOLC1956556753 (PRQ)c1443-657af0f3704f5f2075bc42294582b7ad328c77ccfcdb5bc6470558b83d3b3a9d0 (KEY)0121159520150000033000300001inducedsortingsuffixesinexternalmemory DE-627 ger DE-627 rakwb eng 004 DNB 54.00 bkl Nong, Ge verfasserin aut Induced Sorting Suffixes in External Memory 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier We present in this article an external memory algorithm, called disk SA-IS (DSA-IS), to exactly emulate the induced sorting algorithm SA-IS previously proposed for sorting suffixes in RAM. DSA-IS is a new disk-friendly method for sequentially retrieving the preceding character of a sorted suffix to induce the order of the preceding suffix. For a size-n string of a constant or integer alphabet, given the RAM capacity [OMEGA][((nW).sup.0.5]), where W is the size of each I/O buffer that is large enough to amortize the overhead of each access to disk, both the CPU time and peak disk use of DSA-IS are 0(n). Our experimental study shows that on average, DSA-IS achieves the best time and space results of all of the existing external memory algorithms based on the induced sorting principle. Nutzungsrecht: © COPYRIGHT 2015 Association for Computing Machinery, Inc. Methods Memory management Memory partitioning Memory protection Algorithms Random access memory Memory compaction Engineering research Usage Information storage and retrieval Memory refresh (Computers) Memory mapping Research Chan, Wai Hong oth Hu, Sheng Qing oth Wu, Yi oth Enthalten in ACM transactions on information systems New York, NY : ACM, 1983 33(2015), 3, Seite 1-15 (DE-627)13039582X (DE-600)602352-6 (DE-576)015897974 0734-2047 nnns volume:33 year:2015 number:3 pages:1-15 http://dx.doi.org/10.1145/2699665 Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_70 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_4125 GBV_ILN_4317 54.00 AVZ AR 33 2015 3 1-15 |
| allfields_unstemmed |
10.1145/2699665 doi PQ20160617 (DE-627)OLC1956556753 (DE-599)GBVOLC1956556753 (PRQ)c1443-657af0f3704f5f2075bc42294582b7ad328c77ccfcdb5bc6470558b83d3b3a9d0 (KEY)0121159520150000033000300001inducedsortingsuffixesinexternalmemory DE-627 ger DE-627 rakwb eng 004 DNB 54.00 bkl Nong, Ge verfasserin aut Induced Sorting Suffixes in External Memory 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier We present in this article an external memory algorithm, called disk SA-IS (DSA-IS), to exactly emulate the induced sorting algorithm SA-IS previously proposed for sorting suffixes in RAM. DSA-IS is a new disk-friendly method for sequentially retrieving the preceding character of a sorted suffix to induce the order of the preceding suffix. For a size-n string of a constant or integer alphabet, given the RAM capacity [OMEGA][((nW).sup.0.5]), where W is the size of each I/O buffer that is large enough to amortize the overhead of each access to disk, both the CPU time and peak disk use of DSA-IS are 0(n). Our experimental study shows that on average, DSA-IS achieves the best time and space results of all of the existing external memory algorithms based on the induced sorting principle. Nutzungsrecht: © COPYRIGHT 2015 Association for Computing Machinery, Inc. Methods Memory management Memory partitioning Memory protection Algorithms Random access memory Memory compaction Engineering research Usage Information storage and retrieval Memory refresh (Computers) Memory mapping Research Chan, Wai Hong oth Hu, Sheng Qing oth Wu, Yi oth Enthalten in ACM transactions on information systems New York, NY : ACM, 1983 33(2015), 3, Seite 1-15 (DE-627)13039582X (DE-600)602352-6 (DE-576)015897974 0734-2047 nnns volume:33 year:2015 number:3 pages:1-15 http://dx.doi.org/10.1145/2699665 Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_70 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_4125 GBV_ILN_4317 54.00 AVZ AR 33 2015 3 1-15 |
| allfieldsGer |
10.1145/2699665 doi PQ20160617 (DE-627)OLC1956556753 (DE-599)GBVOLC1956556753 (PRQ)c1443-657af0f3704f5f2075bc42294582b7ad328c77ccfcdb5bc6470558b83d3b3a9d0 (KEY)0121159520150000033000300001inducedsortingsuffixesinexternalmemory DE-627 ger DE-627 rakwb eng 004 DNB 54.00 bkl Nong, Ge verfasserin aut Induced Sorting Suffixes in External Memory 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier We present in this article an external memory algorithm, called disk SA-IS (DSA-IS), to exactly emulate the induced sorting algorithm SA-IS previously proposed for sorting suffixes in RAM. DSA-IS is a new disk-friendly method for sequentially retrieving the preceding character of a sorted suffix to induce the order of the preceding suffix. For a size-n string of a constant or integer alphabet, given the RAM capacity [OMEGA][((nW).sup.0.5]), where W is the size of each I/O buffer that is large enough to amortize the overhead of each access to disk, both the CPU time and peak disk use of DSA-IS are 0(n). Our experimental study shows that on average, DSA-IS achieves the best time and space results of all of the existing external memory algorithms based on the induced sorting principle. Nutzungsrecht: © COPYRIGHT 2015 Association for Computing Machinery, Inc. Methods Memory management Memory partitioning Memory protection Algorithms Random access memory Memory compaction Engineering research Usage Information storage and retrieval Memory refresh (Computers) Memory mapping Research Chan, Wai Hong oth Hu, Sheng Qing oth Wu, Yi oth Enthalten in ACM transactions on information systems New York, NY : ACM, 1983 33(2015), 3, Seite 1-15 (DE-627)13039582X (DE-600)602352-6 (DE-576)015897974 0734-2047 nnns volume:33 year:2015 number:3 pages:1-15 http://dx.doi.org/10.1145/2699665 Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_70 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_4125 GBV_ILN_4317 54.00 AVZ AR 33 2015 3 1-15 |
| allfieldsSound |
10.1145/2699665 doi PQ20160617 (DE-627)OLC1956556753 (DE-599)GBVOLC1956556753 (PRQ)c1443-657af0f3704f5f2075bc42294582b7ad328c77ccfcdb5bc6470558b83d3b3a9d0 (KEY)0121159520150000033000300001inducedsortingsuffixesinexternalmemory DE-627 ger DE-627 rakwb eng 004 DNB 54.00 bkl Nong, Ge verfasserin aut Induced Sorting Suffixes in External Memory 2015 Text txt rdacontent ohne Hilfsmittel zu benutzen n rdamedia Band nc rdacarrier We present in this article an external memory algorithm, called disk SA-IS (DSA-IS), to exactly emulate the induced sorting algorithm SA-IS previously proposed for sorting suffixes in RAM. DSA-IS is a new disk-friendly method for sequentially retrieving the preceding character of a sorted suffix to induce the order of the preceding suffix. For a size-n string of a constant or integer alphabet, given the RAM capacity [OMEGA][((nW).sup.0.5]), where W is the size of each I/O buffer that is large enough to amortize the overhead of each access to disk, both the CPU time and peak disk use of DSA-IS are 0(n). Our experimental study shows that on average, DSA-IS achieves the best time and space results of all of the existing external memory algorithms based on the induced sorting principle. Nutzungsrecht: © COPYRIGHT 2015 Association for Computing Machinery, Inc. Methods Memory management Memory partitioning Memory protection Algorithms Random access memory Memory compaction Engineering research Usage Information storage and retrieval Memory refresh (Computers) Memory mapping Research Chan, Wai Hong oth Hu, Sheng Qing oth Wu, Yi oth Enthalten in ACM transactions on information systems New York, NY : ACM, 1983 33(2015), 3, Seite 1-15 (DE-627)13039582X (DE-600)602352-6 (DE-576)015897974 0734-2047 nnns volume:33 year:2015 number:3 pages:1-15 http://dx.doi.org/10.1145/2699665 Volltext GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_70 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_4125 GBV_ILN_4317 54.00 AVZ AR 33 2015 3 1-15 |
| language |
English |
| source |
Enthalten in ACM transactions on information systems 33(2015), 3, Seite 1-15 volume:33 year:2015 number:3 pages:1-15 |
| sourceStr |
Enthalten in ACM transactions on information systems 33(2015), 3, Seite 1-15 volume:33 year:2015 number:3 pages:1-15 |
| format_phy_str_mv |
Article |
| institution |
findex.gbv.de |
| topic_facet |
Methods Memory management Memory partitioning Memory protection Algorithms Random access memory Memory compaction Engineering research Usage Information storage and retrieval Memory refresh (Computers) Memory mapping Research |
| dewey-raw |
004 |
| isfreeaccess_bool |
false |
| container_title |
ACM transactions on information systems |
| authorswithroles_txt_mv |
Nong, Ge @@aut@@ Chan, Wai Hong @@oth@@ Hu, Sheng Qing @@oth@@ Wu, Yi @@oth@@ |
| publishDateDaySort_date |
2015-01-01T00:00:00Z |
| hierarchy_top_id |
13039582X |
| dewey-sort |
14 |
| id |
OLC1956556753 |
| language_de |
englisch |
| fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1956556753</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220214203138.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160206s2015 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1145/2699665</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160617</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1956556753</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1956556753</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c1443-657af0f3704f5f2075bc42294582b7ad328c77ccfcdb5bc6470558b83d3b3a9d0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0121159520150000033000300001inducedsortingsuffixesinexternalmemory</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nong, Ge</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Induced Sorting Suffixes in External Memory</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We present in this article an external memory algorithm, called disk SA-IS (DSA-IS), to exactly emulate the induced sorting algorithm SA-IS previously proposed for sorting suffixes in RAM. DSA-IS is a new disk-friendly method for sequentially retrieving the preceding character of a sorted suffix to induce the order of the preceding suffix. For a size-n string of a constant or integer alphabet, given the RAM capacity [OMEGA][((nW).sup.0.5]), where W is the size of each I/O buffer that is large enough to amortize the overhead of each access to disk, both the CPU time and peak disk use of DSA-IS are 0(n). Our experimental study shows that on average, DSA-IS achieves the best time and space results of all of the existing external memory algorithms based on the induced sorting principle.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © COPYRIGHT 2015 Association for Computing Machinery, Inc.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Methods</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Memory management</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Memory partitioning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Memory protection</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Random access memory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Memory compaction</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Engineering research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Usage</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information storage and retrieval</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Memory refresh (Computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Memory mapping</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Research</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chan, Wai Hong</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hu, Sheng Qing</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wu, Yi</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">ACM transactions on information systems</subfield><subfield code="d">New York, NY : ACM, 1983</subfield><subfield code="g">33(2015), 3, Seite 1-15</subfield><subfield code="w">(DE-627)13039582X</subfield><subfield code="w">(DE-600)602352-6</subfield><subfield code="w">(DE-576)015897974</subfield><subfield code="x">0734-2047</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:33</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:3</subfield><subfield code="g">pages:1-15</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1145/2699665</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-BUB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">33</subfield><subfield code="j">2015</subfield><subfield code="e">3</subfield><subfield code="h">1-15</subfield></datafield></record></collection>
|
| author |
Nong, Ge |
| spellingShingle |
Nong, Ge ddc 004 bkl 54.00 misc Methods misc Memory management misc Memory partitioning misc Memory protection misc Algorithms misc Random access memory misc Memory compaction misc Engineering research misc Usage misc Information storage and retrieval misc Memory refresh (Computers) misc Memory mapping misc Research Induced Sorting Suffixes in External Memory |
| authorStr |
Nong, Ge |
| ppnlink_with_tag_str_mv |
@@773@@(DE-627)13039582X |
| format |
Article |
| dewey-ones |
004 - Data processing & computer science |
| delete_txt_mv |
keep |
| author_role |
aut |
| collection |
OLC |
| remote_str |
false |
| illustrated |
Not Illustrated |
| issn |
0734-2047 |
| topic_title |
004 DNB 54.00 bkl Induced Sorting Suffixes in External Memory Methods Memory management Memory partitioning Memory protection Algorithms Random access memory Memory compaction Engineering research Usage Information storage and retrieval Memory refresh (Computers) Memory mapping Research |
| topic |
ddc 004 bkl 54.00 misc Methods misc Memory management misc Memory partitioning misc Memory protection misc Algorithms misc Random access memory misc Memory compaction misc Engineering research misc Usage misc Information storage and retrieval misc Memory refresh (Computers) misc Memory mapping misc Research |
| topic_unstemmed |
ddc 004 bkl 54.00 misc Methods misc Memory management misc Memory partitioning misc Memory protection misc Algorithms misc Random access memory misc Memory compaction misc Engineering research misc Usage misc Information storage and retrieval misc Memory refresh (Computers) misc Memory mapping misc Research |
| topic_browse |
ddc 004 bkl 54.00 misc Methods misc Memory management misc Memory partitioning misc Memory protection misc Algorithms misc Random access memory misc Memory compaction misc Engineering research misc Usage misc Information storage and retrieval misc Memory refresh (Computers) misc Memory mapping misc Research |
| format_facet |
Aufsätze Gedruckte Aufsätze |
| format_main_str_mv |
Text Zeitschrift/Artikel |
| carriertype_str_mv |
nc |
| author2_variant |
w h c wh whc s q h sq sqh y w yw |
| hierarchy_parent_title |
ACM transactions on information systems |
| hierarchy_parent_id |
13039582X |
| dewey-tens |
000 - Computer science, knowledge & systems |
| hierarchy_top_title |
ACM transactions on information systems |
| isfreeaccess_txt |
false |
| familylinks_str_mv |
(DE-627)13039582X (DE-600)602352-6 (DE-576)015897974 |
| title |
Induced Sorting Suffixes in External Memory |
| ctrlnum |
(DE-627)OLC1956556753 (DE-599)GBVOLC1956556753 (PRQ)c1443-657af0f3704f5f2075bc42294582b7ad328c77ccfcdb5bc6470558b83d3b3a9d0 (KEY)0121159520150000033000300001inducedsortingsuffixesinexternalmemory |
| title_full |
Induced Sorting Suffixes in External Memory |
| author_sort |
Nong, Ge |
| journal |
ACM transactions on information systems |
| journalStr |
ACM transactions on information systems |
| lang_code |
eng |
| isOA_bool |
false |
| dewey-hundreds |
000 - Computer science, information & general works |
| recordtype |
marc |
| publishDateSort |
2015 |
| contenttype_str_mv |
txt |
| container_start_page |
1 |
| author_browse |
Nong, Ge |
| container_volume |
33 |
| class |
004 DNB 54.00 bkl |
| format_se |
Aufsätze |
| author-letter |
Nong, Ge |
| doi_str_mv |
10.1145/2699665 |
| dewey-full |
004 |
| title_sort |
induced sorting suffixes in external memory |
| title_auth |
Induced Sorting Suffixes in External Memory |
| abstract |
We present in this article an external memory algorithm, called disk SA-IS (DSA-IS), to exactly emulate the induced sorting algorithm SA-IS previously proposed for sorting suffixes in RAM. DSA-IS is a new disk-friendly method for sequentially retrieving the preceding character of a sorted suffix to induce the order of the preceding suffix. For a size-n string of a constant or integer alphabet, given the RAM capacity [OMEGA][((nW).sup.0.5]), where W is the size of each I/O buffer that is large enough to amortize the overhead of each access to disk, both the CPU time and peak disk use of DSA-IS are 0(n). Our experimental study shows that on average, DSA-IS achieves the best time and space results of all of the existing external memory algorithms based on the induced sorting principle. |
| abstractGer |
We present in this article an external memory algorithm, called disk SA-IS (DSA-IS), to exactly emulate the induced sorting algorithm SA-IS previously proposed for sorting suffixes in RAM. DSA-IS is a new disk-friendly method for sequentially retrieving the preceding character of a sorted suffix to induce the order of the preceding suffix. For a size-n string of a constant or integer alphabet, given the RAM capacity [OMEGA][((nW).sup.0.5]), where W is the size of each I/O buffer that is large enough to amortize the overhead of each access to disk, both the CPU time and peak disk use of DSA-IS are 0(n). Our experimental study shows that on average, DSA-IS achieves the best time and space results of all of the existing external memory algorithms based on the induced sorting principle. |
| abstract_unstemmed |
We present in this article an external memory algorithm, called disk SA-IS (DSA-IS), to exactly emulate the induced sorting algorithm SA-IS previously proposed for sorting suffixes in RAM. DSA-IS is a new disk-friendly method for sequentially retrieving the preceding character of a sorted suffix to induce the order of the preceding suffix. For a size-n string of a constant or integer alphabet, given the RAM capacity [OMEGA][((nW).sup.0.5]), where W is the size of each I/O buffer that is large enough to amortize the overhead of each access to disk, both the CPU time and peak disk use of DSA-IS are 0(n). Our experimental study shows that on average, DSA-IS achieves the best time and space results of all of the existing external memory algorithms based on the induced sorting principle. |
| collection_details |
GBV_USEFLAG_A SYSFLAG_A GBV_OLC SSG-OLC-MAT SSG-OLC-BUB SSG-OPC-BBI GBV_ILN_70 GBV_ILN_2021 GBV_ILN_2190 GBV_ILN_4125 GBV_ILN_4317 |
| container_issue |
3 |
| title_short |
Induced Sorting Suffixes in External Memory |
| url |
http://dx.doi.org/10.1145/2699665 |
| remote_bool |
false |
| author2 |
Chan, Wai Hong Hu, Sheng Qing Wu, Yi |
| author2Str |
Chan, Wai Hong Hu, Sheng Qing Wu, Yi |
| ppnlink |
13039582X |
| mediatype_str_mv |
n |
| isOA_txt |
false |
| hochschulschrift_bool |
false |
| author2_role |
oth oth oth |
| doi_str |
10.1145/2699665 |
| up_date |
2024-07-03T21:01:55.623Z |
| _version_ |
1803593203710951424 |
| fullrecord_marcxml |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a2200265 4500</leader><controlfield tag="001">OLC1956556753</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20220214203138.0</controlfield><controlfield tag="007">tu</controlfield><controlfield tag="008">160206s2015 xx ||||| 00| ||eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1145/2699665</subfield><subfield code="2">doi</subfield></datafield><datafield tag="028" ind1="5" ind2="2"><subfield code="a">PQ20160617</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)OLC1956556753</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)GBVOLC1956556753</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(PRQ)c1443-657af0f3704f5f2075bc42294582b7ad328c77ccfcdb5bc6470558b83d3b3a9d0</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(KEY)0121159520150000033000300001inducedsortingsuffixesinexternalmemory</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="082" ind1="0" ind2="4"><subfield code="a">004</subfield><subfield code="q">DNB</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">54.00</subfield><subfield code="2">bkl</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Nong, Ge</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Induced Sorting Suffixes in External Memory</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2015</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">ohne Hilfsmittel zu benutzen</subfield><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Band</subfield><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">We present in this article an external memory algorithm, called disk SA-IS (DSA-IS), to exactly emulate the induced sorting algorithm SA-IS previously proposed for sorting suffixes in RAM. DSA-IS is a new disk-friendly method for sequentially retrieving the preceding character of a sorted suffix to induce the order of the preceding suffix. For a size-n string of a constant or integer alphabet, given the RAM capacity [OMEGA][((nW).sup.0.5]), where W is the size of each I/O buffer that is large enough to amortize the overhead of each access to disk, both the CPU time and peak disk use of DSA-IS are 0(n). Our experimental study shows that on average, DSA-IS achieves the best time and space results of all of the existing external memory algorithms based on the induced sorting principle.</subfield></datafield><datafield tag="540" ind1=" " ind2=" "><subfield code="a">Nutzungsrecht: © COPYRIGHT 2015 Association for Computing Machinery, Inc.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Methods</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Memory management</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Memory partitioning</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Memory protection</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Algorithms</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Random access memory</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Memory compaction</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Engineering research</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Usage</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Information storage and retrieval</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Memory refresh (Computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Memory mapping</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Research</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Chan, Wai Hong</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Hu, Sheng Qing</subfield><subfield code="4">oth</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Wu, Yi</subfield><subfield code="4">oth</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">Enthalten in</subfield><subfield code="t">ACM transactions on information systems</subfield><subfield code="d">New York, NY : ACM, 1983</subfield><subfield code="g">33(2015), 3, Seite 1-15</subfield><subfield code="w">(DE-627)13039582X</subfield><subfield code="w">(DE-600)602352-6</subfield><subfield code="w">(DE-576)015897974</subfield><subfield code="x">0734-2047</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:33</subfield><subfield code="g">year:2015</subfield><subfield code="g">number:3</subfield><subfield code="g">pages:1-15</subfield></datafield><datafield tag="856" ind1="4" ind2="1"><subfield code="u">http://dx.doi.org/10.1145/2699665</subfield><subfield code="3">Volltext</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_OLC</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-MAT</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OLC-BUB</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SSG-OPC-BBI</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2021</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2190</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4317</subfield></datafield><datafield tag="936" ind1="b" ind2="k"><subfield code="a">54.00</subfield><subfield code="q">AVZ</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">33</subfield><subfield code="j">2015</subfield><subfield code="e">3</subfield><subfield code="h">1-15</subfield></datafield></record></collection>
|
| score |
7.402793 |