Register | Log in | FAQ      [?] 
Recent | Unread | Search | Authors | Tags | Export

ejones's btrees [22 articles]

Recent papers added to ejones's library classified by the tag btrees. You can also see everyone's btrees.
  • CST-Trees: Cache Sensitive T-Trees
    Advances in Databases: Concepts, Systems and Applications (2007), pp. 398-409.
    by Ig-Hoon Lee, Junho Shim, Sang-Goo Lee, Jonghoon Chun
    posted to btrees cache databases by ejones on 2008-01-16 20:27:55 as read
  • Organization and maintenance of large ordered indexes
    Acta Informatica, Vol. 1, No. 3. (1972), pp. 173-189.
    by R Bayer, EM Mccreight
    posted to btrees by ejones on 2007-12-18 18:02:49 as *
  • The input/output complexity of sorting and related problems
    Commun. ACM, Vol. 31, No. 9. (September 1988), pp. 1116-1127.
    by Alok Aggarwal, Jeffrey
    posted to btrees by ejones on 2007-12-18 17:40:41 as * along with 1 person dleinhaeuser
  • Improving index performance through prefetching
    (2001), pp. 235-246.
    by Shimin Chen, Phillip B Gibbons, Todd C Mowry
    posted to btrees cache by ejones on 2007-12-18 16:59:40 as **
  • Effect of node size on the performance of cache-conscious B+-trees
    SIGMETRICS Perform. Eval. Rev., Vol. 31, No. 1. (June 2003), pp. 283-294.
    by Richard A Hankins, Jignesh M Patel
    posted to btrees cache by ejones on 2007-12-18 16:38:08 as read
  • PATRICIA--Practical Algorithm To Retrieve Information Coded in Alphanumeric
    J. ACM, Vol. 15, No. 4. (October 1968), pp. 514-534.
    by Donald R Morrison
    posted to btrees by ejones on 2007-12-18 15:15:37 as ** along with 1 person sugarexpletive
  • Main memory indexing: the case for BD-tree
    Transactions on Knowledge and Data Engineering, Vol. 16, No. 7. (2004), pp. 870-874.
    by B Cui, BC Ooi, J Su, KL Tan
    posted to btrees by ejones on 2007-12-18 13:55:03 as read
  • The cost of cache-oblivious searching
    Foundations of Computer Science, 2003. Proceedings. 44th Annual IEEE Symposium on (October 2003), pp. 271-282.
    by MA Bender, GS Brodal, R Fagerberg, D Ge, Simai He, Haodung Hu, J Iacono, A López-Ortiz
    posted to btrees cache by ejones on 2007-12-18 13:40:27 as **
  • A Comparison of Cache Aware and Cache Oblivious Static Search Trees Using Program Instrumentation
    Experimental Algorithmics : From Algorithm Design to Robust and Efficient Software (2002), pp. 78-92.
    by Richard E Ladner, Ray Fortna, Bao-Hoang Nguyen
    posted to btrees by ejones on 2007-12-18 13:33:07 as read
  • Cache Conscious Indexing for Decision-Support in Main Memory
    (September 1999), pp. 78-89.
    by Jun Rao, Kenneth A Ross
    posted to btrees by ejones on 2007-12-18 13:09:56 as read
  • Self-adjusting binary search trees
    J. Assoc. Comput. Mach., Vol. 32, No. 3. (1985), pp. 652-686.
    by Daniel D Sleator, Robert E Tarjan
    posted to btrees by ejones on 2007-12-18 13:05:19 as * along with 3 people jburnim AbnerCYH calvins
  • Performance analysis of BSTs in system software
    (2004), pp. 410-411.
    by Ben Pfaff
    posted to btrees by ejones on 2007-12-18 13:01:44 as read
  • A Study of Index Structures for Main Memory Database Management Systems
    (August 1986), pp. 294-303.
    by Tobin J Lehman, Michael J Carey
    posted to btrees databases by ejones on 2007-12-18 12:51:13 as read
  • Intel 64 and IA-32 Architectures Optimization Reference Manual
    (November 2007)
    posted to btrees cpu-architecture by ejones on 2007-12-14 16:11:06 as read
  • A study of Erlang ETS table implementations and performance
    (2003), pp. 43-55.
    by Scott L Fritchie
  • Utilization of B-trees with inserts, deletes and modifies
    (1989), pp. 235-246.
    by T Johnson, D Shasha
    posted to btrees by ejones on 2007-12-07 17:34:33 as **
  • Efficient Tree Layout in a Multilevel Memory Hierarchy
    Algorithms - ESA 2002: 10th Annual European Symposium, Rome, Italy, September 17-21, 2002. Proceedings (2002), 165.
    by Michael A Bender, Erik D Demaine, Martin Farach-Colton
    posted to btrees cache by ejones on 2007-11-27 02:04:02 as **
  • Optimised Predecessor Data Structures for Internal Memory
    Algorithm Engineering: 5th International Workshop, WAE 2001 Aarhus, Denmark, August 28-31, 2001, Proceedings (2001), 67.
    by Naila Rahman, Richard Cole, Rajeev Raman
    posted to btrees cache by ejones on 2007-11-27 01:38:28 as **
  • Cache-conscious structure layout
    Vol. 34, No. 5. (May 1999), pp. 1-12.
    by Trishul M Chilimbi, Mark D Hill, James R Larus
    posted to btrees cache by ejones on 2007-11-27 01:05:19 as ** along with 1 person eraman
  • B-tree indexes and CPU caches
    Data Engineering, 2001. Proceedings. 17th International Conference on (2001), pp. 349-358.
    by G Graefe, PA Larson
    posted to btrees cache databases by ejones on 2007-11-27 01:00:42 as **
  • Algorithms for Memory Hierarchies: Advanced Lectures
    Vol. 2625/2003 (29 July 2003)
    edited by Ulrich Meyer, Peter Sanders, Jop Sibeyn
    posted to btrees cache by ejones on 2007-11-24 16:46:25 as **
  • Making B+- trees cache conscious in main memory
    SIGMOD Rec., Vol. 29, No. 2. (June 2000), pp. 475-486.
    by Jun Rao, Kenneth A Ross
    posted to btrees by ejones on 2007-11-20 02:51:41 as read along with 1 person takeha-e
  • Note: You may cite this page as: http://www.citeulike.org/user/ejones/tag/btrees

    RIS BibTeX RSS
    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.