registrieren | anmelden | FAQ      [?] 

Tag btree [14 articles]

Recent papers classified by the tag btree.
  • B-Tree Indexes and CPU Caches
    (2001), pp. 349-358.
    by Goetz Graefe, Per-&\#197;ke Larson
    posted to btree cache_conscious by myui on 2007-06-18 02:05:30 as ****
  • notes Bit-Tree: a data structure for fast file processing
    Commun. ACM, Vol. 35, No. 6. (June 1992), pp. 114-120.
    by David E Ferguson
    posted to btree index trie by myui on 2007-06-18 01:07:03 as **
  • Efficient locking for concurrent operations on B-trees
    ACM Trans. Database Syst., Vol. 6, No. 4. (December 1981), pp. 650-670.
    by Philip L Lehman, Bing
    posted to btree classic concurrent by myui on 2008-04-03 21:54:36 as read along with 3 people damaru epaulson bunge
  • Fast string searching in secondary storage: theoretical developments and experimental results
    (1996), pp. 373-382.
    by Paolo Ferragina, Roberto Grossi
    posted to btree disk fulltext refinement sb-tree by myui on 2007-08-17 20:38:04 as **
  • notes A compact B-tree
    (2002), pp. 533-541.
    by Peter Bumbulis, Ivan T Bowman
    posted to btree sb-tree string-index trie by myui on 2007-06-18 00:34:06 as ***
  • notes Main-memory index structures with fixed-size partial keys
    (2001), pp. 163-174.
    by Philip Bohannon, Peter Mcllroy, Rajeev Rastogi
    posted to btree by myui on 2007-08-13 04:53:59 as **
  • Concurrent cache-oblivious b-trees
    (2005), pp. 228-237.
    by Michael A Bender, Jeremy T Fineman, Seth Gilbert, Bradley C Kuszmaul
    posted to 2005 5 btree cache_conscious concurrent influential_paper by myui on 2008-04-03 21:58:35 as **
  • Fat-Btree: an update-conscious parallel directory structure
    Data Engineering, 1999. Proceedings., 15th International Conference on (1999), pp. 448-457.
    by H Yokota, Y Kanemasa, J Miyazaki
    posted to fat-btree btree by myui on 2008-09-23 19:07:20 as **
  • notes The string B-tree: a new data structure for string search in external memory and its applications
    J. ACM, Vol. 46, No. 2. (March 1999), pp. 236-280.
    by Paolo Ferragina, Roberto Grossi
    posted to btree fulltext sb-tree string-index trie by myui on 2007-04-15 19:36:13 as **** along with 1 person creswick
  • notes The evolution of effective B-tree: page organization and techniques: a personal account
    SIGMOD Rec., Vol. 30, No. 3. (September 2001), pp. 64-69.
    by David Lomet
    posted to btree summary by myui on 2007-06-19 05:18:43 as **
  • Cache-Conscious Concurrency Control of Main-Memory Indexes on Shared-Memory Multiprocessor Systems
    (2001), pp. 181-190.
    by Sang K Cha, Sangyong Hwang, Kihong Kim, Keunjoo Kwon
    posted to btree cache_conscious concurrency lock mmdb smp vldb by myui on 2008-06-27 03:51:19 as ***** along with 1 person ReiOdaira
  • An Efficient Buffer Management Scheme for Implementing a B-Tree on NAND Flash Memory
    Embedded Software and Systems (2007), pp. 181-192.
    by Hyun-Seob Lee, Sangwon Park, Ha-Joo Song, Dong-Ho Lee
    posted to btree flash master by dmeister on 2008-06-04 14:50:08 as read
  • R-Trees Have Grown Everywhere
    by Yannis Manolopoulos, Alexandros Nanopoulos, Apostolos N Papadopoulos, Yannis Theodoridis
    posted to algorithm btree by damaru on 2005-10-31 14:08:29 as ** along with 1 person and 1 group rahul SRL
  • The R -Tree: A Dynamic Index for Multi-Dimensional Objects
    (1987), pp. 507-518.
    by Timos K Sellis, Nick Roussopoulos, Christos Faloutsos
    posted to algorithm btree by damaru on 2005-10-31 14:08:01 as read along with 7 people and 1 group rahul collin_chu epaulson danieltruemper jpah scis BelliOS SRL
    • Bemerkung: Sie können diese Seite wie folgt zitieren: http://www.citeulike.org/tag/btree

    RIS BibTeX
    CiteULike organises scholarly (or academic) papers or literature and provides bibliographic (which means it makes bibliographies) for universities and higher education establishments. It helps undergraduates and postgraduates. People studying for PhDs or in postdoctoral (postdoc) positions. The service is similar in scope to EndNote or RefWorks or any other reference manager like BibTeX, but it is a social bookmarking service for scientists and humanities researchers.