A compression method of double-array structures using linear functions

A trie is one of the data structures for keyword search algorithms and is utilized in natural language processing, reserved words search for compilers and so on. The double-array and LOUDS are efficient representation methods for the trie. The double-array provides fast traversal at time complexity...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Knowledge and information systems Ročník 48; číslo 1; s. 55 - 80
Hlavní autoři: Kanda, Shunsuke, Fuketa, Masao, Morita, Kazuhiro, Aoe, Jun-ichi
Médium: Journal Article
Jazyk:angličtina
Vydáno: London Springer London 01.07.2016
Springer Nature B.V
Témata:
Algorithms
Analysis
Compilers
Compressing
Computer Science
Data Mining and Knowledge Discovery
Data structures
Database Management
Information retrieval
Information Storage and Retrieval
Information systems
Information Systems and Communication Service
Information Systems Applications (incl.Internet)
IT in Business
Keywords
Morphology
Natural language processing
Regular Paper
Representations
Retrieval
Searches
Searching
Software
Studies
Information retrieval
Double-array
Compression method
Trie
ISSN:0219-1377, 0219-3116
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract A trie is one of the data structures for keyword search algorithms and is utilized in natural language processing, reserved words search for compilers and so on. The double-array and LOUDS are efficient representation methods for the trie. The double-array provides fast traversal at time complexity of O (1), but the space usage of the double-array is larger than that of LOUDS. LOUDS is a succinct data structure with bit-string, and its space usage is extremely compact. However, its traversal speed is not so fast. This paper presents a new compression method of the double-array with keeping the retrieval speed. Our new method compresses the double-array by dividing the double-array into blocks and by using linear functions. Experimental results for varied keywords show that our new method reduced space usage of the double-array up to about 44 %, and the retrieval speed of the new method was 9–14 times faster than that of LOUDS. Moreover, the results show that the construction speed of the new method was faster than that of the conventional method for a large keyword set.
AbstractList A trie is one of the data structures for keyword search algorithms and is utilized in natural language processing, reserved words search for compilers and so on. The double-array and LOUDS are efficient representation methods for the trie. The double-array provides fast traversal at time complexity of O(1), but the space usage of the double-array is larger than that of LOUDS. LOUDS is a succinct data structure with bit-string, and its space usage is extremely compact. However, its traversal speed is not so fast. This paper presents a new compression method of the double-array with keeping the retrieval speed. Our new method compresses the double-array by dividing the double-array into blocks and by using linear functions. Experimental results for varied keywords show that our new method reduced space usage of the double-array up to about 44 %, and the retrieval speed of the new method was 9-14 times faster than that of LOUDS. Moreover, the results show that the construction speed of the new method was faster than that of the conventional method for a large keyword set.
A trie is one of the data structures for keyword search algorithms and is utilized in natural language processing, reserved words search for compilers and so on. The double-array and LOUDS are efficient representation methods for the trie. The double-array provides fast traversal at time complexity of O (1), but the space usage of the double-array is larger than that of LOUDS. LOUDS is a succinct data structure with bit-string, and its space usage is extremely compact. However, its traversal speed is not so fast. This paper presents a new compression method of the double-array with keeping the retrieval speed. Our new method compresses the double-array by dividing the double-array into blocks and by using linear functions. Experimental results for varied keywords show that our new method reduced space usage of the double-array up to about 44 %, and the retrieval speed of the new method was 9–14 times faster than that of LOUDS. Moreover, the results show that the construction speed of the new method was faster than that of the conventional method for a large keyword set.
Author Fuketa, Masao
Aoe, Jun-ichi
Morita, Kazuhiro
Kanda, Shunsuke
Author_xml – sequence: 1
  givenname: Shunsuke
  surname: Kanda
  fullname: Kanda, Shunsuke
  email: shnsk.knd@gmail.com
  organization: Department of Information Science and Intelligent Systems, Tokushima University
– sequence: 2
  givenname: Masao
  surname: Fuketa
  fullname: Fuketa, Masao
  organization: Department of Information Science and Intelligent Systems, Tokushima University
– sequence: 3
  givenname: Kazuhiro
  surname: Morita
  fullname: Morita, Kazuhiro
  organization: Department of Information Science and Intelligent Systems, Tokushima University
– sequence: 4
  givenname: Jun-ichi
  surname: Aoe
  fullname: Aoe, Jun-ichi
  organization: Department of Information Science and Intelligent Systems, Tokushima University
BookMark eNp9kLFOwzAQhi1UJNrCA7BZYmEJ3MVxnIxVRQGpEgvMlpPYJVVqFzse-vYkSgeEBMPpbvi-u9O_IDPrrCbkFuEBAcRjQEDkCYxVCJbABZlDimXCEPPZeUYmxBVZhLAHQJEjzslmRWt3OHodQussPej-0zXUGdq4WHU6Ud6rEw29j3UfB4rG0Nod7Vqrlacm2rofvHBNLo3qgr459yX52Dy9r1-S7dvz63q1TeoMeZ8wxWqtc8GajJumzBsByNJCmEIpk6ksNY02XJVlVQnQqaoUEzkvFTRYVFDmbEnup71H776iDr08tKHWXaesdjFILFLOM8ExHdC7X-jeRW-H7wYKIAchYFyIE1V7F4LXRh59e1D-JBHkmKyckpUw1pCshMERv5y67dWYQ-9V2_1rppMZhit2p_2Pn_6UvgFLRo6_
CODEN KISNCR
CitedBy_id crossref_primary_10_3390_app10155266
crossref_primary_10_3390_app10238530
crossref_primary_10_1007_s10115_016_0999_8
crossref_primary_10_1002_spe_2516
crossref_primary_10_1016_j_simpat_2024_102960
crossref_primary_10_3390_e25101444
crossref_primary_10_1002_spe_3190
Cites_doi 10.1109/69.506713
10.1109/32.31365
10.1002/spe.778
10.1145/360825.360855
10.1145/235809.235810
10.1007/s00453-004-1146-6
10.1145/367390.367400
10.1016/S1570-8667(03)00066-2
10.1016/j.ipm.2014.04.004
10.1002/1097-024X(200101)31:1<43::AID-SPE356>3.0.CO;2-R
10.1137/S0097539799364092
10.1016/j.ipm.2006.04.004
10.1080/17517575.2012.665483
10.1002/spe.4380220902
10.1016/S0020-0255(03)00189-0
10.1109/69.277768
10.1137/1.9781611972900.9
10.1109/SFCS.1989.63533
10.1109/INFCOM.2011.5935151
10.1137/1.9781611973075.13
10.1145/285237.285282
ContentType Journal Article
Copyright Springer-Verlag London 2015
Springer-Verlag London 2016
Copyright_xml – notice: Springer-Verlag London 2015
– notice: Springer-Verlag London 2016
DBID AAYXX
CITATION
3V.
7SC
7WY
7WZ
7XB
87Z
8AL
8AO
8FD
8FE
8FG
8FK
8FL
ABUWG
AFKRA
ARAPS
AZQEC
BENPR
BEZIV
BGLVJ
CCPQU
DWQXO
FRNLG
F~G
GNUQQ
HCIFZ
JQ2
K60
K6~
K7-
L.-
L.0
L7M
L~C
L~D
M0C
M0N
P5Z
P62
PHGZM
PHGZT
PKEHL
PQBIZ
PQBZA
PQEST
PQGLB
PQQKQ
PQUKI
Q9U
DOI 10.1007/s10115-015-0873-0
DatabaseName CrossRef
ProQuest Central (Corporate)
Computer and Information Systems Abstracts
ABI/INFORM Collection
ABI/INFORM Global (PDF only)
ProQuest Central (purchase pre-March 2016)
ABI/INFORM Global (Alumni Edition)
Computing Database (Alumni Edition)
ProQuest Pharma Collection
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
ProQuest Central (Alumni) (purchase pre-March 2016)
ABI/INFORM Collection (Alumni Edition)
ProQuest Central (Alumni Edition)
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials - QC
ProQuest Central
Business Premium Collection
Technology Collection
ProQuest One Community College
ProQuest Central Korea
Business Premium Collection (Alumni)
ABI/INFORM Global (Corporate)
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
ProQuest Business Collection (Alumni Edition)
ProQuest Business Collection
Computer Science Database
ABI/INFORM Professional Advanced
ABI/INFORM Professional Standard
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ABI/INFORM Global
Computing Database
Advanced Technologies & Aerospace Database
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Business
ProQuest One Business (Alumni)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central Basic
DatabaseTitle CrossRef
ABI/INFORM Global (Corporate)
ProQuest Business Collection (Alumni Edition)
ProQuest One Business
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
ProQuest Central (Alumni Edition)
SciTech Premium Collection
ProQuest One Community College
ProQuest Pharma Collection
ABI/INFORM Complete
ProQuest Central
ABI/INFORM Professional Advanced
ProQuest One Applied & Life Sciences
ABI/INFORM Professional Standard
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
ABI/INFORM Complete (Alumni Edition)
Advanced Technologies & Aerospace Collection
Business Premium Collection
ABI/INFORM Global
ProQuest Computing
ABI/INFORM Global (Alumni Edition)
ProQuest Central Basic
ProQuest Computing (Alumni Edition)
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
ProQuest Business Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
ProQuest One Business (Alumni)
ProQuest One Academic
ProQuest Central (Alumni)
ProQuest One Academic (New)
Business Premium Collection (Alumni)
DatabaseTitleList ABI/INFORM Global (Corporate)
Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 0219-3116
EndPage 80
ExternalDocumentID 4105136741
10_1007_s10115_015_0873_0
Genre Feature
GroupedDBID -59
-5G
-BR
-EM
-Y2
-~C
.4S
.86
.DC
.VR
06D
0R~
0VY
1N0
1SB
203
29L
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
3V.
4.4
406
408
409
40D
40E
5GY
5VS
67Z
6KP
6NX
7WY
8AO
8FE
8FG
8FL
8FW
8TC
8UJ
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABUWG
ABWNU
ABXPI
ACAOD
ACBXY
ACGFO
ACGFS
ACHSB
ACHXU
ACKNC
ACMDZ
ACMLO
ACOKC
ACOMO
ACPIV
ACREN
ACSNA
ACZOJ
ADHHG
ADHIR
ADINQ
ADKNI
ADKPE
ADMLS
ADRFC
ADTPH
ADURQ
ADYFF
ADYOE
ADZKW
AEBTG
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFYQB
AFZKB
AGAYW
AGDGC
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMTXH
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARCSS
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
AZQEC
B-.
BA0
BDATZ
BENPR
BEZIV
BGLVJ
BGNMA
BPHCQ
BSONS
CAG
CCPQU
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
DWQXO
EBLON
EBS
EDO
EIOEI
EJD
ESBYG
F5P
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRNLG
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNUQQ
GNWQR
GQ6
GQ7
GQ8
GROUPED_ABI_INFORM_COMPLETE
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I-F
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IXE
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K60
K6V
K6~
K7-
KDC
KOV
LAS
LLZTM
M0C
M0N
M4Y
MA-
MK~
ML~
N2Q
NB0
NPVJJ
NQJWS
NU0
O9-
O93
O9J
OAM
P2P
P62
P9O
PF0
PQBIZ
PQBZA
PQQKQ
PROAC
PT4
PT5
Q2X
QOS
R89
R9I
RIG
ROL
RPX
RSV
S16
S1Z
S27
S3B
SAP
SCO
SDH
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
TSG
TSK
TSV
TUC
TUS
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
W23
W48
WK8
YLTOR
Z45
Z5O
Z7R
Z7S
Z7X
Z7Y
Z7Z
Z81
Z83
Z88
ZMTXR
~A9
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
7SC
7XB
8AL
8FD
8FK
JQ2
L.-
L.0
L7M
L~C
L~D
PKEHL
PQEST
PQUKI
Q9U
PUEGO
ID FETCH-LOGICAL-c415t-3a3cee673d45fd96d7013287f8aaf4a42fdef5a99bb70e2aba37659a0d18b0963
IEDL.DBID K7-
ISICitedReferencesCount 7
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000379185700003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0219-1377
IngestDate Fri Sep 05 08:27:09 EDT 2025
Sat Nov 08 14:36:25 EST 2025
Tue Nov 18 22:24:31 EST 2025
Sat Nov 29 02:29:20 EST 2025
Fri Feb 21 02:36:16 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Keywords Information retrieval
Double-array
Compression method
Trie
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c415t-3a3cee673d45fd96d7013287f8aaf4a42fdef5a99bb70e2aba37659a0d18b0963
Notes SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
PQID 1800607706
PQPubID 43394
PageCount 26
ParticipantIDs proquest_miscellaneous_1825547512
proquest_journals_1800607706
crossref_primary_10_1007_s10115_015_0873_0
crossref_citationtrail_10_1007_s10115_015_0873_0
springer_journals_10_1007_s10115_015_0873_0
PublicationCentury 2000
PublicationDate 2016-07-01
PublicationDateYYYYMMDD 2016-07-01
PublicationDate_xml – month: 07
  year: 2016
  text: 2016-07-01
  day: 01
PublicationDecade 2010
PublicationPlace London
PublicationPlace_xml – name: London
PublicationSubtitle An International Journal
PublicationTitle Knowledge and information systems
PublicationTitleAbbrev Knowl Inf Syst
PublicationYear 2016
Publisher Springer London
Springer Nature B.V
Publisher_xml – name: Springer London
– name: Springer Nature B.V
References Aoe (CR3) 1989; 15
Fuketa, Kitagawa, Ogawa (CR13) 2014; 50
Yata, Oono, Morita (CR26) 2007; 37
Aoe, Morimoto, Shishibori (CR5) 1996; 8
Yang, Xu, Shi (CR25) 2012; 6
Morita, Fuketa, Yamakawa (CR18) 2001; 31
Munro, Raman (CR20) 2001; 31
CR17
Aho, Corasick (CR1) 1975; 18
CR16
CR15
Yata, Oono, Morita (CR27) 2007; 43
CR14
Benoit, Demaine, Munro (CR8) 2005; 43
Delpratt, Rahman, Raman (CR10) 2006; 2006
CR2
Navarro (CR21) 2004; 2
Aoe, Morimoto, Sato (CR4) 1992; 22
CR6
Peterson (CR22) 1980
CR24
CR23
Morita, Atlam, Fuketa (CR19) 2004; 159
Fu, Hagsand, Karlsson (CR12) 2007; 2
Fredkin (CR11) 1960; 3
Brain, Tharp (CR9) 1994; 6
Baeza-Yates, Gonnet (CR7) 1996; 43
M Fuketa (873_CR13) 2014; 50
K Morita (873_CR18) 2001; 31
873_CR15
873_CR16
873_CR14
O Delpratt (873_CR10) 2006; 2006
873_CR2
873_CR6
J Munro (873_CR20) 2001; 31
S Yata (873_CR27) 2007; 43
D Benoit (873_CR8) 2005; 43
AV Aho (873_CR1) 1975; 18
L Yang (873_CR25) 2012; 6
S Yata (873_CR26) 2007; 37
M Brain (873_CR9) 1994; 6
873_CR23
873_CR24
J Aoe (873_CR3) 1989; 15
G Navarro (873_CR21) 2004; 2
J Aoe (873_CR5) 1996; 8
RA Baeza-Yates (873_CR7) 1996; 43
K Morita (873_CR19) 2004; 159
J Fu (873_CR12) 2007; 2
J Peterson (873_CR22) 1980
E Fredkin (873_CR11) 1960; 3
873_CR17
J Aoe (873_CR4) 1992; 22
References_xml – volume: 8
  start-page: 476
  issue: 3
  year: 1996
  end-page: 491
  ident: CR5
  article-title: A trie compaction algorithm for a large set of keys
  publication-title: IEEE Trans Knowl Data Eng
  doi: 10.1109/69.506713
– ident: CR14
– ident: CR2
– ident: CR16
– volume: 15
  start-page: 1066
  issue: 9
  year: 1989
  end-page: 1077
  ident: CR3
  article-title: An efficient digital search algorithm by using a double-array structure
  publication-title: IEEE Trans Softw Eng
  doi: 10.1109/32.31365
– year: 1980
  ident: CR22
  publication-title: Computer programs for spelling correction: an experiment in program design
– ident: CR6
– volume: 37
  start-page: 523
  issue: 5
  year: 2007
  end-page: 534
  ident: CR26
  article-title: An efficient deletion method for a minimal prefix double array
  publication-title: Softw Pract Exp
  doi: 10.1002/spe.778
– volume: 2
  start-page: 18
  issue: 3
  year: 2007
  end-page: 27
  ident: CR12
  article-title: Improving and analyzing LC-trie performance for IP-address lookup
  publication-title: J Netw
– volume: 18
  start-page: 333
  issue: 6
  year: 1975
  end-page: 340
  ident: CR1
  article-title: Efficient string matching: an aid to bibliographic search
  publication-title: Commun ACM
  doi: 10.1145/360825.360855
– ident: CR23
– volume: 43
  start-page: 915
  issue: 6
  year: 1996
  end-page: 936
  ident: CR7
  article-title: Fast text searching for regular expressions or automaton searching on tries
  publication-title: J ACM
  doi: 10.1145/235809.235810
– volume: 43
  start-page: 275
  year: 2005
  end-page: 292
  ident: CR8
  article-title: Representing trees of higher degree
  publication-title: Algorithmica
  doi: 10.1007/s00453-004-1146-6
– ident: CR15
– volume: 3
  start-page: 490
  issue: 9
  year: 1960
  end-page: 499
  ident: CR11
  article-title: Trie memory
  publication-title: Commun ACM
  doi: 10.1145/367390.367400
– volume: 2006
  start-page: 134
  year: 2006
  end-page: 145
  ident: CR10
  article-title: Engineering the louds succinct tree representation
  publication-title: Proc WEA
– ident: CR17
– volume: 2
  start-page: 87
  issue: 1
  year: 2004
  end-page: 114
  ident: CR21
  article-title: Indexing text using the zivlempel trie
  publication-title: J Discret Algorithms
  doi: 10.1016/S1570-8667(03)00066-2
– volume: 50
  start-page: 796
  issue: 5
  year: 2014
  end-page: 806
  ident: CR13
  article-title: Compression of double array structures for fixed length keywords
  publication-title: Inf Process Manag
  doi: 10.1016/j.ipm.2014.04.004
– volume: 31
  start-page: 43
  issue: 1
  year: 2001
  end-page: 65
  ident: CR18
  article-title: Fast insertion methods of a double-array structure
  publication-title: Softw Pract Exp
  doi: 10.1002/1097-024X(200101)31:1<43::AID-SPE356>3.0.CO;2-R
– volume: 31
  start-page: 762
  year: 2001
  end-page: 776
  ident: CR20
  article-title: Succinct representation of balanced parentheses and static trees
  publication-title: SIAM J Comput
  doi: 10.1137/S0097539799364092
– volume: 43
  start-page: 237
  issue: 1
  year: 2007
  end-page: 247
  ident: CR27
  article-title: A compact static double-array keeping character codes
  publication-title: Inf Process Manag
  doi: 10.1016/j.ipm.2006.04.004
– volume: 6
  start-page: 419
  issue: 4
  year: 2012
  end-page: 432
  ident: CR25
  article-title: An enhanced dynamic hash trie algorithm for lexicon search
  publication-title: Enterp Inf Syst
  doi: 10.1080/17517575.2012.665483
– volume: 22
  start-page: 695
  issue: 9
  year: 1992
  end-page: 721
  ident: CR4
  article-title: An efficient implementation of trie structures
  publication-title: Softw Pract Exp
  doi: 10.1002/spe.4380220902
– volume: 159
  start-page: 53
  issue: 12
  year: 2004
  end-page: 67
  ident: CR19
  article-title: Fast and compact updating algorithms of a double-array structure
  publication-title: Inf Sci
  doi: 10.1016/S0020-0255(03)00189-0
– volume: 6
  start-page: 239
  issue: 2
  year: 1994
  end-page: 247
  ident: CR9
  article-title: Using tries to eliminate pattern collisions in perfect hashing
  publication-title: IEEE Trans Knowl Data Eng
  doi: 10.1109/69.277768
– ident: CR24
– volume-title: Computer programs for spelling correction: an experiment in program design
  year: 1980
  ident: 873_CR22
– ident: 873_CR17
– volume: 2006
  start-page: 134
  year: 2006
  ident: 873_CR10
  publication-title: Proc WEA
– volume: 22
  start-page: 695
  issue: 9
  year: 1992
  ident: 873_CR4
  publication-title: Softw Pract Exp
  doi: 10.1002/spe.4380220902
– ident: 873_CR2
– ident: 873_CR6
  doi: 10.1137/1.9781611972900.9
– ident: 873_CR15
  doi: 10.1109/SFCS.1989.63533
– volume: 15
  start-page: 1066
  issue: 9
  year: 1989
  ident: 873_CR3
  publication-title: IEEE Trans Softw Eng
  doi: 10.1109/32.31365
– volume: 43
  start-page: 915
  issue: 6
  year: 1996
  ident: 873_CR7
  publication-title: J ACM
  doi: 10.1145/235809.235810
– ident: 873_CR14
  doi: 10.1109/INFCOM.2011.5935151
– volume: 31
  start-page: 43
  issue: 1
  year: 2001
  ident: 873_CR18
  publication-title: Softw Pract Exp
  doi: 10.1002/1097-024X(200101)31:1<43::AID-SPE356>3.0.CO;2-R
– volume: 2
  start-page: 87
  issue: 1
  year: 2004
  ident: 873_CR21
  publication-title: J Discret Algorithms
  doi: 10.1016/S1570-8667(03)00066-2
– ident: 873_CR23
  doi: 10.1137/1.9781611973075.13
– volume: 18
  start-page: 333
  issue: 6
  year: 1975
  ident: 873_CR1
  publication-title: Commun ACM
  doi: 10.1145/360825.360855
– volume: 2
  start-page: 18
  issue: 3
  year: 2007
  ident: 873_CR12
  publication-title: J Netw
– ident: 873_CR16
– volume: 37
  start-page: 523
  issue: 5
  year: 2007
  ident: 873_CR26
  publication-title: Softw Pract Exp
  doi: 10.1002/spe.778
– volume: 43
  start-page: 237
  issue: 1
  year: 2007
  ident: 873_CR27
  publication-title: Inf Process Manag
  doi: 10.1016/j.ipm.2006.04.004
– volume: 8
  start-page: 476
  issue: 3
  year: 1996
  ident: 873_CR5
  publication-title: IEEE Trans Knowl Data Eng
  doi: 10.1109/69.506713
– volume: 43
  start-page: 275
  year: 2005
  ident: 873_CR8
  publication-title: Algorithmica
  doi: 10.1007/s00453-004-1146-6
– volume: 159
  start-page: 53
  issue: 12
  year: 2004
  ident: 873_CR19
  publication-title: Inf Sci
  doi: 10.1016/S0020-0255(03)00189-0
– ident: 873_CR24
  doi: 10.1145/285237.285282
– volume: 50
  start-page: 796
  issue: 5
  year: 2014
  ident: 873_CR13
  publication-title: Inf Process Manag
  doi: 10.1016/j.ipm.2014.04.004
– volume: 31
  start-page: 762
  year: 2001
  ident: 873_CR20
  publication-title: SIAM J Comput
  doi: 10.1137/S0097539799364092
– volume: 3
  start-page: 490
  issue: 9
  year: 1960
  ident: 873_CR11
  publication-title: Commun ACM
  doi: 10.1145/367390.367400
– volume: 6
  start-page: 419
  issue: 4
  year: 2012
  ident: 873_CR25
  publication-title: Enterp Inf Syst
  doi: 10.1080/17517575.2012.665483
– volume: 6
  start-page: 239
  issue: 2
  year: 1994
  ident: 873_CR9
  publication-title: IEEE Trans Knowl Data Eng
  doi: 10.1109/69.277768
SSID ssj0017611
Score 2.116786
Snippet A trie is one of the data structures for keyword search algorithms and is utilized in natural language processing, reserved words search for compilers and so...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 55
SubjectTerms Algorithms
Analysis
Compilers
Compressing
Computer Science
Data Mining and Knowledge Discovery
Data structures
Database Management
Information retrieval
Information Storage and Retrieval
Information systems
Information Systems and Communication Service
Information Systems Applications (incl.Internet)
IT in Business
Keywords
Morphology
Natural language processing
Regular Paper
Representations
Retrieval
Searches
Searching
Software
Studies
SummonAdditionalLinks – databaseName: SpringerLink Contemporary (1997 - Present)
  dbid: RSV
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LSwMxEA5SPXixPnG1SgRPSiDbfSR7LGLxVMQXvS2TTSJC2ZVtK_jvneyjraKCHnLa2ewyj8wM32SGkHM_00kYJQFKADgLhQ5ZknHBdCYyl8GCNbwaNiFGIzkeJ7fNPe5pW-3eQpLVSb1y2Q2jF0x9cUkRMMzT19HbSWeNd_dPC-gA8_JqTB6aInPt9Foo87stPjujZYT5BRStfM2w-6-_3CZbTWhJB7Uu7JA1k--Sbju2gTZWvEeGA-oKyesC2JzWM6RpYaku5mpiGJQlvNO6sewcqairjX-mLh6FkjpHWOnqPnkcXj9c3bBmnALL0EvPWAABesRYBDqMrE5iLRzOIoWVADaEsG-1sREkiVKCmz4owMMnSoBrXyrMdIID0smL3BwS6lsFfiwg8pVDZyKVaeUr7WuQoEysPMJbvqZZ02vcjbyYpMsuyY5PKXcL-ZRyj1wsXnmtG238RtxrhZU2NjdNfemaywjBY4-cLR6jtTgIBHJTzB0NplChwCjHI5etAFe2-OmDR3-iPiabGFfFdVVvj3RQYOaEbGRvs5dpeVqp6wcMPeRE
  priority: 102
  providerName: Springer Nature
Title A compression method of double-array structures using linear functions
URI https://link.springer.com/article/10.1007/s10115-015-0873-0
https://www.proquest.com/docview/1800607706
https://www.proquest.com/docview/1825547512
Volume 48
WOSCitedRecordID wos000379185700003&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVPQU
  databaseName: ABI/INFORM Collection
  customDbUrl:
  eissn: 0219-3116
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0017611
  issn: 0219-1377
  databaseCode: 7WY
  dateStart: 20020101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/abicomplete
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ABI/INFORM Global
  customDbUrl:
  eissn: 0219-3116
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0017611
  issn: 0219-1377
  databaseCode: M0C
  dateStart: 20020101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/abiglobal
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Advanced Technologies & Aerospace Database
  customDbUrl:
  eissn: 0219-3116
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0017611
  issn: 0219-1377
  databaseCode: P5Z
  dateStart: 20020101
  isFulltext: true
  titleUrlDefault: https://search.proquest.com/hightechjournals
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Computer Science Database (ProQuest)
  customDbUrl:
  eissn: 0219-3116
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0017611
  issn: 0219-1377
  databaseCode: K7-
  dateStart: 20020101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/compscijour
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 0219-3116
  dateEnd: 20171231
  omitProxy: false
  ssIdentifier: ssj0017611
  issn: 0219-1377
  databaseCode: BENPR
  dateStart: 20020101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 0219-3116
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0017611
  issn: 0219-1377
  databaseCode: RSV
  dateStart: 19990201
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1La9xADBZ59NBLHn3QTZNlCj21DJ1ZP8Y-lTRkCYQuS_pKezGah0sg2MluttB_X8mP3STQXHKYuVj2GEsaSSNZH8Bb7XweJ3lEHEAlY-NjmTtlpHfGcQSLZVAN2ISZTLLz83zaHbjNu7LKfk9sNmpfOz4j_6Azbh1ijEo_Xl1LRo3i7GoHobEOm3o00iznp0YuswgUojeIeaSVkjvr9VnN9tc58oUokKaRmUiqu3Zp5Wzey482Zme8_dgX3oGtzuEUh62E7MJaqJ7Bdg_mIDrdfg7jQ8Hl5W1ZbCVaZGlRl8LXC3sZJM5m-Fe07WYXRCW4Yv63YC8VZ4LNYyPBL-Db-Pjr0YnsQBakI9t9IyOMyE6mJvJxUvo89YazL5kpM8QyxnhU-lAmmOfWGhVGaJG2pCRH5XVmKf6JXsJGVVfhFQhdWtSpwURbztkk1nmrrdceM7QhtQNQ_ScuXNeBnIEwLotV72TmSqF4EFcKNYB3y1uu2vYbDxHv95woOk2cFys2DODN8jLpECdGsAr1gmkosIoN-T4DeN_z-9Yj_rfg3sMLvoan5F6lbXHvPmwQh8IBPHF_bi7msyGsmx8_h7D56XgyPRs2gkvzZ3VE8zT5RfPZl-__AFLO9D0
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Lb9QwEB6VggQXylMsFDASXEAWzsaJ40NVVYVVq5YVhyL1FsaPVJWqpOx2Qf1T_EZm8tgFJHrrgYNPcWwl8_aM5wN4nfhgdWZTogAqqU3Q0nplZPDGcwSLVVQt2ISZTovjY_t5DX4Od2G4rHLQia2iDo3nM_L3ScGtQ4xR-fb5N8moUZxdHSA0OrY4iJc_KGSbb-1_IPq-GY8nH49292SPKiA9GasLmWJKhiE3adBZFWweDKcbClMViJVGPa5CrDK01jmj4hgdkgxmFlVICkcOf0rr3oCbWpM4cKmg2l1mLUze4v2S2bSSO_kNWdTuqh75XhS40yhMKtWfdnDl3P6Vj23N3GTjf_tB9-Bu71CLnU4C7sNarB_AxgBWIXrd9RAmO4LL57uy31p0yNmiqURoFu4sSpzN8FJ07XQXNEvwjYATwV44zgSb_1ZCH8GXa_max7BeN3V8AiKpHCa5wSxxnJPKnA8ucSEJWKCLuRuBGkha-r7DOgN9nJWr3tDMBaXiQVxQqhG8Xb5y3rUXuWry5kD5stc083JF9hG8Wj4mHcGJH6xjs-A5FDhqQ77dCN4N_PXbEv_a8OnVG76E23tHnw7Lw_3pwTO4Q65k3hUyb8I6USs-h1v--8XpfPaiFRMBX6-b7X4B6StNJw
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LaxRBEC5iFPFifJLVqC3oRWnSs_Po6YOEYFwMK0sOCrmN1S8JhJm4m1Xy1_x1Vs1jNwrmloOHOU1PNzP11aOnqusDeJU4b7LcpCQBVDLTPpPGKS290453sBiDaskm9GxWHh-bow34NZyF4bLKwSa2hto3jv-R7yYltw7RWhW7sS-LODqY7J19l8wgxZnWgU6jg8g0XPyk7dvi3eEByfr1eDz58Pn9R9kzDEhHjutcppiSkyh06rM8elN4zamHUscSMWaYjaMPMUdjrNUqjNEi6WNuUPmktBT8pzTvDbhJXjhnHZtqucpg6KLl_iUXaiR39Rsyqt2xPYrDaBNPV6lTqf70ietA96_cbOvyJlv_88e6B3f7QFvsd5pxHzZC_QC2BhIL0du0hzDZF1xW35UD16Jj1BZNFL5Z2tMgcT7HC9G12V3SKMEnBb4Jjs5xLjgsaDX3EXy5lrd5DJt1U4dtEEm0mBQa88Ryriq3ztvE-sRjiTYUdgRqEG_l-s7rTAByWq17RjMiKsUXIaJSI3izeuSsazty1eCdAQVVb4EW1RoCI3i5uk22gxNCWIdmyWNoQ5lpivlG8HbA2qUp_rXgk6sXfAG3CW3Vp8PZ9CncoQiz6Oqbd2CThBWewS334_xkMX_eaoyAr9eNut9XkFXN
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+compression+method+of+double-array+structures+using+linear+functions&rft.jtitle=Knowledge+and+information+systems&rft.au=Kanda%2C+Shunsuke&rft.au=Fuketa%2C+Masao&rft.au=Morita%2C+Kazuhiro&rft.au=Aoe%2C+Jun-ichi&rft.date=2016-07-01&rft.pub=Springer+Nature+B.V&rft.issn=0219-1377&rft.eissn=0219-3116&rft.volume=48&rft.issue=1&rft.spage=55&rft_id=info:doi/10.1007%2Fs10115-015-0873-0&rft.externalDBID=HAS_PDF_LINK&rft.externalDocID=4105136741
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0219-1377&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0219-1377&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0219-1377&client=summon