52 Hits in 5.4 sec

Page 4536 of Mathematical Reviews Vol. , Issue 93h [page]

1993 Mathematical Reviews  
An index-sequential structure for high-performance sequential access. Acta Inform. 29 (1992), no. 3, 241-265. This paper introduces a variant of the B-tree structure, called an SB-tree.  ...  The SB-tree has the hierarchical node structure of a B*-tree. But it does not use sibling pointers for sequential access.  ... 

B-tries for disk-based string management

Nikolas Askitis, Justin Zobel
2008 The VLDB journal  
The B-tree, and its variants, are an efficient general-purpose diskbased data structure that is almost universally used for this task.  ...  The B-trie has the potential to be a competitive alternative for the storage of data where strings are used as keys, but has not previously been thoroughly described or tested.  ...  Acknowledgments This work was supported by the Australian Postgraduate Award, a scholarship from the Australian Research Council and the School of Computer Science and Information Technology at RMIT University  ... 
doi:10.1007/s00778-008-0094-1 fatcat:622pixpq5rc5xm6h4vj63vudey

CPS-tree: A Compact Partitioned Suffix Tree for Disk-based Indexing on Large Genome Sequences

Swee-Seong Wong, Wing-Kin Sung, Limsoon Wong
2007 2007 IEEE 23rd International Conference on Data Engineering  
Suffix tree is an important data structure for indexing a long sequence (like a genome sequence) or a concatenation of sequences.  ...  However, the performance of disk-based suffix tree is a concern as it is slowed down significantly by poor localized access resulting in high IO disk access.  ...  This is on par with the reported average performances of SB-tree and CPT.  ... 
doi:10.1109/icde.2007.369009 dblp:conf/icde/WongSW07 fatcat:6uqq6wfjtje5rkdunxbwkjk3zq

Incremental computation and maintenance of temporal aggregates

Jun Yang, Jennifer Widom
2003 The VLDB journal  
We introduce a new index structure called the SB-tree, which incorporates features from both segment-trees and B-trees.  ...  For materialized aggregate views in a temporal database or warehouse, we propose building and maintaining SB-tree indices instead of the views themselves.  ...  We thank Jeff Ullman for proposing the idea of JSB-trees as an alternative to dual SB-trees.  ... 
doi:10.1007/s00778-003-0107-z fatcat:vmn3c35mhrdj3fivnoygxnavjy

Incremental stock time series data delivery and visualization

Tak-chung Fu, Fu-lai Chung, Pui-ying Tang, Robert Luk, Chak-man Ng
2005 Proceedings of the 14th ACM international conference on Information and knowledge management - CIKM '05  
SB-Tree is a binary tree data structure proposed to represent time series according to the importance of data points.  ...  As new stock data are available continuously, an effective updating mechanism for SB-Tree is needed. In this paper, a comparative study of different updating approaches is reported.  ...  Accessing SB-Tree Given the required number of data points n, the SB-Tree is accessed recursively.  ... 
doi:10.1145/1099554.1099626 dblp:conf/cikm/FuCTLN05 fatcat:lxaoqav7yve6zgso4ed32aez4q

Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays [article]

Simon Gog, Alistair Moffat, J. Shane Culpepper, Andrew Turpin, and Anthony Wirth
2013 arXiv   pre-print
The suffix array is an efficient data structure for in-memory pattern search.  ...  Suffix arrays can also be used for external-memory pattern search, via two-level structures that use an internal index to identify the correct block of suffix pointers.  ...  [2] against previous data structures); with the SB-TREE; and with the FM-INDEX.  ... 
arXiv:1303.6481v1 fatcat:soh5dytslfezjffzutf6lwfxbi

Managing Frequent Updates in R-Trees for Update-Intensive Applications

Moon-Bae Song, H. Kitagawa
2009 IEEE Transactions on Knowledge and Data Engineering  
In this paper, we present an R-tree-based index structure (called R sb -tree, R-tree with semibulk loading) for efficiently managing frequent updates from massive moving objects.  ...  With a reasonable memory overhead (typically only 1 percent of the whole data set), the proposed approach far outperforms the previous works in terms of update and query performance as well in a realistic  ...  ACKNOWLEDGMENTS The authors would like to thank the anonymous reviewers for their constructive comments and suggestions that improved the quality of this paper.  ... 
doi:10.1109/tkde.2008.225 fatcat:o7g3zhsoxrg6fdr7ol5irvf7su


Manos Athanassoulis, Anastasia Ailamaki
2014 Proceedings of the VLDB Endowment  
To this end, we introduce approximate tree indexing, which employs probabilistic data structures (Bloom filters) to trade accuracy for size and produce smaller, yet powerful, tree indexes, which we name  ...  Indexing, however, is designed assuming HDD as secondary storage, thus minimizing random accesses at the expense of capacity.  ...  The authors would like to thank the anonymous reviewers for their valuable comments, feedback, and suggestions to improve the paper.  ... 
doi:10.14778/2733085.2733094 fatcat:l5gmujlrdnhrdmjexiubtk2iza

Recent progress on selected topics in database research — A report by nine young Chinese researchers working in the United States

Chen Zhiyuan, Li Chen, Jian Pei, Yufei Tao, Wang Haixun, Wei Wang, Jiong Yang, Jun Yang, Donghui Zhang
2003 Journal of Computer Science and Technology  
For the obvious reason, the authors are listed alphabetically, while the sections are arranged in the order of the author list.  ...  The study on database technologies, or more generally, the technologies of data and information management, is an important and active research field.  ...  [97] proposed a new index structure called Multi-version SB-tree (MVSB-tree) the solve the RTA problem in logarithmic time. Another problem is the Hierarchical Temporal Aggregation (HTA).  ... 
doi:10.1007/bf02947114 fatcat:q5zryrqmuffargpgyqcscwyb5i

The five-minute rule 20 years later (and how flash memory changes the rules)

Goetz Graefe
2009 Communications of the ACM  
26.3 64KB 2,240 11 1.07ms 10.3 figure 3: Pages and extents in an sB-tree.  ...  Using O'Neil's SB-trees (S meaning sequential), 256KB extents can be the units of transfer between flash memory and disk, whereas 4KB pages can be the unit of transfer between RAM and flash memory.  ... 
doi:10.1145/1538788.1538805 fatcat:xp7fshkosnbvjjd6ljdwy6cnsm

The Five-minute Rule 20 Years Later

Goetz Graefe
2008 Queue  
26.3 64KB 2,240 11 1.07ms 10.3 figure 3: Pages and extents in an sB-tree.  ...  Using O'Neil's SB-trees (S meaning sequential), 256KB extents can be the units of transfer between flash memory and disk, whereas 4KB pages can be the unit of transfer between RAM and flash memory.  ... 
doi:10.1145/1413254.1413264 fatcat:agyvtchklnf4zcl3fzttcbccda

The log-structured merge-tree (LSM-tree)

Patrick O'Neil, Edward Cheng, Dieter Gawlick, Elizabeth O'Neil
1996 Acta Informatica  
The Log-Structured Merge-tree (LSM-tree) is a disk-based data structure designed to provide low-cost indexing for a file experiencing a high rate of record inserts (and deletes) over an extended period  ...  High-performance transaction system applications typically insert rows in a History table to provide an activity trace; at the same time the transaction system generates log records for purposes of system  ...  Acknowledgments The authors would like to acknowledge the assistance of Jim Gray and Dave Lomet, both of whom read an early version of this paper and made valuable suggestions for improvement.  ... 
doi:10.1007/s002360050048 fatcat:hijclwh7avem5dmnvmdowci2bq

The five-minute rule twenty years later, and how flash memory changes the rules

Goetz Graefe
2007 Proceedings of the 3rd international workshop on Data management on new hardware - DaMoN '07  
transfer bandwidths, and it also applies to flash disks holding small pages appropriate for their fast access latency.  ...  Based on the characteristics of these software architectures, an argument is presented why operating systems and file systems on one hand and database systems on the other hand will best benefit from flash  ...  -Barb Peters, Lily Jow, Harumi Kuno, José Blakeley, Mehul Shah, and the reviewers suggested multiple improvements after reading earlier versions of this paper.  ... 
doi:10.1145/1363189.1363198 dblp:conf/damon/Graefe07 fatcat:ras2jov3ojb4pnvyihcqaet6vy

Adaptive Merging on Phase Change Memory [article]

Wojciech Macyna, Michal Kukowski
2022 arXiv   pre-print
It further improves the system performance by 20% for databases where search queries interleave with data modifications.  ...  Indexing is a well-known database technique used to facilitate data access and speed up query processing. Nevertheless, the construction and modification of indexes are very expensive.  ...  Since the framework has no impact on the performance, eAM works quite well in comparison to PAM with SB+tree and PAM with UB+tree.  ... 
arXiv:2204.01667v1 fatcat:sbbogciqzbhzzm4v5iugknnx5e

Efficient algorithms for large-scale temporal aggregation

Bongki Moon, I.F. Vega Lopez, V. Immanuel
2003 IEEE Transactions on Knowledge and Data Engineering  
Third, the parallel algorithm designed on a shared-nothing architecture achieves scalable performance by delivering nearly linear scale-up and speed-up, even at the presence of data skew.  ...  Second, for large-scale aggregations, the proposed algorithms can deal with a database that is substantially larger than the size of available memory.  ...  It was also supported by the Consejo Nacional de Ciencia y Tecnología, scholarship 117476. The authors assume all responsibility for the contents of the paper.  ... 
doi:10.1109/tkde.2003.1198403 fatcat:p56ex5sl2becxamjk7343uj6oy
« Previous Showing results 1 — 15 out of 52 results