Search results for "Trie"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
138	Dow-Yung Yang, Akshay Johar, Ananth Grama, Wojciech Szpankowski	Summary Structures for Frequency Queries on Large Transaction Sets.	Data Compression Conference	2000	DBLP DOI BibTeX RDF	Frequency Queries, Patricia Tries, Compressed Tries, Compression, Transactions, Tries, Frequent Sets
137	Douglas Comer	Heuristics for Trie Index Minimization.	ACM Trans. Database Syst.	1979	DBLP DOI BibTeX RDF	doubly chained tree, trie minimization, index, trie
126	Cheng-Wen Cheng, Jonas Rabin	Synthesis of Decision Rules.	Commun. ACM	1976	DBLP DOI BibTeX RDF
118	Witold Litwin, Nick Roussopoulos, Gérald Lévy, Wang Hong	Trie Hashing With Controlled Load.	IEEE Trans. Software Eng.	1991	DBLP DOI BibTeX RDF	primary key access method, dynamic files, key search, trie hashing, controlled load, THCL, TH file, B-tree file, high load factor, ordered insertions, random insertions, trees (mathematics), file organisation, information retrieval systems, load factor, load factor, disk access
99	Guy Louchard	Trie Size in a Dynamic List Structure.	TAPSOFT	1993	DBLP DOI BibTeX RDF
95	B. John Oommen, Ghada Hany Badr	Breadth-first search strategies for trie-based syntactic pattern recognition.	Pattern Anal. Appl.	2007	DBLP DOI BibTeX RDF	Trie-based syntactic pattern recognition, Noisy syntactic recognition using tries, Approximate string matching
87	Seunghyun Oh, Yangsun Lee 0002	The Bitmap Trie for Fast Prefix Lookup.	Human.Society@Internet 2003	2003	DBLP DOI BibTeX RDF
87	R. Ramesh 0002, A. J. G. Babu, J. Peter Kincaid	Variable-Depth Trie Index Optimization: Theory and Experimental Results.	ACM Trans. Database Syst.	1989	DBLP DOI BibTeX RDF
84	Ghada Badr, B. John Oommen	A novel look-ahead optimization strategy for trie-based approximate string matching.	Pattern Anal. Appl.	2006	DBLP DOI BibTeX RDF	Trie-based syntactic pattern recognition, Noisy syntactic recognition using tries, Branch and bound techniques, Pruning, Approximate string matching
80	Douglas Comer	Analysis of a Heuristic for Trie Minimization.	ACM Trans. Database Syst.	1981	DBLP DOI BibTeX RDF	trie index, trie size, heuristic
76	Bo Zheng, Chuang Lin 0002	AM-Trie: A High-Speed Parallel Packet Classification Algorithm for Network Processor.	International Conference on Computational Science (4)	2006	DBLP DOI BibTeX RDF
76	Bo Zheng, Chuang Lin 0002, Xuehai Peng	AM-Trie: An OC-192 Parallel Multidimensional Packet Classification Algorithm.	IMSCCS (1)	2006	DBLP DOI BibTeX RDF
76	Robert W. P. Luk	Time-Space Trade-Off Analysis of Morphic Trie Images.	IEEE Trans. Knowl. Data Eng.	2001	DBLP DOI BibTeX RDF
76	M. Al-Suwaiyel, Ellis Horowitz	Algorithms for Trie Compaction.	ACM Trans. Database Syst.	1984	DBLP DOI BibTeX RDF
69	Sailesh Kumar, Michela Becchi, Patrick Crowley, Jonathan S. Turner	CAMP: fast and efficient IP lookup architecture.	ANCS	2006	DBLP DOI BibTeX RDF	IP lookup, longest prefix match, internet router
65	Nikolas Askitis, Justin Zobel	B-tries for disk-based string management.	VLDB J.	2009	DBLP DOI BibTeX RDF	Burst trie, Vocabulary accumulation, Word-level indexing, Data structures, B-tree, Secondary storage
65	Sartaj Sahni, Kun Suk Kim	Efficient construction of multibit tries for IP lookup.	IEEE/ACM Trans. Netw.	2003	DBLP DOI BibTeX RDF	multibit trie, dynamic programming, packet routing, longest matching prefix, controlled prefix expansion
64	Meifang Li, Hongkai Zhu, Derong Shen, Tiezheng Nie, Yue Kou, Ge Yu 0001	Pampoo: An Efficient Skip-Trie Based Query Processing Framework for P2P Systems.	APPT	2007	DBLP DOI BibTeX RDF
64	Errin W. Fulp, Stephen J. Tarsa	Trie-Based Policy Representations for Network Firewalls.	ISCC	2005	DBLP DOI BibTeX RDF
64	Witold Litwin, Djamel Eddine Zegour, Gérard Lévy	Multilevel Trie Hashing.	EDBT	1988	DBLP DOI BibTeX RDF
62	Chien-Huei Chen	Lexicon-driven word recognition.	ICDAR	1995	DBLP DOI BibTeX RDF	lexicon-driven word recognition, document understanding systems, trie data structures, word image recognition, lexicon trie searching, node characters, segmentation-free method, character hypothesis verification, severely degraded images, document image processing, best match
61	Ye-In Chang, Jiun-Rung Chen, Min-Tze Hsu	A Hash Trie Filter Approach to Approximate String Matching for Genomic Databases.	IEA/AIE	2009	DBLP DOI BibTeX RDF	hash trie, filter, Approximate string matching
57	David Y. Chen, Jianchang Mao, K. Moidin Mohiuddin	An Efficient Algorithm for Matching a Lexicon with a Segmentation Graph.	ICDAR	1999	DBLP DOI BibTeX RDF
57	Arne Andersson, Stefan Nilsson	Faster Searching in Tries and Quadtrees - An Analysis of Level Compression.	ESA	1994	DBLP DOI BibTeX RDF
54	Hyesook Lim, Ju Hyoung Mun	High-speed packet classification using binary search on length.	ANCS	2007	DBLP DOI BibTeX RDF	area-based quad-trie, best matching rule, binary search on length, hashing, packet classification
54	Hai Zhuge, Xiaoping Sun, Jie Liu 0025, Erlin Yao, Xue Chen	A Scalable P2P Platform for the Knowledge Grid.	IEEE Trans. Knowl. Data Eng.	2005	DBLP DOI BibTeX RDF	distributed trie index, Peer-to-peer, load balancing, replication, knowledge grid, path query, semantic overlay
53	Moritz G. Maaß	Average-Case Analysis of Approximate Trie Search.	Algorithmica	2006	DBLP DOI BibTeX RDF
53	Stephen J. Tarsa, Errin W. Fulp	Balancing Trie-Based Policy Representations for Network Firewalls.	ISCC	2006	DBLP DOI BibTeX RDF
53	Ghada Badr, B. John Oommen	Enhancing Trie-Based Syntactic Pattern Recognition Using AI Heuristic Search Strategies.	ICAPR (1)	2005	DBLP DOI BibTeX RDF
53	Ghada Badr, B. John Oommen	A Look-Ahead Branch and Bound Pruning Scheme for Trie-Based Approximate String Matching.	CORES	2005	DBLP DOI BibTeX RDF
53	Moritz G. Maaß	Average-Case Analysis of Approximate Trie Search (Extended Abstract).	CPM	2004	DBLP DOI BibTeX RDF
53	Michael J. Freedman, Radek Vingralek	Efficient Peer-to-Peer Lookup Based on a Distributed Trie.	IPTPS	2002	DBLP DOI BibTeX RDF
49	Levent Guner, Pinar Senkul	Frequent Itemset Minning with Trie Data Structure and Parallel Execution with PVM.	PVM/MPI	2007	DBLP DOI BibTeX RDF	Message Passing, PVM, Parallel Execution, Apriori, Trie
49	Walter A. Burkhard	Hashing and Trie Algorithms for Partial Match Retrieval.	ACM Trans. Database Syst.	1976	DBLP DOI BibTeX RDF	trie search, algorithms, searching, analysis, retrieval, partial match, hash coding, associative retrieval
46	Haibin Lu, Sartaj Sahni	O(logW) multidimensional packet classification.	IEEE/ACM Trans. Netw.	2007	DBLP DOI BibTeX RDF	binary search on levels, expected complexity, multidimensional packet classification
46	Zhenguo Shi, Zongtian Liu, Qiang Wu	Research on au-Parameter Fuzzy Concept Lattice for Grid Resource.	SKG	2006	DBLP DOI BibTeX RDF
46	Mahmoud Youssef, Vijayalakshmi Atluri, Nabil R. Adam	Preserving mobile customer privacy: an access control system for moving objects and customer profiles.	Mobile Data Management	2005	DBLP DOI BibTeX RDF	privacy, mobile, access control, moving objects, customer profiles
46	Haoyu Song 0001, Jonathan S. Turner, John W. Lockwood	Shape Shifting Tries for Faster IP Route Lookup.	ICNP	2005	DBLP DOI BibTeX RDF
46	Naresh Neelapala, Romil Mittal, Jayant R. Haritsa	SPINE: Putting Backbone into String Indexing.	ICDE	2004	DBLP DOI BibTeX RDF
46	Linhui Jiang, Howard J. Hamilton	Methods for Mining Frequent Sequential Patterns.	AI	2003	DBLP DOI BibTeX RDF
46	Steffen Heinz, Justin Zobel, Hugh E. Williams	Burst tries: a fast, efficient data structure for string keys.	ACM Trans. Inf. Syst.	2002	DBLP DOI BibTeX RDF	string data structures, vocabulary accumulation, Binary trees, text databases, tries, splay trees
42	Maxime Crochemore, Lucian Ilie, Emine Seid-Hilmi	Factor Oracles.	CIAA	2006	DBLP DOI BibTeX RDF	factor oracle, suffix trie, graph quotient, string matching, suffix tree
42	Xin Zhou, Yunlong Xu, Gongming Chen, Zhigeng Pan	A New Wildcard Search Method for Digital Dictionary Based on Mobile Platform.	ICAT Workshops	2006	DBLP DOI BibTeX RDF	Trie tree, No-head wildcard, Cut-branch, Mobile phone, Wildcard
41	Jorge Costa, João Raimundo, Ricardo Rocha 0001	A Term-Based Global Trie for Tabled Logic Programs.	ICLP	2009	DBLP DOI BibTeX RDF	Table Space, Implementation, Tabling Logic Programming
41	B. Kalpana, R. Nadarajan, J. Senthil Babu	An Indexed Trie Approach to Incremental Mining of Closed Frequent Itemsets Based on a Galois Lattice Framework.	DASFAA	2008	DBLP DOI BibTeX RDF
41	Andrew Leaver-Fay, Brian Kuhlman, Jack Snoeyink	Rotamer-Pair Energy Calculations Using a Trie Data Structure.	WABI	2005	DBLP DOI BibTeX RDF
41	Anurag Acharya 0001, Huican Zhu, Kai Shen	Adaptive Algorithms for Cache-Efficient Trie Search.	ALENEX	1999	DBLP DOI BibTeX RDF
41	Pilar de la Torre, David T. Kao	A Uniform Analysis of Trie Structures that Store Prefixing-Keys with Application to Doubly-Chained Prefixing-Tries.	MFCS	1996	DBLP DOI BibTeX RDF
41	Walid G. Aref, Daniel Barbará, Padmavathi Vallabhaneni	The Handwritten Trie: Indexing Electronic Ink.	SIGMOD Conference	1995	DBLP DOI BibTeX RDF
41	Philippe Jacquet, Mireille Régnier	Trie Partitioning Process: Limiting Distributions.	CAAP	1986	DBLP DOI BibTeX RDF
39	Hyesook Lim, Changhoon Yim, Earl E. Swartzlander Jr.	Priority Tries for IP Address Lookup.	IEEE Trans. Computers	2010	DBLP DOI BibTeX RDF	binary trie, priority trie, range representation, Internet, router, IP address lookup
38	Vanessa El-Khoury, Nadia Bennani, Aris M. Ouksel	Distributed Key Management in Dynamic Outsourced Databases: A Trie-Based Approach.	DBKDA	2009	DBLP DOI BibTeX RDF	Binary Trie, Access control, Outsourcing
38	Kun Suk Kim, Sartaj Sahni	Efficient Construction of Pipelined Multibit-Trie Router-Tables.	IEEE Trans. Computers	2007	DBLP DOI BibTeX RDF	multibit trie, pipelined router-table, dynamic programming, Packet routing, longest matching-prefix, controlled prefix expansion
38	Jun-ichi Aoe, Katsushi Morimoto, Masami Shishibori, Ki-Hong Park	A Trie Compaction Algorithm for a Large Set of Keys.	IEEE Trans. Knowl. Data Eng.	1996	DBLP DOI BibTeX RDF	Key search techniques, trie structures, digital search, key retrieval algorithm, natural language dictionaries, data structure
37	Jae-Yun Kim, Junmo Lee, Soo-Mook Moon	Trie-Hashimoto: State Trie-Based Proof-of-Work Mining for Optimizing Blockchain Storage.	IEEE Access	2024	DBLP DOI BibTeX RDF
37	Kaushal Kumar Maurya, Maunendra Sankar Desarkar, Manish Gupta 0001, Puneet Agrawal	trie-nlg: trie context augmentation to improve personalized query auto-completion for short and unseen prefixes.	Data Min. Knowl. Discov.	2023	DBLP DOI BibTeX RDF
37	Kaushal Kumar Maurya, Maunendra Sankar Desarkar, Manish Gupta 0001, Puneet Agrawal	Trie-NLG: Trie Context Augmentation to Improve Personalized Query Auto-Completion for Short and Unseen Prefixes.	CoRR	2023	DBLP DOI BibTeX RDF
37	Yi Zhang, Lufeng Qiao, Huali Wang	PR-Trie: A Hybrid Trie with Ant Colony Optimization Based Prefix Partitioning for Memory-Efficient IPv4/IPv6 Route Lookup.	IEICE Trans. Inf. Syst.	2023	DBLP DOI BibTeX RDF
37	Hongbo Kang, Yiwei Zhao, Guy E. Blelloch, Laxman Dhulipala, Yan Gu 0001, Charles McGuffey, Phillip B. Gibbons	PIM-trie: A Skew-resistant Trie for Processing-in-Memory.	SPAA	2023	DBLP DOI BibTeX RDF
37	Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	c-trie++: A dynamic trie tailored for fast prefix searches.	Inf. Comput.	2022	DBLP DOI BibTeX RDF
37	Md Iftakharul Islam, Javed I. Khan	CP-Trie: Cumulative PopCount based Trie for IPv6 Routing Table Lookup in Software and ASIC.	HPSR	2021	DBLP DOI BibTeX RDF
37	Rahat Yeasin Emon, Sharmistha Chanda Tista	A Compact Radix-Trie: A Character-Cell Compressed Trie Data-Structure for Word-Lookup System.	ICO	2021	DBLP DOI BibTeX RDF
37	Kazuya Tsuruta, Dominik Köppl, Shunsuke Kanda, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda	c-Trie++: A Dynamic Trie Tailored for Fast Prefix Searches.	DCC	2020	DBLP DOI BibTeX RDF
37	Jianlin Shi, John F. Hurdle	Trie-based rule processing for clinical NLP: A use-case study of n-trie, making the ConText algorithm more efficient and scalable.	J. Biomed. Informatics	2018	DBLP DOI BibTeX RDF
37	Jianhua Feng, Jiannan Wang 0001, Guoliang Li 0001	Trie-join: a trie-based method for efficient string similarity joins.	VLDB J.	2012	DBLP DOI BibTeX RDF
37	Jiannan Wang 0001, Guoliang Li 0001, Jianhua Feng	Trie-Join: Efficient Trie-based String Similarity Joins with Edit-Distance Constraints. (PDF / PS)	Proc. VLDB Endow.	2010	DBLP DOI BibTeX RDF
37	Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal	Trie Based Subsumption and Improving the pi-Trie Algorithm.	PAAR@IJCAR	2010	DBLP DOI BibTeX RDF
37	Nikolas Askitis, Ranjan Sinha	HAT-Trie: A Cache-Conscious Trie-Based Data Structure For Strings.	ACSC	2007	DBLP BibTeX RDF
37	Masami Shishibori, Makoto Okada, Toru Sumitomo, Jun-ichi Aoe	An Efficient Trie Hashing Method Using a Compact Binary Trie.	Stringology	1997	DBLP BibTeX RDF
34	Pedro Manuel Pinto Ribeiro, Fernando M. A. Silva	g-tries: an efficient data structure for discovering network motifs.	SAC	2010	DBLP DOI BibTeX RDF	algorithms, data structures, complex networks, graph mining, biological networks, tries, network motifs
34	Andrew Matusiewicz, Neil V. Murray, Erik Rosenthal	Prime Implicate Tries.	TABLEAUX	2009	DBLP DOI BibTeX RDF
34	Neil V. Murray, Erik Rosenthal	Reduced Implicate/Implicant Tries.	ISMIS	2008	DBLP DOI BibTeX RDF
34	Ranjan Sinha, Anthony Wirth	Engineering Burstsort: Towards Fast In-Place String Sorting.	WEA	2008	DBLP DOI BibTeX RDF
34	Xuhui Liu, Guoliang Li 0001, Jianhua Feng, Lizhu Zhou	Effective Indices for Efficient Approximate String Search and Similarity Join.	WAIM	2008	DBLP DOI BibTeX RDF
34	GaHyun Park, Hsien-Kuei Hwang, Pierre Nicodème, Wojciech Szpankowski	Profile of Tries.	LATIN	2008	DBLP DOI BibTeX RDF
34	Svante Janson, Wojciech Szpankowski	Partial fillup and search time in LC tries.	ACM Trans. Algorithms	2007	DBLP DOI BibTeX RDF	Digital trees, level-compressed tries, partial fillup, trees, probabilistic analysis, strings, Poissonization
34	John Yiannis, Justin Zobel	Compression techniques for fast external sorting.	VLDB J.	2007	DBLP DOI BibTeX RDF	Semi-static compression, Sorting, Query evaluation, External sorting
34	Jung-Im Won, Sang-Kyoon Hong, Jeehee Yoon, Sanghyun Park 0003, Sang-Wook Kim	A Practical Method for Approximate Subsequence Search in DNA Databases.	PAKDD	2007	DBLP DOI BibTeX RDF	DNA database, approximate subsequence search, suffix tree
34	Jesper Jansson 0001, Kunihiko Sadakane, Wing-Kin Sung	Compressed Dynamic Tries with Applications to LZ-Compression in Sublinear Time and Space.	FSTTCS	2007	DBLP DOI BibTeX RDF
34	Kaushik Rajan, Ramaswamy Govindarajan	Two-level mapping based cache index selection for packet forwarding engines.	PACT	2006	DBLP DOI BibTeX RDF	network processors, cache architectures
34	Gerth Stølting Brodal, Rolf Fagerberg	Cache-oblivious string dictionaries.	SODA	2006	DBLP DOI BibTeX RDF
34	Eddy Caron, Frederic Desprez, Charles Fourdrignier, Franck Petit, Cédric Tedeschi	A Repair Mechanism for Fault-Tolerance for Tree-Structured Peer-to-Peer Systems.	HiPC	2006	DBLP DOI BibTeX RDF
34	GaHyun Park, Wojciech Szpankowski	Towards a complete characterization of tries.	SODA	2005	DBLP BibTeX RDF
34	Kaushik Rajan, Ramaswamy Govindarajan	A heterogeneously segmented cache architecture for a packet forwarding engine.	ICS	2005	DBLP DOI BibTeX RDF
34	Heuiseok Lim, Kichun Nam, Yumi Hwang	A Computational Model of Korean Mental Lexicon.	ICCSA (1)	2005	DBLP DOI BibTeX RDF
34	Hao Xuefeng, Xu De	LMIX: A Dynamic XML Index Method Using Line Model.	APWeb	2005	DBLP DOI BibTeX RDF
34	Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski	Do We Really Need to Balance Patricia Trees? (Extended Abstract).	ICALP	1988	DBLP DOI BibTeX RDF
31	Mihir Jain, Sreekanth Vempati, Chandrika Pulla, C. V. Jawahar	Example based video filters.	CIVR	2009	DBLP DOI BibTeX RDF	video filtering, vocabulary trie, copy detection, indexing and retrieval
31	Pawel Terlecki, Krzysztof Walczak 0002	Attribute Set Dependence in Reduct Computation.	Trans. Comput. Sci.	2008	DBLP DOI BibTeX RDF	set dependence, rough sets, reduct, apriori, trie
31	Martin Fiala, Jan Holub 0001	DCA Using Suffix Arrays.	DCC	2008	DBLP DOI BibTeX RDF	Data Compression using Antidictionaries, suffix trie, suffix array
31	Neil V. Murray, Erik Rosenthal	Efficient Query Processing with Reduced Implicate Tries.	J. Autom. Reason.	2007	DBLP DOI BibTeX RDF	reduced implicate trie, query processing, knowledge base
31	Sartaj Sahni, Kun Suk Kim	Efficient Construction of Variable-Stride Multibit Tries for IP Lookup.	SAINT	2002	DBLP DOI BibTeX RDF	multibit trie, dynamic programming, Packet routing, longest matching prefix, controlled prefix expansion
31	Sartaj Sahni, Kun Suk Kim	Efficient Construction of Fixed-Stride Multibit Tries for IP Lookup.	FTDCS	2001	DBLP DOI BibTeX RDF	multibit trie, dynamic programming, Packet routing, longest matching prefix, controlled prefix expansion
31	Sriganesh Madhvanath, Venu Krpasundar	Pruning Large Lexicons Using Generalized Word Shape Descriptors.	ICDAR	1997	DBLP DOI BibTeX RDF	static lexicon organization, lexicon reduction, holistic matching, trie organization, shape descriptors, Handwritten word recognition, postprocessing, elastic matching
31	Steven Dawson, C. R. Ramakrishnan 0001, Steven Skiena, Terrance Swift	Principles and Practice of Unification Factoring.	ACM Trans. Program. Lang. Syst.	1996	DBLP DOI BibTeX RDF	trie minimization, logic programming, indexing, unification
30	Yuqing Wu, Sofia Brenes, Hyungdae Yi	Workload-aware trie indices for XML.	CIKM	2009	DBLP DOI BibTeX RDF	structural index, query processing, xml, workload
30	Jeahyun Park, Juyoung Park, Joongmin Choi	Web-Based Document Classification Using a Trie-Based Index Structure.	Web Intelligence/IAT Workshops	2007	DBLP DOI BibTeX RDF
30	Rui Camacho, Nuno A. Fonseca, Ricardo Rocha 0001, Vítor Santos Costa	ILP : - Just Trie It.	ILP	2007	DBLP DOI BibTeX RDF	Mode Directed Inverse Entailment, Data Structures, Efficiency
30	Manolis Terrovitis, Spyros Passas, Panos Vassiliadis, Timos K. Sellis	A combination of trie-trees and inverted files for the indexing of set-valued attributes.	CIKM	2006	DBLP DOI BibTeX RDF	HTI, containment queries, inverted files, tries
30	Rosalba Giugno, Alfredo Pulvirenti, Diego Reforgiato Recupero	Clustered Trie Structures for Approximate Search in Hierarchical Objects Collections.	ICAPR (1)	2005	DBLP DOI BibTeX RDF