LIST OF WRITTEN ARTICLES
MOST DOWNLOADS BELOW ARE IN PDF OR POSTCRIPT AS NOTED
Rabl, T., Poess, M., Jacobsen, H.-A., O'Neil, P., O’Neil, E, Variations of the Star Schema Benchmark to Test the Effects of Data Skew on Query Performance. Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering, Proceedings of the 4th ACM/SPEC International Conference on Performance Engineering (ICPE2013). Prague, Czech Republic, pp. 361-372, dl.acm.org/citation.cfm?id=2479927
Patrick O'Neil, Elizabeth (Betty) O'Neil, Xuedong Chen and Steve Revilak, The Star Schema Benchmark and Augmented Fact Table Indexing, Presentation at TPCTC (Transaction Processing Performance Council Technical Conference), Lyon, France, 2009. PDF Download Paper published in Springer Lecturea Notes in Computer Science (LCNS 5895): Performance Evaluation and Benchmarking, Revised Selected Papers from TPTC 2009, Edited by Raghunath Nambiar and Meikel Poess.
Xuedong Chen, Patrick O'Neil, and Elizabeth (Betty) O'Neil Adjoined Dimension Column Clustering to Improve Data Warehouse Query Performance, Poster presentation at ICDE08 (International Conference on Data Engineering), also in Proceedings, Cancun, Mexico, April 2008. PDF Download
With Alan Fekete, Dimitrios Liarokapis, Elizabeth (Betty) O'Neil , and Dennis Shasha, "Making Snapshot Isolation Serializable," PDF Download ACM TODS, Vol 30, No. 2, June 2005. This work was performed under the NSF Grant: "Isolation Testing in Transactional Systems".
With Elizabeth (Betty) O'Neil, Shankar Pal, Istvan Cseri, Gideon Schaller, Nigel Westbury (All at Microsoft), "ORDPATHs: Insert-Friendly XML Node Labels," Presented at the ACM SIGMOD Industrial Track, June 2004. PDF Download
With Alan Fekete, Elizabeth (Betty) O'Neil, A Read-Only Transaction Anomaly Under Snapshot Isolation, published in ACM SIGMOD Record, Vol. 33, No. 3, Sept. 2004. PDF Download This work was performed under the NSF Grant: "Isolation Testing in Transactional Systems".
With Elizabeth (Betty) O'Neil, Introductory Two Term Textbook on Database: "Database: Principles, Programming and Performance," 2001, Morgan-Kaufmann. Second Edition, Second Printing. For more information: Home Page for Database: Principles, Programming, Performance
With Peter Muth, Achim Pick, and Gerhard Weikum, "The LHAM Log-Structured History Data Access Method," VLDB Journal, Vol. 8, No. 3-4, February 2000, pp. 199-221. PDF Download This is an invited paper extending the paper of the VLDB Conference paper below by the same authors.
NSF Project, Isolation Testing Postscript Download of Grant Proposal
With Elizabeth (Betty) O'Neil, and Gerhard Weikum "An Optimality Proof of the LRU-K Page Replacement Algorithm". Journal of the ACM, January 1999, pp. 92-112. This paper contains a mathematical proof that the LRU-K algorithm, first introduced in a 1993 paper listed below, gives optimal behavior under reasonable assumptions of database page access. Postscript Download.
With Peter Muth, Achim Pick, and Gerhard Weikum, "Design, Implementation, and Performance of the LHAM Log-Structured History Data Access Method". Proceedings of 1998 VLDB Conference, pp.452-463. See later version in VLDBJ 2000, above.
Position paper for Seventh International Workshop on High Performance Transactions Systems, "Isolation Testing in Transactional Systems", presented September 1997.
With Dallan Quass, "Improved Query Performance With Variant Indexes", Proceedings of 1997 SIGMOD Conference, Tucson, Arizona, pp. 38-49. Abstract of SIGMOD paper, Postscript Download of SIGMOD talk slides, Postscript Download of SIGMOD paper, Postscript Download of EXTENDED paper.
Invited chapter, "Database Performance," The Computer Science and Engineering Handbook, Allen B. Tucker (Ed.), CRC Press, 1997, pp. 1078-1092.
Invited Chapter, "Database Systems," for 1997 Price Waterhouse Technology Forecast. I also wrote this chapter for the 1996 Forecast.
Position paper for Sixth International Workshop on High Performance Transactions Systems, "DSS Performance is Now More Significant than OLTP Performance," presented September 1995.
With Krithi Ramamritham, and Calton Pu, "A Two-Phase Approach to Predictably Scheduling Real-Time Transactions," Chapter 18 in "Performance of Concurrency Control Mechanisms in Centralized Database Systems," Vijay Kumar, Ed., Prentice Hall, Sept. 1995, pp. 494-522.
With Goetz Graefe, "Multi-table Joins Through Bitmapped Join Indices (PDF)" SIGMOD Record, September, 1995, pp. 8-11. This is a short announcement of a method of performing joins very efficiently by combining bitmaps with join indices.
With Hal Berenson, Phil Bernstein, Jim Gray, Jim Melton, and Elizabeth (Betty)O'Neil, "A Critique of ANSI SQL Isolation Levels". I presented this at the ACM SIGMOD Conference, May 1995, ACMSIGMOD Proceedings pp. 1-10. It has already had an important effect, since an isolation method introduced here for the first time, Snapshot Isolation, has been implemented by Oracle as their SERIALIZABLE isolation level.
Primary author with several co-authors, "Transaction Processing at Microsoft: Present and Future," Invited paper to the IEEE Bulletin on Data Engineering, March 1994, 45-50, Vol. 17, No. 1.
With Gerhard Weikum, "A Log-Structured History Data Access Method (LHAM)".Presented at the Fifth International Workshop on High-Performance Transaction Systems, September 1993.
With Edward Cheng, Dieter Gawlick, and Elizabeth (Betty) O'Neil, "The Log-Structured Merge-Tree," patent granted to Digital Equipment Corporation, December 1993; appeared in Acta Informatica 33, pp. 351-385, June 1996.
With Elizabeth (Betty) O'Neil and Gerhard Weikum, "The LRU-K Page-Replacement Algorithm for Database Disk Buffering," Presented at ACM SIGMOD Conference, May 1993, Washington, D.C, Proceedings pp. 296-306. This paper provides an algorithm that improves on the long-standing LRU algorithm for disk page buffering in databases. LRU-2 is now operating on several marketed systems. An implementation in C of the LRU-2 algorithm is available as follows: LRU-2 implementation download
"The SB-Tree: An Index-Sequential Structure for High-Performance Sequential Access," Acta Â Informatica, 29, pp. 241-265 (1992). A minor variant of this algorithm has been implemented for Microsoft SQL-Server.
"Promises," presented at the Fourth International High Performance Transactions Systems Conference, AsilomarCalifornia, September 1991.
"Deadlock Prediction for Escrow Transactions," Information Systems, V 16, No 1, 1991, pp. 13-20.
"The Set Query Benchmark": Chapter 6 in "The Benchmark Handbook for Database and Transaction Processing Systems", Jim Gray, Editor, Morgan Kauffmann, 1993, pp. 209-245. The paper can be donloaded in pdf form from: Set Query Benchmark The software to set up the benchmark is available as follows: Set Query download
With Jan Boman and Ethan Bolker, "The Combinatorial Radon Transform Modulo the Symmetric Group, "Advances in Applied Mathematics 12, pp. 400-411 (1991).
"A Set Query Benchmark for Large Databases," presented at the 1989 Conference of the Computer Measurement Group, December 1989.
"Revisiting DBMS Benchmarks," Article published in Datamation, September 15, 1989.
"MODEL 204 Architecture and Performance," presented at the Second International Workshop on High-Performance Transactions Systems, September1987, published in Springer-Verlag Lecture Notes in Computer Science 359, 1989, pp. 40-57.
"The Escrow Transactional Method," Presented at First Annual Workshop on High Performance Transaction Systems, September 1985, later published in ACM Transactions on Database Systems, V. 11, No. 4, December 1986,pp. 405-430. This has been an influential paper. I know of nearly 30 citations to the Escrow Transactions paper in the literature including a series of papers by different authors extending the Escrow method to database replication. Authors of these papers include: Theo Haerder, Akhil Kumar and Michael Stonebraker, N. Soparkar and Avi Silberschats, Daniel Barbar-Mill and Hector Garcia-Molina. The Escrow Transactional Method: PDF download.
TWELVE EARLIER PUBLICATIONS IN THE FIELD OF DISCRETE MATHEMATICS.
With M. Beeler, Some new van der Waerden numbers, Discrete Mathematics, V28, 1979, pp. 135-146.
Correction to a constructive decomposition and Fulkerson's characterization of permutation matrices, Discrete Mathematics, Vol. VII No 3-4, March 1975, pp.401-402.
With Elizabeth (Betty) O'Neil, A fast expected time algorithm for Boolean matrix multiplication and transitive closure, Information and Control, V 22 No 2, March 1973, pp. 132-138.
With P. Erdos, On a generalization of Ramsey Numbers, Discrete Mathematics, V 4 No 1, Jan. 1973, pp. 29-35.
Hyperplane cuts of an n-cube, Discrete Mathematics, V 1 No 2, Sept. 1971,pp. 193-195.
A constructive decomposition and Fulkerson's characterization of permutation matrices, Discrete Mathematics, V 1 No 2, Sept. 1971, pp. 197-201.
With M. Fischer, A. Meyer, and M. Paterson, A note on independence of a regularity-preserving operator, Newsletter on Automata Theory of the ACM, Jan.1970.
With D. Coppersmith, Optimal Paths in a two-parameter cost network, IBM Scientific Center Report No. 320-2048, 1970.
Asymptotics in random (0,1) matrices, Proc. Amer. Math. Soc., V 25, No 1,June 1970, pp. 39-45.
A new criterion for Uniform Distribution, Proc. Amer. Math. Soc., V 24 No 1,January 1970, pp. 1-5.
Asymptotics and random matrices with row-sum and column-sum restrictions, Bull. Amer. Math. Soc., V 75 No 6, pp. 1276-1282.
With T. S. Motzkin, Bounds assuring subsets in convex position, Jour. Comb. Th., V 3 No 3, pp. 252-255.