Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
90
Construction of the CDAWG for a Trie
, 2001
"... Trie is a tree structure to represent a set of strings. When the strings have many common prefixes, the number of nodes in the trie is much less than the total length of the strings. In this paper, we propose an algorithm for constructing the Compact Directed Acyclic Word Graph for a trie, which run ..."
Abstract
-
Cited by 6 (2 self)
- Add to MetaCart
Trie is a tree structure to represent a set of strings. When the strings have many common prefixes, the number of nodes in the trie is much less than the total length of the strings. In this paper, we propose an algorithm for constructing the Compact Directed Acyclic Word Graph for a trie, which
ILP:- Just Trie It
"... Abstract. Despite the considerable success of Inductive Logic Programming, deployed ILP systems still have efficiency problems when applied to complex problems. Several techniques have been proposed to address the efficiency issue. Such proposals include query transformations, query packs, lazy eval ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
evaluation and parallel execution of ILP systems, to mention just a few. We propose a novel technique to improve the execution time of an ILP system that avoids the procedure of deducing each example to evaluate each constructed clause. The technique takes advantage of the two stage procedure of Mode
Efficient construction of pipelined multibit-trie Router-Tables
- IEEE Trans. Comput
, 2003
"... Efficient algorithms to construct multibit tries suitable for pipelined router-table applications are developed. We first enhance the 1-phase algorithm of Basu and Narlikar [1] obtaining a 1-phase algorithm that is 2.5 to 3 times as fast. Next we develop 2-phase algorithms that not only guarantee to ..."
Abstract
-
Cited by 18 (2 self)
- Add to MetaCart
Efficient algorithms to construct multibit tries suitable for pipelined router-table applications are developed. We first enhance the 1-phase algorithm of Basu and Narlikar [1] obtaining a 1-phase algorithm that is 2.5 to 3 times as fast. Next we develop 2-phase algorithms that not only guarantee
A generalization of the trie data structure
- Mathematical Structures in Computer Science
, 1995
"... ABSTRACT. Tries, a form of string-indexed look-up structure, are generalized to per-mit indexing by terms built according to an arbitrary signature. The construction is parametric with respect to the type of data to be stored as values; this is essen-tial, because the recursion which defines tries a ..."
Abstract
-
Cited by 15 (0 self)
- Add to MetaCart
ABSTRACT. Tries, a form of string-indexed look-up structure, are generalized to per-mit indexing by terms built according to an arbitrary signature. The construction is parametric with respect to the type of data to be stored as values; this is essen-tial, because the recursion which defines tries
Trie methods for text and spatial data on secondary storage
, 2001
"... This thesis presents three trie organizations for various binary tries. The new trie structures have two distinctive features: (1) they store no pointers and require two bits per node in the worst case, and (2) they partition tries into pages and are suitable for secondary storage. We apply trie s ..."
Abstract
-
Cited by 7 (2 self)
- Add to MetaCart
structures to indexing, storing and querying both text and spatial data on secondary storage. We are interested in practical problems such as storage compactness, I/O efficiency, and large trie construction. We use our tries to index and search arbitrary substrings of a text. For an index of 100 million keys
Surprising results of trie-based fim algorithms
- In: Proceedings of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations (FIMI’04). Volume 126 of CEUR Workshop Proceedings
, 2004
"... Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related techniques can be applied in FIM algorithms to improve efficiency. In this paper we propose new techniques for fast manageme ..."
Abstract
-
Cited by 11 (1 self)
- Add to MetaCart
Trie is a popular data structure in frequent itemset mining (FIM) algorithms. It is memory-efficient, and allows fast construction and information retrieval. Many trie-related techniques can be applied in FIM algorithms to improve efficiency. In this paper we propose new techniques for fast
Trie Methods for Structured Data on Secondary Storage
, 2000
"... We apply the trie structures to indexing, storing and querying structured data on secondary storage. We are interested in the storage compactness, the I/O efficiency, the order-preserving properties, the general orthogonal range queries and the exact match queries for very large files and databases. ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
We apply the trie structures to indexing, storing and querying structured data on secondary storage. We are interested in the storage compactness, the I/O efficiency, the order-preserving properties, the general orthogonal range queries and the exact match queries for very large files and databases
LSM-trie: An LSM-tree-based Ultra-Large Key-Value Store for Small Data
"... Key-value (KV) stores have become a backbone of large-scale applications in today’s data centers. The data set of the store on a single server can grow to billions of KV items or many terabytes, while individual data items are often small (with their values as small as a couple of bytes). It is a da ..."
Abstract
-
Cited by 3 (0 self)
- Add to MetaCart
be held in memory. To this end, LSM-trie constructs a trie, or a prefix tree, that stores data in a hierarchical structure and keeps re-organizing them using a compaction method much more efficient than that adopted for LSM-tree. Our experiments show that LSM-trie can improve write and read throughput
Range Trie Heuristics for Variable-Size Address Region Lookup
"... CE-MS-2009-07 Variable Address Region Lookup is a problem that has applications in a number of domains, most notably packet routing and classification in networks. Technological advances in communication links have lead to increased performance demands on routing algorithms, and the introduction of ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
of resources. The goal of our research is to develop a number of efficient heuristics to construct this structure. The lookup method for a Range Trie performs multiple comparisons at every step, while considering selected parts of addresses. A heuristic for constructing a Range Trie faces the following
Time/Space Efficient Filtering of Streaming XML Documents Using Incrementally Constructed Path-trie
"... In this paper, we present a streaming XML document filter named DXAXEN which is based on incremental construction of path-trie. It runs very fast, and processes a large number of XPath queries efficiently. Experimental comparison with XMLTK, a well-known streaming XML document filter, shows that DXA ..."
Abstract
- Add to MetaCart
In this paper, we present a streaming XML document filter named DXAXEN which is based on incremental construction of path-trie. It runs very fast, and processes a large number of XPath queries efficiently. Experimental comparison with XMLTK, a well-known streaming XML document filter, shows
Results 1 - 10
of
90
