Digital Symposium Collection 2000  

 
 
 
 
 
 

 
















Theodore Johnson

Squashing flat files flatter

Performance Measurements of Compressed Bitmap Indices

Publications

Note: Links lead to the DBLP on the Web.

Theodore Johnson

29 William DuMouchel , Chris Volinsky , Theodore Johnson, Corinna Cortes , Daryl Pregibon : Squashing Flat Files Flatter. KDD 1999 : 6-15

28 Flip Korn , Theodore Johnson, H. V. Jagadish : Range Selectivity Estimation for Continuous Attributes. SSDBM 1999 : 244-253

27 Theodore Johnson: Performance Measurements of Compressed Bitmap Indices. VLDB 1999 : 278-289

26 Theodore Johnson, Dennis Shasha : Some Approaches to Index Design for Cude Forests. IEEE Data Engineering Bulletin 22 (4): 22-30 (1999)

25 Theodore Johnson: Coarse Indices for a Tape-Based Data Warehouse. ICDE 1998 : 231-240

24 Theodore Johnson, Ivy Kwok , Raymond T. Ng : Fast Computation of 2-Dimensional Depth Contours. KDD 1998 : 224-228

23 Theodore Johnson, Tamraparni Dasu : Comparing Massive High-Dimensional Data Sets. KDD 1998 : 229-233

22 Theodore Johnson, Ethan L. Miller : Performance Measurements of Tertiary Storage Devices. VLDB 1998 : 50-61

21 Sharma Chakravarthy , Dong-Kweon Hong , Theodore Johnson: Real-Time Transaction Scheduling: A Framework for Synthesizing Static and Dynamic Factors. Real-Time Systems 14 (2): 135-170 (1998)

20 Theodore Johnson, Dennis Shasha : Some Approaches to Index Design for Cube Forest. Data Engineering Bulletin 20 (1): 27-35 (1997)

19 Daniel Barbará , William DuMouchel , Christos Faloutsos , Peter J. Haas , Joseph M. Hellerstein , Yannis E. Ioannidis , H. V. Jagadish , Theodore Johnson, Raymond T. Ng , Viswanath Poosala , Kenneth A. Ross , Kenneth C. Sevcik : The New Jersey Data Reduction Report. Data Engineering Bulletin 20 (4): 3-45 (1997)

18 Theodore Johnson, Krishna Harathi : A Prioritized Multiprocessor Spin Lock. IEEE Transactions on Parallel and Distributed Systems 8 (9): 926-933 (1997)

17 D. Hong , Sharma Chakravarthy , Theodore Johnson: Locking Based Concurrency Control for Integrated Real-Time Database Systems. RTDB 1996 : 138-143

16 Eric N. Hanson , Theodore Johnson: Selection Predicate Indexing for Active Databases Using Interval Skip Lists. IS 21 (3): 269-298 (1996)

15 Theodore Johnson, Timothy A. Davis , Steven M. Hadfield : A Concurrent Dynamic Task Graph. Parallel Computing 22 (2): 327-333 (1996)

14 Theodore Johnson: An Analytical Performance Model of Robotic Storage Libraries. Performance Evaluation 27/28 (4): 231-251 (1996)

13 Theodore Johnson: Approximate Analysis of Reader/Writer Queues. TSE 21 (3): 209-218 (1995)

12 Padmashree Krishna , Theodore Johnson: Index Replication in a Distributed B-tree. COMAD 1994 : 0-

11 Theodore Johnson, Dennis Shasha : 2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm. VLDB 1994 : 439-450

10 Sundeep Prakash , Yann-Hang Lee , Theodore Johnson: A Nonblocking Algorithm for Shared Queues Using Compare-and-Swap. IEEE Transactions on Computers 43 (5): 548-559 (1994)

9 D. Hong , Theodore Johnson, Sharma Chakravarthy : Real-Time Transaction Scheduling: A Cost Conscious Approach. SIGMOD Conference 1993 : 197-206

8 Theodore Johnson, Padmashree Krishna : Lazy Updates for Distributed Search Structure. SIGMOD Conference 1993 : 337-346

7 Theodore Johnson, Krishna Harathi : A Simple Correctness Proof of the MCS Contention-Free Lock. IPL 48 (5): 215-220 (1993)

6 Theodore Johnson, Dennis Shasha : B-Trees with Inserts and Deletes: Why Free-at-Empty Is Better Than Merge-at-Half. JCSS 47 (1): 45-76 (1993)

5 Theodore Johnson, Dennis Shasha : The Performance of Current B-Tree Algorithms. TODS 18 (1): 51-101 (1993)

4 Sunjay Talele , Theodore Johnson, Panos E. Livadas : Surface Reconstruction in Parallel. SPDP 1992 : 102-106

3 Theodore Johnson, Dennis Shasha : A Framework for the Performance Analysis of Concurrent B-tree Algorithms. PODS 1990 : 273-287

2 Theodore Johnson: Approximate Analysis of Reader and Writer Access to a Shared Resource. SIGMETRICS 1990 : 106-114

1 Theodore Johnson, Dennis Shasha : Utilization of B-trees with Inserts, Deletes and Modifies. PODS 1989 : 235-246



























Copyright(C) 2000 ACM