Filters








262,644 Hits in 5.7 sec

Space Efficient Algorithms for Ordered Tree Comparison [chapter]

Lusheng Wang, Kaizhong Zhang
2005 Lecture Notes in Computer Science  
Algorithms have been developed for ordered labeled tree comparisons [5, 9, 10, 12, 15] .  ...  Keywords Space efficient algorithms · Constrained tree edit distance · Alignment of trees Introduction Ordered labeled trees are trees whose nodes are labeled and in which the left to right order among  ...  Conclusion We have presented space efficient algorithms for the computation of constrained edit distance and tree alignment for ordered rooted trees.  ... 
doi:10.1007/11602613_39 fatcat:dhhkttuxkjdq5alrwmdxscwsn4

Space Efficient Algorithms for Ordered Tree Comparison

Lusheng Wang, Kaizhong Zhang
2008 Algorithmica  
Algorithms have been developed for ordered labeled tree comparisons [5, 9, 10, 12, 15] .  ...  Keywords Space efficient algorithms · Constrained tree edit distance · Alignment of trees Introduction Ordered labeled trees are trees whose nodes are labeled and in which the left to right order among  ...  Conclusion We have presented space efficient algorithms for the computation of constrained edit distance and tree alignment for ordered rooted trees.  ... 
doi:10.1007/s00453-007-9100-z fatcat:vgxcqynht5gdbcqskj2zqj2zka

The adaptive radix tree: ARTful indexing for main-memory databases

V. Leis, Alfons Kemper, T. Neumann
2013 2013 IEEE 29th International Conference on Data Engineering (ICDE)  
At the same time, ART is very space efficient and solves the problem of excessive worst-case space consumption, which plagues most radix trees, by adaptively choosing compact and efficient data structures  ...  To overcome these shortcomings, we present ART, an adaptive radix tree (trie) for efficient indexing in main memory.  ...  Just as this concept allows to replace comparison-based trees with radix trees, it allows to replace comparison-based sorting algorithms like quicksort or mergesort with the radix sort algorithm which  ... 
doi:10.1109/icde.2013.6544812 dblp:conf/icde/LeisK013 fatcat:sma67ydio5c5vpuok4axiruanu

An Indexing Approach for Representing Multimedia Objects in High-Dimensional Spaces Based on Expectation Maximization Algorithm [chapter]

Giuseppe Boccignone, Vittorio Caggiano, Carmine Cesarano, Vincenzo Moscato, Lucio Sansone
2005 Lecture Notes in Computer Science  
In this manner our tree provides a simple and practical solution to index clustered data and support efficient retrieval of the nearest neighbors in high dimensional object spaces.  ...  To this aim the EM algorithm has been modified in order to obtain at each step of its recursive application balanced clusters.  ...  An efficient index for a large data set, where data are described in high dimensional feature space, should allow to prune comparisons between data during the similarity search process by taking advantage  ... 
doi:10.1007/11551898_8 fatcat:z3zczsle6jeqbalg6l2lgvlkla

Efficient loopless generation of Gray codes for -ary trees

Limin Xiang, Kazuo Ushijima, Changjie Tang
2000 Information Processing Letters  
In this paper, another loopless algorithm is presented to list Gray codes for k-ary trees more efficiently in both space and time than the two former algorithms, and the algorithm is also conceptually  ...  Lett. 70 (1999) 7] to generate Gray codes for k-ary trees.  ...  Compared with the loopless algorithms to generate Gray codes for binary trees in [6] and for k-ary trees in [2] , ours is more efficient in both space and time, and also conceptually simpler than the  ... 
doi:10.1016/s0020-0190(00)00139-3 fatcat:glrgl73aobb4dninzhkoyoacgi

Survey on Sequential Pattern Mining Algorithms

V. ChandraShekharRao, P. Sammulal
2013 International Journal of Computer Applications  
Several efficient algorithms for maintaining sequential patterns have been developed. , old datasets are deleted while some other datasets are updated.  ...  Sequential pattern mining is a significant data-mining method for determining time-related behavior in sequence databases.  ...  Comparison of Time Complexity As from the comparison graph from fig. 4 , it is clear that both of the pattern growth algorithm, Freespan and Prefixspan are time efficient than Apriori based Algorithm.  ... 
doi:10.5120/13301-0782 fatcat:eee6r7dtbffmfphbb4y4shh3be

An FP Tree based Approach for Extracting Frequent Pattern from Large Database by Applying Parallel and Partition Projection

Jagrati Malviya, Anju Singh, Divakar Singh
2015 International Journal of Computer Applications  
This paper proposed an efficient and improved FP Tree algorithm which used a projection method to reduce the database scan and save the execution time.  ...  Experimental result showed that the improved PFP Tree algorithm performs faster than FP growth Tree algorithm and partition projection algorithm.  ...  In comparison with Apriori algorithm FP is much superior in case of efficiency. But problem with traditional FP is that it produces a huge number of conditional FP-Tree [14] .  ... 
doi:10.5120/20075-2077 fatcat:lyh7lucgxrhqlb4whfblmfficy

Present State-of-The-ART of Dynamic Association Rule Mining Algorithms

2019 VOLUME-8 ISSUE-10, AUGUST 2019, REGULAR ISSUE  
Many algorithms that are efficient to mine association rules are found in the existing literature, apriori-based and Pattern-Growth.  ...  When new instances are added to existing dataset that has been subjected to ARM, only those instances are to be used in order to go for incremental mining of rules instead of considering the whole dataset  ...  DELI (Difference Estimation for Large Item sets) An efficient algorithm [4] called DELI is proposed for an incremental ARM.  ... 
doi:10.35940/ijitee.a4107.119119 fatcat:zjwreedwxbhjfcu7jvojk2osii

GCUBE Indexing

Laxmaiah M, Govardhan A
2013 International Journal of Data Mining & Knowledge Management Process  
Providing spatial information to the data warehouse (DW); two major challenges faced are;1.Defining and Aggregation of Spatial/Continues values and 2.Representation, indexing, updating and efficient query  ...  It utilizes a standard comparison based sorting algorithm such as Quick sort and Merge sort comparison between (algorithm 2) that determines the relative order of two records on a Hilbert curve at particular  ...  Construct an index structure on top of the Ordered Data for efficient Query Processing [23, 1] .  ... 
doi:10.5121/ijdkp.2013.3406 fatcat:qwa66mbwonbgjh5zaxnzh6gqpy

Compact Tree Structures for Mining High Utility Itemsets

Anup Bhat, Harish Venkatarama, Geetha Maiya
2022 ˜The œinternational Arab journal of information technology  
Existing tree-based HUIM algorithms discard unpromising items and require at most two database scans for their construction.  ...  High Utility Item set Mining (HUIM) from large transaction databases has garnered significant attention as it accounts for the revenue of the items purchased in a transaction.  ...  The prime-based tree structures clearly consumed significantly lesser space in comparison to the remaining trees.  ... 
doi:10.34028/iajit/19/2/2 fatcat:ioj7zhhwyzdubjnceqmrij4v6a

Delta-K 2-tree for Compact Representation of Web Graphs [chapter]

Yu Zhang, Gang Xiong, Yanbing Liu, Mengya Liu, Ping Liu, Li Guo
2014 Lecture Notes in Computer Science  
In the literature, K 2 -tree can efficiently compress the web graphs while supporting fast querying in the compressed data.  ...  In addition, we design a node reordering algorithm to further improve the compression ratio. We compare our approach with the state-of-the-art algorithms, including K 2 -tree, WebGraph, and AD.  ...  Compression efficiency can be improved significantly by our nodes reordering method. Table 3 shows the comparison in memory space among K 2 -tree, WebGraph, AD and Delta-K 2 -tree.  ... 
doi:10.1007/978-3-319-11116-2_24 fatcat:u237d7hhdvedfc5bfrvaly7q74

AFOPT: An Efficient Implementation of Pattern Growth Approach

Guimei Liu, Hongjun Lu, Jeffrey Xu Yu, Wei Wang, Xiangye Xiao
2003 Workshop on Frequent Itemset Mining Implementations  
Existing pattern growth algorithms differ in several dimensions: (1) item search order; (2) conditional database representation; (3) conditional database construction strategy; and (4) tree traversal strategy  ...  Several adaptive algorithms were proposed to try to find good strategies for general situations.  ...  It is a fixed order-all the sub search spaces use the same order. Tree projection algorithm [15] and H-Mine algorithm [12] adopted this order.  ... 
dblp:conf/fimi/LiuLYWX03 fatcat:dut3c4dbyncrtpsjftldbrqxlu

Fixed-Point Arithmetic Line Clipping

Ramón Mollá Vayá, P. Jorquera, Roberto Vivó
2003 International Conference in Central Europe on Computer Graphics and Visualization  
The algorithm combines different partial solutions given in the bibliography such as implicit area codes, decision trees, line ends comparison, symmetry or avoiding redundant calculations, mixing them  ...  It may work in the fractional object space while still using integer arithmetic (fixed-point). It is faster than traditional algorithms.  ...  Dynamic monitoring has proven to be a good idea that can be exported to any other kind of algorithms in order to improve efficiency.  ... 
dblp:conf/wscg/MollaJV03 fatcat:323gzdpnrjbppbqcbje2btlacu

A Succinct Novel Searching Algorithm

Celine, Shinoj Robert, Maria Dominic
2021 International Journal of Advanced Computer Science and Applications  
This paper exhibits the new technique named the biform tree approach for producing the sorted order of elements and to perform efficient searching.  ...  For any tree representation, the sorted order is expected to achieve the best performance.  ...  The novel biform tree structure is a prerequisite for efficient searching and also for sorting the elements while doing the pre-order traversal over that tree. XI.  ... 
doi:10.14569/ijacsa.2021.0120577 fatcat:q62ckoqylvbltbdyuyqtatlrtq

Time- and space-optimality in B-trees

Arnold L. Rosenberg, Lawrence Snyder
1981 ACM Transactions on Database Systems  
A B-tree is compact if it is minimal in number of nodes, hence has optimal space utilization, among equally capacious B-trees of the same order.  ...  Compact B-trees can be as much as a factor of 2.5 more space efficient than visit-optimal B-trees; and the node-visit cost of a compact tree is never more than 1 + the node-visit cost of an optimal tree  ...  Brown of Yale for his helpful comments on an earlier version of this paper.  ... 
doi:10.1145/319540.319565 fatcat:bbha26yvcvhq3muwgpv2in56b4
« Previous Showing results 1 — 15 out of 262,644 results