|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 457 occurrences of 287 keywords
|
|
|
|
|
Results
Found 438 publication records. Showing 438 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 5 | Chandra Prakash |
B-tree with fixed node size and no minimum degree.  |
Journal in Computer Virology  |
2007 |
DBLP DOI BibTeX RDF |
Byte, Prefix B-tree, String B-tree, B+-tree |
| 4 | Arnold L. Rosenberg, Lawrence Snyder |
Time- and Space-Optimality in B-Trees.  |
ACM Trans. Database Syst.  |
1981 |
DBLP DOI BibTeX RDF |
2, 3-tree, bushy B-tree, compact B-tree, node-visit cost, B-tree, space utilization |
| 3 | Gap-Joo Na, Sang-Won Lee, Bongki Moon |
Dynamic in-page logging for flash-aware B-tree index.  |
CIKM  |
2009 |
DBLP DOI BibTeX RDF |
in-page logging, flash memory, b+-tree |
| 3 | Xiaoyan Xiang, Lihua Yue, Zhanzhan Liu, Peng Wei |
A reliable B-tree implementation over flash memory.  |
SAC  |
2008 |
DBLP DOI BibTeX RDF |
IBSF, flash memory, B-tree, crash recovery, FTL |
| 3 | Chin-Hsien Wu, Tei-Wei Kuo, Li-Ping Chang |
An efficient B-tree layer implementation for flash-memory storage systems.  |
ACM Trans. Embedded Comput. Syst.  |
2007 |
DBLP DOI BibTeX RDF |
embedded systems, Flash memory, storage systems, database systems, B-tree |
| 3 | Hyun-Seob Lee, Sangwon Park, Ha-Joo Song, Dong-Ho Lee |
An Efficient Buffer Management Scheme for Implementing a B-Tree on NAND Flash Memory.  |
ICESS ![In: Embedded Software and Systems, [Third] International Conference, ICESS 2007, Daegu, Korea, May 14-16, 2007, Proceedings, pp. 181-192, 2007, Springer, 978-3-540-72684-5. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
BFTL, Buffer Management Scheme, Index, Flash Memory, B-Tree |
| 3 | Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soininen |
B-tree concurrency control and recovery in page-server database systems.  |
ACM Trans. Database Syst.  |
2006 |
DBLP DOI BibTeX RDF |
ARIES/CSA, callback locking, client-server database system, key-range locking, page server, partial rollback, physiological logging, sparse B-tree, structure modification, B-tree, cache consistency, ARIES, data shipping |
| 3 | Michael A. Bender, Jeremy T. Fineman, Seth Gilbert, Bradley C. Kuszmaul |
Concurrent cache-oblivious b-trees.  |
SPAA  |
2005 |
DBLP DOI BibTeX RDF |
cache-oblivious b-tree, concurrent b-tree, exponential tree, packed-memory array, lock free, non-blocking |
| 3 | Chin-Hsien Wu, Li-Pin Chang, Tei-Wei Kuo |
An Efficient B-Tree Layer for Flash-Memory Storage Systems.  |
RTCSA  |
2003 |
DBLP DOI BibTeX RDF |
Embedded Systems, Flash Memory, Storage Systems, Database Systems, B-Tree |
| 3 | Satoshi Watanabe, Takao Miura |
Reordering B-tree files.  |
SAC  |
2002 |
DBLP DOI BibTeX RDF |
B-tree, reordering, reorganization |
| 3 | Hongjun Lu, Yuet Yeung Ng, Zengping Tian |
T-Tree or B-Tree: Main Memory Database Index Structure Revisited.  |
Australasian Database Conference  |
2000 |
DBLP DOI BibTeX RDF |
T-tree, concurrency control, B-tree, main memory database, indexing techniques |
| 3 | Paolo Ferragina, Roberto Grossi |
The String B-tree: A New Data Structure for String Search in External Memory and Its Applications.  |
J. ACM  |
1999 |
DBLP DOI BibTeX RDF |
Patricia trie, prefix and range search, string searching and sorting, text index, suffix tree, B-tree, suffix array, external-memory data structure |
| 3 | Chris Plate, Jack Tan |
Performance Analysis of a Fault-Tolerant B-Tree ATM Switch. (PDF / PS)  |
LCN  |
1996 |
DBLP DOI BibTeX RDF |
fault-tolerant B-tree ATM switch, ATM switching fabrics, buffering methods, simulation, performance analysis, asynchronous transfer mode, asynchronous transfer mode, routing algorithm, ATM networks, traffic models, multiplexing, real-time traffic, computer industry, telecommunications industry, data packets |
| 3 | William Boswell, Alan L. Tharp |
Alternatives to the B+-Tree.  |
ICCI  |
1990 |
DBLP DOI BibTeX RDF |
bounded disorder, adaptive hashing, hashing, index structures, b+-tree |
| 2 | Guohui Li, Pei Zhao, Sheng Gao, Jianqiang Du |
F-KDB: An K-D-B Tree Implementation over Flash Memory.  |
CIT  |
2010 |
DBLP DOI BibTeX RDF |
K-D-B-tree, spatial data index, logging entries, logging buffer, node translate table |
| 2 | Jiangmiao Liao, Hu Chen, Yixia Yuan, Jianqing Xi |
Parallel Batch B+-tree Insertion on Multi-core Architectures.  |
FCST  |
2010 |
DBLP DOI BibTeX RDF |
batch insert, multi-core, index structures, parallel database, B+-tree |
| 2 | Michael A. Bender, Haodong Hu, Bradley C. Kuszmaul |
Performance guarantees for B-trees with different-sized atomic keys.  |
PODS  |
2010 |
DBLP DOI BibTeX RDF |
B-tree with different-sized keys, atomic keys, dynamic programming |
| 2 | |
B-Tree.  |
Encyclopedia of Database Systems  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | |
B-Tree Concurrency Control.  |
Encyclopedia of Database Systems  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Gap-Joo Na, Bongki Moon, Sang-Won Lee |
In-Page Logging B-Tree for Flash Memory.  |
DASFAA  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Tuukka Haapasalo, Ibrahim Jaluta, Bernhard Seeger, Seppo Sippu, Eljas Soisalon-Soininen |
Transactions on the multiversion B+-tree.  |
EDBT  |
2009 |
DBLP DOI BibTeX RDF |
|
| 2 | Yeim-Kuan Chang, Yung-Chieh Lin |
A Fast and Memory Efficient Dynamic IP Lookup Algorithm Based on B-Tree.  |
AINA  |
2009 |
DBLP DOI BibTeX RDF |
route update, B-tree, IP lookup |
| 2 | Pallavi Tadepalli, H. Conrad Cunningham |
Incrementally distributed B+ trees: approaches and challenges.  |
ACM Southeast Regional Conference  |
2009 |
DBLP DOI BibTeX RDF |
distributed B+ tree, grid nodes |
| 2 | 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 |
| 2 | Tomohiro Yoshihara, Dai Kobayashi, Haruo Yokota |
A concurrency control protocol for parallel B-tree structures without latch-coupling for explosively growing digital content.  |
EDBT  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Mohammad Behdadfar, Hossein Saidi |
The CPBT: A Method for Searching the Prefixes Using Coded Prefixes in B-Tree.  |
Networking  |
2008 |
DBLP DOI BibTeX RDF |
LMP, LPM, insert, delete, lookup, SMV |
| 2 | Su Chen, Beng Chin Ooi, Kian-Lee Tan, Mario A. Nascimento |
ST2B-tree: a self-tunable spatio-temporal b+-tree index for moving objects.  |
SIGMOD Conference  |
2008 |
DBLP DOI BibTeX RDF |
index tuning, moving object indexing, location-based services, data distribution, self-tuning |
| 2 | Matús Ondreicka, Jaroslav Pokorný |
Extending Fagin's Algorithm for More Users Based on Multidimensional B-Tree.  |
ADBIS  |
2008 |
DBLP DOI BibTeX RDF |
|
| 2 | Ilias K. Savvas, M. Tahar Kechadi |
Efficient Load Balancing on Irregular Network Topologies Using B+tree Structures.  |
ISPDC  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Gongye Zhou, Lanlan Yuan, Jincai Chen |
B+ Tree Management Method of Object Attributes for Object-Based Storage.  |
IEEE NAS  |
2007 |
DBLP DOI BibTeX RDF |
|
| 2 | Dongwon Kang, Dawoon Jung, Jeong-Uk Kang, Jin-Soo Kim |
mu-tree: an ordered index structure for NAND flash memory.  |
EMSOFT  |
2007 |
DBLP DOI BibTeX RDF |
index structure, NAND flash, B+-tree |
| 2 | Michael A. Bender, Martin Farach-Colton, Jeremy T. Fineman, Yonatan R. Fogel, Bradley C. Kuszmaul, Jelani Nelson |
Cache-oblivious streaming B-trees.  |
SPAA  |
2007 |
DBLP DOI BibTeX RDF |
buffered repository tree, cache-oblivious B-tree, cascading array, deamortized, lookahead array, shuttle tree |
| 2 | Yufei Tao, Xiaokui Xiao, Jian Pei |
Efficient Skyline and Top-k Retrieval in Subspaces.  |
IEEE Trans. Knowl. Data Eng.  |
2007 |
DBLP DOI BibTeX RDF |
B-tree, Skyline, top-k, subspace |
| 2 | Goetz Graefe |
B-tree indexes for high update rates.  |
SIGMOD Record  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Goetz Graefe |
B-tree indexes, interpolation search, and skew.  |
DaMoN  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Christian S. Jensen, Dalia Tiesyte, Nerius Tradisauskas |
Robust B+-Tree-Based Indexing of Moving Objects.  |
MDM  |
2006 |
DBLP DOI BibTeX RDF |
|
| 2 | Michael A. Bender, Martin Farach-Colton, Bradley C. Kuszmaul |
Cache-oblivious string B-trees.  |
PODS  |
2006 |
DBLP DOI BibTeX RDF |
cache oblivious string B-tree, locality preserving front compression, packed-memory array, rebalance, range query |
| 2 | Haibin Lu, Sartaj Sahni |
A B-Tree Dynamic Router-Table Design.  |
IEEE Trans. Computers  |
2005 |
DBLP DOI BibTeX RDF |
dynamic router-tables, highest-priority-range matching, nonintersecting ranges, B-trees, Packet routing, longest-prefix matching |
| 2 | S. Arash Ostadzadeh, M. Amir Moulavi, Zeinab Zeinalpour |
Massive Concurrent Deletion of Keys in B*-Tree.  |
PPAM  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Jen-Yi Wuu, Tung-Chieh Chen, Yao-Wen Chang |
SoC test scheduling using the B-tree based floorplanning technique.  |
ASP-DAC  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Xiaowei Sun, Rui Wang 0002, Betty Salzberg, Chendong Zou |
Online B-tree Merging.  |
SIGMOD Conference  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Dongseop Kwon, Taewon Lee, Sukho Lee |
Evaluating Mid-(k, n) Queries Using B+-Tree.  |
DEXA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | Toshiyuki Shimizu, Masatoshi Yoshikawa |
Full-Text and Structural XML Indexing on B+-Tree.  |
DEXA  |
2005 |
DBLP DOI BibTeX RDF |
|
| 2 | KyungOh Ohn, Haengrae Cho |
Maintaining Cache Coherency for B+ Tree Indexes in a Shared Disks Cluster.  |
VECPAR  |
2004 |
DBLP DOI BibTeX RDF |
Cluster and Grid Computing, Data Processing, Parallel and Distributed Computing |
| 2 | Haibin Lu, Sartaj K. Sahni |
A B-tree dynamic router-table design.  |
ISCC  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Meng-Chen Wu, Yao-Wen Chang |
Placement with Alignment and Performance Constraints Using the B*-Tree Representation.  |
ICCD  |
2004 |
DBLP DOI BibTeX RDF |
|
| 2 | Richard A. Hankins, Jignesh M. Patel |
Effect of node size on the performance of cache-conscious B+-trees.  |
SIGMETRICS  |
2003 |
DBLP DOI BibTeX RDF |
cache-conscious, index, B+-tree |
| 2 | Jin-Ho Kim, Ju-Young Kim, Sang-Wook Kim, Sooho Ok, Hi-Young Roh |
An Efficient Strategy for Adding Bulky Data into B+-Tree Indices in Information Retrieval Systems.  |
ICADL  |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | Peter Bumbulis, Ivan T. Bowman |
A compact B-tree.  |
SIGMOD Conference  |
2002 |
DBLP DOI BibTeX RDF |
|
| 2 | David B. Lomet |
The Evolution of Effective B-tree: Page Organization and Techniques: A Personal Account.  |
SIGMOD Record  |
2001 |
DBLP DOI BibTeX RDF |
|
| 2 | Goetz Graefe, Per-Ã…ke Larson |
B-Tree Indexes and CPU Caches.  |
ICDE  |
2001 |
DBLP DOI BibTeX RDF |
|
| 2 | Eugene Inseok Chong, Souripriya Das, Chuck Freiwald, Jagannathan Srinivasan, Aravind Yalamanchi, Mahesh Jagannath, Anh-Tuan Tran, Ramkumar Krishnan |
B+ Tree Indexes with Hybrid Row Identifiers in Oracle 8i.  |
ICDE  |
2001 |
DBLP DOI BibTeX RDF |
|
| 2 | Yi-He Jiang, Jianbang Lai, Ting-Chi Wang |
Module placement with pre-placed modules using the B*-tree representation.  |
ISCAS  |
2001 |
DBLP DOI BibTeX RDF |
|
| 2 | Jayant R. Haritsa, S. Seshadri |
Real-Time Index Concurrency Control.  |
IEEE Trans. Knowl. Data Eng.  |
2000 |
DBLP DOI BibTeX RDF |
index concurrency control, B-link tree, B-tree, Real-time database |
| 2 | June Sung Park, Varadharajan Sridhar |
Probabilistic Model and Optimal Reorganization of B+-Tree with Physical Clustering.  |
IEEE Trans. Knowl. Data Eng.  |
1997 |
DBLP DOI BibTeX RDF |
dynamic indexed files, physical database, VSAM, stochastic model of file dynamics, file reorganization, simulation, order statistics, B+-tree |
| 2 | Vincent T. Y. Ng, Tiko Kameda |
Concurrent access to point data. (PDF / PS)  |
COMPSAC  |
1997 |
DBLP DOI BibTeX RDF |
point data, B/sup +/-tree, K-D-B tree, d-dimensional space, lock coupling technique, common user operations, SR distributed programming language, relative performance, search, concurrency control, R-tree, insert, index structures, concurrent access, concurrent accesses, concurrency control algorithms |
| 2 | Michael Freeston |
A General Solution of the n-dimensional B-tree Problem.  |
SIGMOD Conference  |
1995 |
DBLP DOI BibTeX RDF |
|
| 2 | Lawrence W. West |
Postorder B-tree construction.  |
ACM Southeast Regional Conference  |
1992 |
DBLP DOI BibTeX RDF |
Algorithms, B-trees |
| 2 | 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 |
| 2 | Theodore Johnson, Dennis Shasha |
A Framework for the Performance Analysis of Concurrent B-tree Algorithms.  |
PODS  |
1990 |
DBLP DOI BibTeX RDF |
|
| 2 | Kemal Koymen |
KSAM: A B+-tree-based keyed sequential-access method.  |
AFIPS National Computer Conference  |
1984 |
DBLP DOI BibTeX RDF |
|
| 2 | John T. Robinson |
The K-D-B-Tree: A Search Structure For Large Multidimensional Dynamic Indexes.  |
SIGMOD Conference  |
1981 |
DBLP DOI BibTeX RDF |
|
| 2 | Philip L. Lehman, S. Bing Yao |
Efficient Locking for Concurrent Operations on B-Trees.  |
ACM Trans. Database Syst.  |
1981 |
DBLP DOI BibTeX RDF |
concurrenct algorithms, consistencey, index organizations, multiway search trees, database, data structures, concurrency controls, correctness, B-tree, locking protocols |
| 2 | David B. Lomet |
Multi-Table Search for B-Tree Files.  |
SIGMOD Conference  |
1979 |
DBLP DOI BibTeX RDF |
variable length, searching, B-trees, key compression |
| 2 | Nicholas J. Giordano, Marvin S. Schwarz |
Data Base Recovery at CMIC.  |
SIGMOD Conference  |
1976 |
DBLP DOI BibTeX RDF |
hot start, Leaf-First Rule, VSAM, data base recovery, hard crash, on-line data base, program restart, reload and restore, soft crash, track splitting, transaction, B-tree, audit trail |
| 1 | Goetz Graefe |
A survey of B-tree logging and recovery techniques.  |
ACM Trans. Database Syst.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hongchan Roh, Sanghyun Park, Sungho Kim, Mincheol Shin, Sang-Won Lee |
B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives  |
CoRR  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Barry Crabtree, Steve Appleby, Mike Nilsson, Chris Ormston, Rory Turnbull, Adastral Park |
Fiel trial of Quality driven Video Streaming.  |
CCNC  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hongchan Roh, Sanghyun Park, Sungho Kim, Mincheol Shin, Sang-Won Lee |
B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives.  |
PVLDB  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Goetz Graefe |
Modern B-Tree Techniques.  |
Foundations and Trends in Databases  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Quoc Cuong To, Tran Khanh Dang, Josef Küng |
Bob-Tree: An Efficient B + -Tree Based Index Structure for Geographic-Aware Obfuscation.  |
ACIIDS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Goetz Graefe, Harumi A. Kuno |
Modern B-tree techniques.  |
ICDE  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ferenc Havasi |
An Improved B+ Tree for Flash File Systems.  |
SOFSEM  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin V. Jørgensen, René B. Rasmussen, Simonas Saltenis, Carsten Schjønning |
FB-tree: a B+-tree for flash-based SSDs.  |
IDEAS  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hua-Wei Fang, Mi-Yen Yeh, Pei-Lun Suei, Tei-Wei Kuo |
A flash-friendly B+-tree with endurance-awareness.  |
ESTImedia  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Krzysztof Kaczmarski |
Experimental B+-tree for GPU.  |
ADBIS  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Matus Ondreicka |
Top-k Searching for More Users in Multidimensional B-tree with Lists.  |
ADBIS  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Ignacio Laguna, Todd Gamblin, Bronis R. de Supinski, Saurabh Bagchi, Greg Bronevetsky, Dong H. Ahn, Martin Schulz, Barry Rountree |
Large scale debugging of parallel tasks with AutomaDeD.  |
SC  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Cui Yu, James Bailey, Julian Montefusco, Rui Zhang 0003, Jiling Zhong |
Enhancing the B+-tree by dynamic node popularity caching.  |
Inf. Process. Lett.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Khadija Rasul, Nujhat Nuerie, Al-Sakib Khan Pathan |
Securing Wireless Sensor Networks with An Efficient B+ Tree-Based Key Management Scheme.  |
IJCNIS  |
2010 |
DBLP BibTeX RDF |
|
| 1 | R. Dinesh, D. S. Guru |
Concept of Triangular Spatial Relationship and B-Tree for Partially Occluded Object Recognition: an Efficient and Robust Approach.  |
Int. J. Image Graphics  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Goetz Graefe |
A survey of B-tree locking techniques.  |
ACM Trans. Database Syst.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Hyun-Seob Lee, Dong-Ho Lee |
An efficient index buffer management scheme for implementing a B-tree on NAND flash memory.  |
Data Knowl. Eng.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu |
Efficient B-tree Based Indexing for Cloud Data Processing.  |
PVLDB  |
2010 |
DBLP BibTeX RDF |
|
| 1 | Sai Tung On, Haibo Hu, Yu Li, Jianliang Xu |
Flash-Optimized B+-Tree.  |
J. Comput. Sci. Technol.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jordi Nin, Anne Laurent, Pascal Poncelet |
Speed up gradual rule mining from stream data! A B-Tree and OWA-based approach.  |
J. Intell. Inf. Syst.  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiangtao Cui, Zhiyong An, Yong Guo, Shuisheng Zhou |
Efficient nearest neighbor query based on extended B+-tree in high-dimensional space.  |
Pattern Recognition Letters  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Jiangtao Cui, Bin Xiao, Zhiliang Yin |
Speed up Linear Scan in High-Dimensions Using Extended B+-Tree.  |
DBTA  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Chang Xu, Lidan Shou, Gang Chen, Cheng Yan, Tianlei Hu |
Update Migration: An Efficient B+ Tree for Flash Storage.  |
DASFAA  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Nobuhiko Matsuura, Hiroshi Mineno, Norihiro Ishikawa, Tadanori Mizuno |
Evaluation of B+Tree-Based Multi-dimensional Range Search Algorithm for P2P Networks.  |
SAINT  |
2010 |
DBLP DOI BibTeX RDF |
multi-dimensional search, wireless sensor network, P2P, range search |
| 1 | Gang Luo |
V Locking Protocol for Materialized Aggregate Join Views on B-Tree Indices.  |
WAIM  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Rize Jin, Tae-Sun Chung |
Node Compression Techniques Based on Cache-Sensitive B+-Tree.  |
ACIS-ICIS  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Yi-Hua E. Yang, Viktor K. Prasanna |
High throughput and large capacity pipelined dynamic search tree on FPGA.  |
FPGA  |
2010 |
DBLP DOI BibTeX RDF |
2-3 tree, in-place update, ip forwarding, pipelined tree, b-tree, dynamic update, incremental update, openflow |
| 1 | J. Gregory Malecha, Greg Morrisett, Avraham Shinnar, Ryan Wisnesky |
Toward a verified relational database management system.  |
POPL  |
2010 |
DBLP DOI BibTeX RDF |
relational model, dependent types, separation logic, b+ tree |
| 1 | Fumiaki Sato |
Evaluation of the Structured Bloom Filter.  |
CISIS  |
2010 |
DBLP DOI BibTeX RDF |
P2P, DHT, Bloom filters, B-tree |
| 1 | Yeim-Kuan Chang, Yung-Chieh Lin, Cheng-Chien Su |
Dynamic Multiway Segment Tree for IP Lookups and the Fast Pipelined Search Engine.  |
IEEE Trans. Computers  |
2010 |
DBLP DOI BibTeX RDF |
elementary interval, FPGA, pipeline, B-tree, Segment tree |
| 1 | Cheng-Wu Lin, Jai-Ming Lin, Chun-Po Huang, Soon-Jyh Chang |
Performance-driven analog placement considering boundary constraint.  |
DAC  |
2010 |
DBLP DOI BibTeX RDF |
analog placement, boundary constraint, symmetry |
| 1 | Goetz Graefe, Harumi A. Kuno |
Self-selecting, self-tuning, incrementally optimized indexes.  |
EDBT  |
2010 |
DBLP DOI BibTeX RDF |
adaptive, autonomic, query execution, database index |
| 1 | Torsten Grust, Manuel Mayr, Jan Rittinger |
Let SQL drive the XQuery workhorse (XQuery join graph isolation).  |
EDBT  |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhenjie Zhang, Marios Hadjieleftheriou, Beng Chin Ooi, Divesh Srivastava |
Bed-tree: an all-purpose index structure for string similarity search based on edit distance.  |
SIGMOD Conference  |
2010 |
DBLP DOI BibTeX RDF |
similarity search, range query, edit distance, string, top-k query, approximate join |
Displaying result #1 - #100 of 438 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ >>] |
|