Sample Data

A.3 Sample Data

In this section we provide sample data for each of the relations defined in the previous section.

building

room number capacity

Figure A.3 The classroom relation.

dept name

Comp. Sci. Taylor

Elec. Eng.

Figure A.4 The department relation.

A.3 Sample Data 1277

course id title dept name credits BIO-101

4 BIO-301

Intro. to Biology Biology

4 BIO-399

Genetics Biology

3 CS-101

Computational Biology Biology

4 CS-190

Intro. to Computer Science Comp. Sci.

4 CS-315

Game Design Comp. Sci.

3 CS-319

Robotics Comp. Sci.

3 CS-347

Image Processing Comp. Sci.

3 EE-181

Database System Concepts Comp. Sci.

3 FIN-201

Intro. to Digital Systems Elec. Eng.

3 HIS-351

Investment Banking Finance

3 MU-199

World History History

3 PHY-101 Physical Principles

Music Video Production

Music

Physics

Figure A.5 The course relation.

salary 10101 Srinivasan Comp. Sci. 65000

ID name

dept name

95000 32343 El Said

Comp. Sci. 75000 58583 Califieri

Comp. Sci. 92000 98345 Kim

Elec. Eng.

Figure A.6 The instructor relation.

1278 Appendix A Detailed University Schema

room number time slot id BIO-101

course id

sec id semester

year

building

B BIO-301

1 Summer 2009 Painter

A CS-101

1 Summer 2010 Painter

H CS-101

F CS-190

E CS-190

A CS-315

D CS-319

B CS-319

C CS-347

A EE-181

C FIN-201

B HIS-351

C MU-199

D PHY-101

Figure A.7 The section relation.

ID course id

sec id semester

Figure A.8 The teaches relation.

A.3 Sample Data 1279

tot cred 00128 Zhang

ID name

dept name

102 12345 Shankar

Comp. Sci.

32 19991 Brandt

Comp. Sci.

46 54321 Williams Comp. Sci.

Comp. Sci.

60 98765 Bourikas Elec. Eng.

Elec. Eng.

Figure A.9 The student relation.

grade 00128 CS-101

ID course id sec id semester

year

2009 A 00128 CS-347

1 Fall

2009 A- 12345 CS-101

1 Fall

2009 C 12345 CS-190

1 Fall

2009 A 12345 CS-315

2 Spring

2010 A 12345 CS-347

1 Spring

2009 A 19991 HIS-351

1 Fall

2010 B 23121 FIN-201

1 Spring

2010 C+ 44553 PHY-101

1 Spring

2009 B- 45678 CS-101

1 Fall

2009 F 45678 CS-101

1 Fall

2010 B+ 45678 CS-319

1 Spring

2010 B 54321 CS-101

1 Spring

2009 A- 54321 CS-190

1 Fall

2009 B+ 55739 MU-199

2 Spring

2010 A- 76543 CS-101

1 Spring

2009 A 76543 CS-319

1 Fall

2010 A 76653 EE-181

2 Spring

2009 C 98765 CS-101

1 Spring

2009 C- 98765 CS-315

1 Fall

2010 B 98988 BIO-101

1 Spring

1 Summer 2009 A 98988 BIO-301

1 Summer 2010 null

Figure A.10 The takes relation.

1280 Appendix A Detailed University Schema

i id 00128 45565

s id

Figure A.11 The advisor relation.

time slot id day start time end time

A F 8:00 8:50

B F 9:00 9:50

C F 11:00 11:50

D F 13:00 13:50

G F 16:00 16:50

Figure A.12 The time slot relation.

A.3 Sample Data 1281

course id prereq id BIO-301

Figure A.13 The prereq relation.

time slot id day start hr start min end hr end min

Figure A.14 The time slot relation with start and end time separated into hour and minute.

This page intentionally left blank

Bibliography

[Abadi 2009]

D. Abadi, “Data Management in the Cloud: Limitations and Oppor- tunities”, Data Engineering Bulletin, Volume 32, Number 1 (2009), pages 3–12.

[Abadi et al. 2008]

D. J. Abadi, S. Madden, and N. Hachem, “Column-stores vs. row-stores: how different are they really?”, In Proc. of the ACM SIGMOD Conf. on Management of Data (2008), pages 967–980.

[Abiteboul et al. 1995]

S. Abiteboul, R. Hull, and V. Vianu, Foundations of Databases, Addison Wesley (1995).

[Abiteboul et al. 2003]

S. Abiteboul, R. Agrawal, P. A. Bernstein, M. J. Carey, et al. “The Lowell Database Research Self Assessment” (2003).

[Acheson et al. 2004]

A. Acheson, M. Bendixen, J. A. Blakeley, I. P. Carlin, E. Er- san, J. Fang, X. Jiang, C. Kleinerman, B. Rathakrishnan, G. Schaller, B. Sezgin, R. Venkatesh, and H. Zhang, “Hosting the .NET Runtime in Microsoft SQL Server”, In Proc. of the ACM SIGMOD Conf. on Management of Data (2004), pages 860–865.

[Adali et al. 1996]

S. Adali, K. S. Candan, Y. Papakonstantinou, and V. S. Subrah- manian, “Query Caching and Optimization in Distributed Mediator Systems”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1996), pages 137–148.

[Adya et al. 2007]

A. Adya, J. A. Blakeley, S. Melnik, and S. Muralidhar, “Anatomy of the ADO.NET entity framework”, In Proc. of the ACM SIGMOD Conf. on Man- agement of Data (2007), pages 877–888.

[Agarwal et al. 1996]

S. Agarwal, R. Agrawal, P. M. Deshpande, A. Gupta, J. F. Naughton, R. Ramakrishnan, and S. Sarawagi, “On the Computation of Multi- dimensional Attributes”, In Proc. of the International Conf. on Very Large Databases (1996), pages 506–521.

[Agrawal and Srikant 1994]

R. Agrawal and R. Srikant, “Fast Algorithms for Min- ing Association Rules in Large Databases”, In Proc. of the International Conf. on Very Large Databases (1994), pages 487–499.

1284 Bibliography [Agrawal et al. 1992]

R. Agrawal, S. P. Ghosh, T. Imielinski, B. R. Iyer, and A. N. Swami, “An Interval Classifier for Database Mining Applications”, In Proc. of the International Conf. on Very Large Databases (1992), pages 560–573.

[Agrawal et al. 1993a]

R. Agrawal, T. Imielinski, and A. Swami, “Mining Associa- tion Rules between Sets of Items in Large Databases”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1993).

[Agrawal et al. 1993b]

R. Agrawal, T. Imielinski, and A. N. Swami, “Database Min- ing: A Performance Perspective”, IEEE Transactions on Knowledge and Data Engineer- ing , Volume 5, Number 6 (1993), pages 914–925.

[Agrawal et al. 2000]

S. Agrawal, S. Chaudhuri, and V. R. Narasayya, “Automated Selection of Materialized Views and Indexes in SQL Databases”, In Proc. of the International Conf. on Very Large Databases (2000), pages 496–505.

[Agrawal et al. 2002]

S. Agrawal, S. Chaudhuri, and G. Das, “DBXplorer: A System for Keyword-Based Search over Relational Databases”, In Proc. of the International Conf. on Data Engineering (2002).

[Agrawal et al. 2004]

S. Agrawal, S. Chaudhuri, L. Kollar, A. Marathe, V. Narasayya, and M. Syamala, “Database Tuning Advisor for Microsoft SQL Server 2005”, In Proc. of the International Conf. on Very Large Databases (2004).

[Agrawal et al. 2009]

R. Agrawal, A. Ailamaki, P. A. Bernstein, E. A. Brewer, M. J. Carey, S. Chaudhuri, A. Doan, D. Florescu, M. J. Franklin, H. Garcia-Molina, J. Gehrke, L. Gruenwald, L. M. Haas, A. Y. Halevy, J. M. Hellerstein, Y. E. Ioan- nidis, H. F. Korth, D. Kossmann, S. Madden, R. Magoulas, B. C. Ooi, T. O^Reilly, R. Ramakrishnan, S. Sarawagi, and G. W. Michael Stonebraker, Alexander S. Sza- lay, “The Claremont Report on Database Research”, Communications of the ACM, Volume 52, Number 6 (2009), pages 56–65.

[Ahmed et al. 2006]

R. Ahmed, A. Lee, A. Witkowski, D. Das, H. Su, M. Za¨ıt, and T. Cruanes, “Cost-Based Query Transformation in Oracle”, In Proc. of the Interna- tional Conf. on Very Large Databases (2006), pages 1026–1036.

[Aho et al. 1979a]

A. V. Aho, C. Beeri, and J. D. Ullman, “The Theory of Joins in Relational Databases”, ACM Transactions on Database Systems, Volume 4, Number 3 (1979), pages 297–314.

[Aho et al. 1979b]

A. V. Aho, Y. Sagiv, and J. D. Ullman, “Equivalences among Relational Expressions”, SIAM Journal of Computing, Volume 8, Number 2 (1979), pages 218–246.

[Ailamaki et al. 2001]

A. Ailamaki, D. J. DeWitt, M. D. Hill, and M. Skounakis, “Weaving Relations for Cache Performance”, In Proc. of the International Conf. on

Very Large Databases (2001), pages 169–180.

[Alonso and Korth 1993]

R. Alonso and H. F. Korth, “Database System Issues in Nomadic Computing”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1993), pages 388–392.

Bibliography 1285

[Amer-Yahia et al. 2004]

S. Amer-Yahia, C. Botev, and J. Shanmugasundaram, “TeXQuery: A Full-Text Search Extension to XQuery”, In Proc. of the International

World Wide Web Conf. (2004).

[Anderson et al. 1992]

D. P. Anderson, Y. Osawa, and R. Govindan, “A File System for Continuous Media”, ACM Transactions on Database Systems, Volume 10, Number 4 (1992), pages 311–337.

[Anderson et al. 1998]

T. Anderson, Y. Breitbart, H. F. Korth, and A. Wool, “Repli- cation, Consistency and Practicality: Are These Mutually Exclusive?”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1998).

[ANSI 1986]

American National Standard for Information Systems: Database Language SQL . American National Standards Institute (1986).

[ANSI 1989]

Database Language SQL with Integrity Enhancement, ANSI X3, 135–1989 . American National Standards Institute, New York (1989).

[ANSI 1992]

Database Language SQL, ANSI X3,135–1992 . American National Stan- dards Institute, New York (1992).

[Antoshenkov 1995]

G. Antoshenkov, “Byte-aligned Bitmap Compression (poster abstract)”, In IEEE Data Compression Conf. (1995).

[Appelt and Israel 1999]

D. E. Appelt and D. J. Israel, “Introduction to Information Extraction Technology”, In Proc. of the International Joint Conferences on Artificial Intelligence (1999).

[Apt and Pugin 1987]

K. R. Apt and J. M. Pugin, “Maintenance of Stratified Database Viewed as a Belief Revision System”, In Proc. of the ACM Symposium on Principles of Database Systems (1987), pages 136–145.

[Armstrong 1974]

W. W. Armstrong, “Dependency Structures of Data Base Rela- tionships”, In Proc. of the 1974 IFIP Congress (1974), pages 580–583.

[Astrahan et al. 1976]

M. M. Astrahan, M. W. Blasgen, D. D. Chamberlin, K. P. Eswaran, J. N. Gray, P. P. Griffiths, W. F. King, R. A. Lorie, P. R. McJones, J. W. Mehl, G. R. Putzolu, I. L. Traiger, B. W. Wade, and V. Watson, “System R, A Relational Ap- proach to Data Base Management”, ACM Transactions on Database Systems, Volume 1, Number 2 (1976), pages 97–137.

[Atreya et al. 2002]

M. Atreya, B. Hammond, S. Paine, P. Starrett, and S. Wu, Digital Signatures , RSA Press (2002).

[Atzeni and Antonellis 1993]

P. Atzeni and V. D. Antonellis, Relational Database Theory , Benjamin Cummings (1993).

[Baeza-Yates and Ribeiro-Neto 1999]

R. Baeza-Yates and B. Ribeiro-Neto, Modern Information Retrieval , Addison Wesley (1999).

[Bancilhon et al. 1989]

F. Bancilhon, S. Cluet, and C. Delobel, “A Query Language for the O 2 Object-Oriented Database”, In Proc. of the Second Workshop on Database Programming Languages (1989).

1286 Bibliography [Baras et al. 2005]

A. Baras, D. Churin, I. Cseri, T. Grabs, E. Kogan, S. Pal, M. Rys, and O. Seeliger. “Implementing XQuery in a Relational Database System” (2005).

[Baru et al. 1995]

C. Baru et al., “DB2 Parallel Edition”, IBM Systems Journal, Volume 34, Number 2 (1995), pages 292–322.

[Bassiouni 1988]

M. Bassiouni, “Single-site and Distributed Optimistic Protocols for Concurrency Control”, IEEE Transactions on Software Engineering, Volume SE-14, Number 8 (1988), pages 1071–1080.

[Batini et al. 1992]

C. Batini, S. Ceri, and S. Navathe, Database Design: An Entity- Relationship Approach , Benjamin Cummings (1992).

[Bayer 1972]

R. Bayer, “Symmetric Binary B-trees: Data Structure and Maintenance Algorithms”, Acta Informatica, Volume 1, Number 4 (1972), pages 290–306.

[Bayer and McCreight 1972]

R. Bayer and E. M. McCreight, “Organization and Maintenance of Large Ordered Indices”, Acta Informatica, Volume 1, Number 3 (1972), pages 173–189.

[Bayer and Schkolnick 1977]

R. Bayer and M. Schkolnick, “Concurrency of Oper- ating on B-trees”, Acta Informatica, Volume 9, Number 1 (1977), pages 1–21.

[Bayer and Unterauer 1977]

R. Bayer and K. Unterauer, “Prefix B-trees”, ACM Transactions on Database Systems , Volume 2, Number 1 (1977), pages 11–26.

[Bayer et al. 1978]

R. Bayer, R. M. Graham, and G. Seegmuller, editors, Operating Systems: An Advanced Course , Springer Verlag (1978).

[Beckmann et al. 1990]

N. Beckmann, H. P. Kriegel, R. Schneider, and B. Seeger, “The R ∗ -tree: An Efficient and Robust Access Method for Points and Rectangles”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1990), pages 322–331.

[Beeri et al. 1977]

C. Beeri, R. Fagin, and J. H. Howard, “A Complete Axiomatiza- tion for Functional and Multivalued Dependencies”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1977), pages 47–61.

[Bentley 1975]

J. L. Bentley, “Multidimensional Binary Search Trees Used for Asso- ciative Searching”, Communications of the ACM, Volume 18, Number 9 (1975), pages 509–517.

[Berenson et al. 1995]

H. Berenson, P. Bernstein, J. Gray, J. Melton, E. O’Neil, and P. O’Neil, “A Critique of ANSI SQL Isolation Levels”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1995), pages 1–10.

[Bernstein and Goodman 1981]

P. A. Bernstein and N. Goodman, “Concurrency Control in Distributed Database Systems”, ACM Computing Survey, Volume 13, Number 2 (1981), pages 185–221.

[Bernstein and Newcomer 1997]

P. A. Bernstein and E. Newcomer, Principles of Transaction Processing , Morgan Kaufmann (1997).

Bibliography 1287

[Bernstein et al. 1998]

P. Bernstein, M. Brodie, S. Ceri, D. DeWitt, M. Franklin, H. Garcia-Molina, J. Gray, J. Held, J. Hellerstein, H. V. Jagadish, M. Lesk, D. Maier, J. Naughton, H. Pirahesh, M. Stonebraker, and J. Ullman, “The Asilomar Report on Database Research”, ACM SIGMOD Record, Volume 27, Number 4 (1998).

[Berson et al. 1995]

S. Berson, L. Golubchik, and R. R. Muntz, “Fault Tolerant De- sign of Multimedia Servers”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1995), pages 364–375.

[Bhalotia et al. 2002]

G. Bhalotia, A. Hulgeri, C. Nakhe, S. Chakrabarti, and S. Su- darshan, “Keyword Searching and Browsing in Databases using BANKS”, In Proc.

of the International Conf. on Data Engineering (2002).

[Bharat and Henzinger 1998]

K. Bharat and M. R. Henzinger, “Improved Algo- rithms for Topic Distillation in a Hyperlinked Environment”, In Proc. of the ACM SIGIR Conf. on Research and Development in Information Retrieval (1998), pages 104– 111.

[Bhattacharjee et al. 2003]

B. Bhattacharjee, S. Padmanabhan, T. Malkemus, T. Lai, L. Cranston, and M. Huras, “Efficient Query Processing for Multi-Dimensionally Clustered Tables in DB2”, In Proc. of the International Conf. on Very Large Databases (2003), pages 963–974.

[Biskup et al. 1979]

J. Biskup, U. Dayal, and P. A. Bernstein, “Synthesizing Inde- pendent Database Schemas”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1979), pages 143–152.

[Bitton et al. 1983]

D. Bitton, D. J. DeWitt, and C. Turbyfill, “Benchmarking Database Systems: A Systematic Approach”, In Proc. of the International Conf. on Very Large Databases (1983).

[Blakeley 1996]

J. A. Blakeley, “Data Access for the Masses through OLE DB”, In

Proc. of the ACM SIGMOD Conf. on Management of Data (1996), pages 161–172.

[Blakeley and Pizzo 2001]

J. A. Blakeley and M. Pizzo, “Enabling Component Databases with OLE DB”, In K. R. Dittrich and A. Geppert, editors, Component Database Systems , Morgan Kaufmann Publishers (2001), pages 139–173.

[Blakeley et al. 1986]

J. A. Blakeley, P. Larson, and F. W. Tompa, “Efficiently Up- dating Materialized Views”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1986), pages 61–71.

[Blakeley et al. 2005]

J. A. Blakeley, C. Cunningham, N. Ellis, B. Rathakrishnan, and M.-C. Wu, “Distributed/Heterogeneous Query Processing in Microsoft SQL Server”, In Proc. of the International Conf. on Data Engineering (2005).

[Blakeley et al. 2006]

J. A. Blakeley, D. Campbell, S. Muralidhar, and A. Nori, “The ADO.NET entity framework: making the conceptual level real”, SIGMOD Record, Volume 35, Number 4 (2006), pages 32–39.

[Blakeley et al. 2008]

J. A. Blakeley, V. Rao, I. Kunen, A. Prout, M. Henaire, and C. Kleinerman, “.NET database programmability and extensibility in Microsoft

1288 Bibliography

SQL server”, In Proc. of the ACM SIGMOD Conf. on Management of Data (2008), pages 1087–1098.

[Blasgen and Eswaran 1976]

M. W. Blasgen and K. P. Eswaran, “On the Evaluation of Queries in a Relational Database System”, IBM Systems Journal, Volume 16, (1976), pages 363–377.

[Boyce et al. 1975]

R. Boyce, D. D. Chamberlin, W. F. King, and M. Hammer, “Spec- ifying Queries as Relational Expressions”, Communications of the ACM, Volume 18, Number 11 (1975), pages 621–628.

[Brantner et al. 2008]

M. Brantner, D. Florescu, D. Graf, D. Kossmann, and T. Kraska, “Building a Database on S3”, In Proc. of the ACM SIGMOD Conf. on

Management of Data (2008), pages 251–263.

[Breese et al. 1998]

J. Breese, D. Heckerman, and C. Kadie, “Empirical Analysis of Predictive Algorithms for Collaborative Filtering”, In Procs. Conf. on Uncertainty in Artificial Intelligence , Morgan Kaufmann (1998).

[Breitbart et al. 1999a]

Y. Breitbart, R. Komondoor, R. Rastogi, S. Seshadri, and A. Silberschatz, “Update Propagation Protocols For Replicated Databases”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1999), pages 97–108.

[Breitbart et al. 1999b]

Y. Breitbart, H. Korth, A. Silberschatz, and S. Sudarshan, “Distributed Databases”, In Encyclopedia of Electrical and Electronics Engineering,

John Wiley and Sons (1999).

[Brewer 2000]

E. A. Brewer, “Towards robust distributed systems (abstract)”, In Proc. of the ACM Symposium on Principles of Distributed Computing (2000), page 7.

[Brin and Page 1998]

S. Brin and L. Page, “The Anatomy of a Large-Scale Hyper- textual Web Search Engine”, In Proc. of the International World Wide Web Conf. (1998).

[Brinkhoff et al. 1993]

T. Brinkhoff, H.-P. Kriegel, and B. Seeger, “Efficient Process- ing of Spatial Joins Using R-trees”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1993), pages 237–246.

[Bruno et al. 2002]

N. Bruno, S. Chaudhuri, and L. Gravano, “Top-k Selection Queries Over Relational Databases: Mapping Strategies and Performance Eval- uation”, ACM Transactions on Database Systems, Volume 27, Number 2 (2002), pages 153–187.

[Buckley and Silberschatz 1983]

G. Buckley and A. Silberschatz, “Obtaining Pro- gressive Protocols for a Simple Multiversion Database Model”, In Proc. of the Inter- national Conf. on Very Large Databases (1983), pages 74–81.

[Buckley and Silberschatz 1984]

G. Buckley and A. Silberschatz, “Concurrency Control in Graph Protocols by Using Edge Locks”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1984), pages 45–50.

[Buckley and Silberschatz 1985]

G. Buckley and A. Silberschatz, “Beyond Two- Phase Locking”, Journal of the ACM, Volume 32, Number 2 (1985), pages 314–326.

Bibliography 1289

[Bulmer 1979]

M. G. Bulmer, Principles of Statistics, Dover Publications (1979).

[Burkhard 1976]

W. A. Burkhard, “Hashing and Trie Algorithms for Partial Match Retrieval”, ACM Transactions on Database Systems, Volume 1, Number 2 (1976), pages 175–187.

[Burkhard 1979]

W. A. Burkhard, “Partial-match Hash Coding: Benefits of Redun- dancy”, ACM Transactions on Database Systems, Volume 4, Number 2 (1979), pages 228–239.

[Cannan and Otten 1993]

S. Cannan and G. Otten, SQL—The Standard Handbook, McGraw Hill (1993).

[Carey 1983]

M. J. Carey, “Granularity Hierarchies in Concurrency Control”, In

Proc. of the ACM SIGMOD Conf. on Management of Data (1983), pages 156–165.

[Carey and Kossmann 1998]

M. J. Carey and D. Kossmann, “Reducing the Braking Distance of an SQL Query Engine”, In Proc. of the International Conf. on Very Large Databases (1998), pages 158–169.

[Carey et al. 1991]

M. Carey, M. Franklin, M. Livny, and E. Shekita, “Data Caching Tradeoffs in Client-Server DBMS Architectures”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1991).

[Carey et al. 1993]

M. J. Carey, D. DeWitt, and J. Naughton, “The OO7 Benchmark”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1993).

[Carey et al. 1999]

M. J. Carey, D. D. Chamberlin, S. Narayanan, B. Vance, D. Doole, S. Rielau, R. Swagerman, and N. Mattos, “O-O, What Have They Done to DB2?”, In Proc. of the International Conf. on Very Large Databases (1999), pages 542–553.

[Cattell 2000]

R. Cattell, editor, The Object Database Standard: ODMG 3.0, Morgan Kaufmann (2000).

[Cattell and Skeen 1992]

R. Cattell and J. Skeen, “Object Operations Benchmark”, ACM Transactions on Database Systems , Volume 17, Number 1 (1992).

[Chakrabarti 1999]

S. Chakrabarti, “Recent Results in Automatic Web Resource Discovery”, ACM Computing Surveys, Volume 31, Number 4 (1999).

[Chakrabarti 2000]

S. Chakrabarti, “Data Mining for Hypertext: A Tutorial Sur- vey”, SIGKDD Explorations, Volume 1, Number 2 (2000), pages 1–11.

[Chakrabarti 2002]

S. Chakrabarti, Mining the Web: Discovering Knowledge from Hy- perText Data , Morgan Kaufmann (2002).

[Chakrabarti et al. 1998]

S. Chakrabarti, S. Sarawagi, and B. Dom, “Mining Sur- prising Patterns Using Temporal Description Length”, In Proc. of the International Conf. on Very Large Databases (1998), pages 606–617.

[Chakrabarti et al. 1999]

S. Chakrabarti, M. van den Berg, and B. Dom, “Focused Crawling: A New Approach to Topic Specific Web Resource Discovery”, In Proc. of the International World Wide Web Conf. (1999).

1290 Bibliography [Chamberlin 1996]

D. Chamberlin, Using the New DB2: IBM’s Object-Relational Database System , Morgan Kaufmann (1996).

[Chamberlin 1998]

D. D. Chamberlin, A Complete Guide to DB2 Universal Database, Morgan Kaufmann (1998).

[Chamberlin and Boyce 1974]

D. D. Chamberlin and R. F. Boyce, “SEQUEL: A Structured English Query Language”, In ACM SIGMOD Workshop on Data Descrip- tion, Access, and Control (1974), pages 249–264.

[Chamberlin et al. 1976]

D. D. Chamberlin, M. M. Astrahan, K. P. Eswaran, P. P. Griffiths, R. A. Lorie, J. W. Mehl, P. Reisner, and B. W. Wade, “SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and Control”, IBM Journal of Research

and Development , Volume 20, Number 6 (1976), pages 560–575.

[Chamberlin et al. 1981]

D. D. Chamberlin, M. M. Astrahan, M. W. Blasgen, J. N. Gray, W. F. King, B. G. Lindsay, R. A. Lorie, J. W. Mehl, T. G. Price, P. G. Selinger, M. Schkolnick, D. R. Slutz, I. L. Traiger, B. W. Wade, and R. A. Yost, “A History and Evaluation of System R”, Communications of the ACM, Volume 24, Number 10 (1981), pages 632–646.

[Chamberlin et al. 2000]

D. D. Chamberlin, J. Robie, and D. Florescu, “Quilt: An XML Query Language for Heterogeneous Data Sources”, In Proc. of the International Workshop on the Web and Databases (WebDB) (2000), pages 53–62.

[Chan and Ioannidis 1998]

C.-Y. Chan and Y. E. Ioannidis, “Bitmap Index Design and Evaluation”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1998).

[Chan and Ioannidis 1999]

C.-Y. Chan and Y. E. Ioannidis, “An Efficient Bitmap Encoding Scheme for Selection Queries”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1999).

[Chandra and Harel 1982]

A. K. Chandra and D. Harel, “Structure and Complexity of Relational Queries”, Journal of Computer and System Sciences, Volume 15, Number 10 (1982), pages 99–128.

[Chandrasekaran et al. 2003]

S. Chandrasekaran, O. Cooper, A. Deshpande, M. J. Franklin, J. M. Hellerstein, W. Hong, S. Krishnamurthy, S. Madden, V. Raman, F. Reiss, and M. Shah, “TelegraphCQ: Continuous Dataflow Processing for an Uncertain World”, In First Biennial Conference on Innovative Data Systems Research (2003).

[Chang et al. 2008]

F. Chang, J. Dean, S. Ghemawat, W. C. Hsieh, D. A. Wallach, M. Burrows, T. Chandra, A. Fikes, and R. E. Gruber, “Bigtable: A Distributed Storage System for Structured Data”, ACM Trans. Comput. Syst., Volume 26, Number 2 (2008).

[Chatziantoniou and Ross 1997]

D. Chatziantoniou and K. A. Ross, “Groupwise Processing of Relational Queries”, In Proc. of the International Conf. on Very Large Databases (1997), pages 476–485.

Bibliography 1291

[Chaudhuri and Narasayya 1997]

S. Chaudhuri and V. Narasayya, “An Efficient Cost-Driven Index Selection Tool for Microsoft SQL Server”, In Proc. of the Interna- tional Conf. on Very Large Databases (1997).

[Chaudhuri and Shim 1994]

S. Chaudhuri and K. Shim, “Including Group-By in Query Optimization”, In Proc. of the International Conf. on Very Large Databases (1994).

[Chaudhuri et al. 1995]

S. Chaudhuri, R. Krishnamurthy, S. Potamianos, and K. Shim, “Optimizing Queries with Materialized Views”, In Proc. of the Interna- tional Conf. on Data Engineering (1995).

[Chaudhuri et al. 1998]

S. Chaudhuri, R. Motwani, and V. Narasayya, “Random sampling for histogram construction: how much is enough?”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1998), pages 436–447.

[Chaudhuri et al. 1999]

S. Chaudhuri, E. Christensen, G. Graefe, V. Narasayya, and M. Zwilling, “Self Tuning Technology in Microsoft SQL Server”, IEEE Data Engineering Bulletin , Volume 22, Number 2 (1999).

[Chaudhuri et al. 2003]

S. Chaudhuri, K. Ganjam, V. Ganti, and R. Motwani, “Ro- bust and Efficient Fuzzy Match for Online Data Cleaning”, In Proc. of the ACM SIGMOD Conf. on Management of Data (2003).

[Chen 1976]

P. P. Chen, “The Entity-Relationship Model: Toward a Unified View of Data”, ACM Transactions on Database Systems, Volume 1, Number 1 (1976), pages 9–36.

[Chen et al. 1994]

P. M. Chen, E. K. Lee, G. A. Gibson, R. H. Katz, and D. A. Pat- terson, “RAID: High-Performance, Reliable Secondary Storage”, ACM Computing Survey , Volume 26, Number 2 (1994).

[Chen et al. 2007]

S. Chen, A. Ailamaki, P. B. Gibbons, and T. C. Mowry, “Improving hash join performance through prefetching”, ACM Transactions on Database Systems, Volume 32, Number 3 (2007).

[Chomicki 1995]

J. Chomicki, “Efficient Checking of Temporal Integrity Con- straints Using Bounded History Encoding”, ACM Transactions on Database Systems, Volume 20, Number 2 (1995), pages 149–186.

[Chou and Dewitt 1985]

H. T. Chou and D. J. Dewitt, “An Evaluation of Buffer Management Strategies for Relational Database Systems”, In Proc. of the Interna- tional Conf. on Very Large Databases (1985), pages 127–141.

[Cieslewicz et al. 2009]

J. Cieslewicz, W. Mee, and K. A. Ross, “Cache-Conscious Buffering for Database Operators with State”, In Proc. Fifth International Workshop on Data Management on New Hardware (DaMoN 2009) (2009).

[Cochrane et al. 1996]

R. Cochrane, H. Pirahesh, and N. M. Mattos, “Integrating Triggers and Declarative Constraints in SQL Database Sytems”, In Proc. of the International Conf. on Very Large Databases (1996), pages 567–578.

1292 Bibliography [Codd 1970]

E. F. Codd, “A Relational Model for Large Shared Data Banks”, Com-

munications of the ACM , Volume 13, Number 6 (1970), pages 377–387.

[Codd 1972]

E. F. Codd. “Further Normalization of the Data Base Relational Model”, In Rustin [1972], pages 33–64 (1972).

[Codd 1979]

E. F. Codd, “Extending the Database Relational Model to Capture More Meaning”, ACM Transactions on Database Systems, Volume 4, Number 4 (1979), pages 397–434.

[Codd 1982]

E. F. Codd, “The 1981 ACM Turing Award Lecture: Relational Database: A Practical Foundation for Productivity”, Communications of the ACM, Volume 25, Number 2 (1982), pages 109–117.

[Codd 1990]

E. F. Codd, The Relational Model for Database Management: Version 2, Addison Wesley (1990).

[Comer 1979]

D. Comer, “The Ubiquitous B-tree”, ACM Computing Survey, Volume 11, Number 2 (1979), pages 121–137.

[Comer 2009]

D. E. Comer, Computer Networks and Internets, 5th edition, Prentice Hall (2009).

[Cook 1996]

M. A. Cook, Building Enterprise Information Architecture: Reengineering Information Systems , Prentice Hall (1996).

[Cooper et al. 2008]

B. F. Cooper, R. Ramakrishnan, U. Srivastava, A. Silberstein, P. Bohannon, H.-A. Jacobsen, N. Puz, D. Weaver, and R. Yerneni, “PNUTS: Yahoo!’s hosted data serving platform”, Proceedings of the VLDB Endowment, Volume 1, Number 2 (2008), pages 1277–1288.

[Cormen et al. 1990]

T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algo- rithms , MIT Press (1990).

[Cortes and Vapnik 1995]

C. Cortes and V. Vapnik, Machine Learning, Volume 20, Number 3 (1995), pages 273–297.

[Cristianini and Shawe-Taylor 2000]

N. Cristianini and J. Shawe-Taylor, An Intro- duction to Support Vector Machines and other Kernel-Based Learning Methods , Cam- bridge University Press (2000).

[Dageville and Za¨ıt 2002]

B. Dageville and M. Za¨ıt, “SQL Memory Management in Oracle9i”, In Proc. of the International Conf. on Very Large Databases (2002), pages 962–973.

[Dageville et al. 2004]

B. Dageville, D. Das, K. Dias, K. Yagoub, M. Za¨ıt, and M. Zi- auddin, “Automatic SQL Tuning in Oracle 10g”, In Proc. of the International Conf. on Very Large Databases (2004), pages 1098–1109.

[Dalvi et al. 2009]

N. Dalvi, R. Kumar, B. Pang, R. Ramakrishnan, A. Tomkins, P. Bohannon, S. Keerthi, and S. Merugu, “A Web of Concepts”, In Proc. of the ACM Symposium on Principles of Database Systems (2009).

Bibliography 1293

[Daniels et al. 1982]

D. Daniels, P. G. Selinger, L. M. Haas, B. G. Lindsay, C. Mohan, A. Walker, and P. F. Wilms. “An Introduction to Distributed Query Compilation in R*”, In Schneider [1982] (1982).

[Dashti et al. 2003]

A. Dashti, S. H. Kim, C. Shahabi, and R. Zimmermann, Stream- ing Media Server Design , Prentice Hall (2003).

[Date 1983]

C. J. Date, “The Outer Join”, In Proc. of the International Conference on Databases , John Wiley and Sons (1983), pages 76–106.

[Date 1989]

C. Date, A Guide to DB2, Addison Wesley (1989).

[Date 1993]

C. J. Date, “How SQL Missed the Boat”, Database Programming and Design , Volume 6, Number 9 (1993).

[Date 2003]

C. J. Date, An Introduction to Database Systems, 8th edition, Addison Wesley (2003).

[Date and Darwen 1997]

C. J. Date and G. Darwen, A Guide to the SQL Standard, 4th edition, Addison Wesley (1997).

[Davis et al. 1983]

C. Davis, S. Jajodia, P. A. Ng, and R. Yeh, editors, Entity- Relationship Approach to Software Engineering , North Holland (1983).

[Davison and Graefe 1994]

D. L. Davison and G. Graefe, “Memory-Contention Responsive Hash Joins”, In Proc. of the International Conf. on Very Large Databases (1994).

[Dayal 1987]

U. Dayal, “Of Nests and Trees: A Unified Approach to Processing Queries that Contain Nested Subqueries, Aggregates and Quantifiers”, In Proc. of the International Conf. on Very Large Databases (1987), pages 197–208.

[Deutsch et al. 1999]

A. Deutsch, M. Fernandez, D. Florescu, A. Levy, and D. Suciu, “A Query Language for XML”, In Proc. of the International World Wide Web Conf. (1999).

[DeWitt 1990]

D. DeWitt, “The Gamma Database Machine Project”, IEEE Transac- tions on Knowledge and Data Engineering , Volume 2, Number 1 (1990).

[DeWitt and Gray 1992]

D. DeWitt and J. Gray, “Parallel Database Systems: The Future of High Performance Database Systems”, Communications of the ACM, Vol- ume 35, Number 6 (1992), pages 85–98.

[DeWitt et al. 1992]

D. DeWitt, J. Naughton, D. Schneider, and S. Seshadri, “Practi- cal Skew Handling in Parallel Joins”, In Proc. of the International Conf. on Very Large Databases (1992).

[Dias et al. 1989]

D. Dias, B. Iyer, J. Robinson, and P. Yu, “Integrated Concurrency- Coherency Controls for Multisystem Data Sharing”, Software Engineering, Volume 15, Number 4 (1989), pages 437–448.

[Donahoo and Speegle 2005]

M. J. Donahoo and G. D. Speegle, SQL: Practical Guide for Developers , Morgan Kaufmann (2005).

1294 Bibliography [Douglas and Douglas 2003]

K. Douglas and S. Douglas, PostgreSQL, Sam’s Pub- lishing (2003).

[Dubois and Thakkar 1992]

M. Dubois and S. Thakkar, editors, Scalable Shared Memory Multiprocessors , Kluwer Academic Publishers (1992).

[Duncan 1990]

R. Duncan, “A Survey of Parallel Computer Architectures”, IEEE Computer , Volume 23, Number 2 (1990), pages 5–16.

[Eisenberg and Melton 1999]

A. Eisenberg and J. Melton, “SQL:1999, formerly

known as SQL3”, ACM SIGMOD Record, Volume 28, Number 1 (1999).

[Eisenberg and Melton 2004a]

A. Eisenberg and J. Melton, “Advancements in SQL/XML”, ACM SIGMOD Record, Volume 33, Number 3 (2004), pages 79–86.

[Eisenberg and Melton 2004b]

A. Eisenberg and J. Melton, “An Early Look at XQuery API for Java (XQJ)”, ACM SIGMOD Record, Volume 33, Number 2 (2004), pages 105–111.

[Eisenberg et al. 2004]

A. Eisenberg, J. Melton, K. G. Kulkarni, J.-E. Michels, and F. Zemke, “SQL:2003 Has Been Published”, ACM SIGMOD Record, Volume 33, Number 1 (2004), pages 119–126.

[Elhemali et al. 2007]

M. Elhemali, C. A. Galindo-Legaria, T. Grabs, and M. Joshi, “Execution strategies for SQL subqueries”, In Proc. of the ACM SIGMOD Conf. on

Management of Data (2007), pages 993–1004.

[Ellis 1987]

C. S. Ellis, “Concurrency in Linear Hashing”, ACM Transactions on Database Systems , Volume 12, Number 2 (1987), pages 195–217.

[Elmasri and Navathe 2006]

R. Elmasri and S. B. Navathe, Fundamentals of Database Systems , 5th edition, Addison Wesley (2006).

[Epstein et al. 1978]

R. Epstein, M. R. Stonebraker, and E. Wong, “Distributed Query Processing in a Relational Database System”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1978), pages 169–180.

[Escobar-Molano et al. 1993]

M. Escobar-Molano, R. Hull, and D. Jacobs, “Safety and Translation of Calculus Queries with Scalar Functions”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1993), pages 253–264.

[Eswaran et al. 1976]

K. P. Eswaran, J. N. Gray, R. A. Lorie, and I. L. Traiger, “The Notions of Consistency and Predicate Locks in a Database System”, Communications of the ACM , Volume 19, Number 11 (1976), pages 624–633.

[Fagin 1977]

R. Fagin, “Multivalued Dependencies and a New Normal Form for Relational Databases”, ACM Transactions on Database Systems, Volume 2, Number 3 (1977), pages 262–278.

[Fagin 1979]

R. Fagin, “Normal Forms and Relational Database Operators”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1979), pages 153–160.

Bibliography 1295

[Fagin 1981]

R. Fagin, “A Normal Form for Relational Databases That Is Based on Domains and Keys”, ACM Transactions on Database Systems, Volume 6, Number 3 (1981), pages 387–415.

[Fagin et al. 1979]

R. Fagin, J. Nievergelt, N. Pippenger, and H. R. Strong, “Ex- tendible Hashing — A Fast Access Method for Dynamic Files”, ACM Transactions on Database Systems , Volume 4, Number 3 (1979), pages 315–344.

[Faloutsos and Lin 1995]

C. Faloutsos and K.-I. Lin, “Fast Map: A Fast Algo- rithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1995), pages 163–174.

[Fayyad et al. 1995]

U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, Advances in Knowledge Discovery and Data Mining , MIT Press (1995).

[Fekete et al. 2005]

A. Fekete, D. Liarokapis, E. O’Neil, P. O’Neil, and D. Shasha, “Making Snapshot Isolation Serializable”, ACM Transactions on Database Systems,

Volume 30, Number 2 (2005).

[Finkel and Bentley 1974]

R. A. Finkel and J. L. Bentley, “Quad Trees: A Data Struc- ture for Retrieval on Composite Keys”, Acta Informatica, Volume 4, (1974), pages 1–9.

[Fischer 2006]

L. Fischer, editor, Workflow Handbook 2001, Future Strategies (2006).

[Florescu and Kossmann 1999]

D. Florescu and D. Kossmann, “Storing and Query- ing XML Data Using an RDBMS”, IEEE Data Engineering Bulletin (Special Issue on XML) (1999), pages 27–35.

[Florescu et al. 2000]

D. Florescu, D. Kossmann, and I. Monalescu, “Integrating Keyword Search into XML Query Processing”, In Proc. of the International World Wide Web Conf. (2000), pages 119–135. Also appears in Computer Networks, Vol. 33, pages 119-135.

[Fredkin 1960]

E. Fredkin, “Trie Memory”, Communications of the ACM, Volume 4, Number 2 (1960), pages 490–499.

[Freedman and DeWitt 1995]

C. S. Freedman and D. J. DeWitt, “The SPIFFI Scal- able Video-on-Demand Server”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1995), pages 352–363.

[Funderburk et al. 2002a]

J. E. Funderburk, G. Kiernan, J. Shanmugasundaram, E. Shekita, and C. Wei, “XTABLES: Bridging Relational Technology and XML”, IBM Systems Journal , Volume 41, Number 4 (2002), pages 616–641.

[Funderburk et al. 2002b]

J. E. Funderburk, S. Malaika, and B. Reinwald, “XML Programming with SQL/XML and XQuery”, IBM Systems Journal, Volume 41, Number 4 (2002), pages 642–665.

[Galindo-Legaria 1994]

C. Galindo-Legaria, “Outerjoins as Disjunctions”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1994).

1296 Bibliography [Galindo-Legaria and Joshi 2001]

C. A. Galindo-Legaria and M. M. Joshi, “Orthog- onal Optimization of Subqueries and Aggregation”, In Proc. of the ACM SIGMOD Conf. on Management of Data (2001).

[Galindo-Legaria and Rosenthal 1992]

C. Galindo-Legaria and A. Rosenthal, “How to Extend a Conventional Optimizer to Handle One- and Two-Sided Outer- join”, In Proc. of the International Conf. on Data Engineering (1992), pages 402–409.

[Galindo-Legaria et al. 2004]

C. Galindo-Legaria, S. Stefani, and F. Waas, “Query Processing for SQL Updates”, In Proc. of the ACM SIGMOD Conf. on Management of Data (2004), pages 844–849.

[Ganguly 1998]

S. Ganguly, “Design and Analysis of Parametric Query Optimiza- tion Algorithms”, In Proc. of the International Conf. on Very Large Databases (1998).

[Ganguly et al. 1992]

S. Ganguly, W. Hasan, and R. Krishnamurthy, “Query Opti- mization for Parallel Execution”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1992).

[Ganguly et al. 1996]

S. Ganguly, P. Gibbons, Y. Matias, and A. Silberschatz, “A Sampling Algorithm for Estimating Join Size”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1996).

[Ganski and Wong 1987]

R. A. Ganski and H. K. T. Wong, “Optimization of Nested SQL Queries Revisited”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1987).

[Garcia and Korth 2005]

P. Garcia and H. F. Korth, “Multithreaded Architectures and the Sort Benchmark”, In Proc. of the First International Workshop on Data Man- agement on Modern Hardward (DaMoN) (2005).

[Garcia-Molina 1982]

H. Garcia-Molina, “Elections in Distributed Computing Sys- tems”, IEEE Transactions on Computers, Volume C-31, Number 1 (1982), pages 48–59.

[Garcia-Molina and Salem 1987]

H. Garcia-Molina and K. Salem, “Sagas”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1987), pages 249–259.

[Garcia-Molina and Salem 1992]

H. Garcia-Molina and K. Salem, “Main Memory Database Systems: An Overview”, IEEE Transactions on Knowledge and Data Engi- neering , Volume 4, Number 6 (1992), pages 509–516.

[Garcia-Molina et al. 2008]

H. Garcia-Molina, J. D. Ullman, and J. D. Widom,

Database Systems: The Complete Book , 2nd edition, Prentice Hall (2008).

[Georgakopoulos et al. 1994]

D. Georgakopoulos, M. Rusinkiewicz, and A. Seth, “Using Tickets to Enforce the Serializability of Multidatabase Transactions”, IEEE

Transactions on Knowledge and Data Engineering , Volume 6, Number 1 (1994), pages 166–180.

[Gilbert and Lynch 2002]

S. Gilbert and N. Lynch, “Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services”, SIGACT News, Volume 33, Number 2 (2002), pages 51–59.

Bibliography 1297

[Graefe 1990]

G. Graefe, “Encapsulation of Parallelism in the Volcano Query Pro- cessing System”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1990), pages 102–111.

[Graefe 1995]

G. Graefe, “The Cascades Framework for Query Optimization”, Data Engineering Bulletin , Volume 18, Number 3 (1995), pages 19–29.

[Graefe 2008]

G. Graefe, “The Five-Minute Rule 20 Years Later: and How Flash Memory Changes the Rules”, ACM Queue, Volume 6, Number 4 (2008), pages 40–52.

[Graefe and McKenna 1993a]

G. Graefe and W. McKenna, “The Volcano Optimizer Generator”, In Proc. of the International Conf. on Data Engineering (1993), pages 209– 218.

[Graefe and McKenna 1993b]

G. Graefe and W. J. McKenna, “Extensibility and Search Efficiency in the Volcano Optimizer Generator”, In Proc. of the International Conf. on Data Engineering (1993).

[Graefe et al. 1998]

G. Graefe, R. Bunker, and S. Cooper, “Hash Joins and Hash Teams in Microsoft SQL Server”, In Proc. of the International Conf. on Very Large Databases (1998), pages 86–97.

[Gray 1978]

J. Gray. “Notes on Data Base Operating System”, In Bayer et al. [1978], pages 393–481 (1978).

[Gray 1981]

J. Gray, “The Transaction Concept: Virtues and Limitations”, In Proc. of the International Conf. on Very Large Databases (1981), pages 144–154.

[Gray 1991]

J. Gray, The Benchmark Handbook for Database and Transaction Processing Systems , 2nd edition, Morgan Kaufmann (1991).

[Gray and Graefe 1997]

J. Gray and G. Graefe, “The Five-Minute Rule Ten Years Later, and Other Computer Storage Rules of Thumb”, SIGMOD Record, Volume 26, Number 4 (1997), pages 63–68.

[Gray and Reuter 1993]

J. Gray and A. Reuter, Transaction Processing: Concepts and Techniques , Morgan Kaufmann (1993).

[Gray et al. 1975]

J. Gray, R. A. Lorie, and G. R. Putzolu, “Granularity of Locks and Degrees of Consistency in a Shared Data Base”, In Proc. of the International Conf. on Very Large Databases (1975), pages 428–451.

[Gray et al. 1976]

J. Gray, R. A. Lorie, G. R. Putzolu, and I. L. Traiger, Granularity of Locks and Degrees of Consistency in a Shared Data Base , Nijssen (1976).

[Gray et al. 1981]

J. Gray, P. R. McJones, and M. Blasgen, “The Recovery Manager of the System R Database Manager”, ACM Computing Survey, Volume 13, Number 2 (1981), pages 223–242.

[Gray et al. 1995]

J. Gray, A. Bosworth, A. Layman, and H. Pirahesh, “Data Cube: A Relational Aggregation Operator Generalizing Group-By, Cross-Tab and Sub- Totals”, Technical report, Microsoft Research (1995).

1298 Bibliography [Gray et al. 1996]

J. Gray, P. Helland, and P. O’Neil, “The Dangers of Replication and a Solution”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1996), pages 173–182.

[Gray et al. 1997]

J. Gray, S. Chaudhuri, A. Bosworth, A. Layman, D. Reichart, M. Venkatrao, F. Pellow, and H. Pirahesh, “Data Cube: A Relational Aggregation Operator Generalizing Group-by, Cross-Tab, and Sub Totals”, Data Mining and Knowledge Discovery , Volume 1, Number 1 (1997), pages 29–53.

[Gregersen and Jensen 1999]

H. Gregersen and C. S. Jensen, “Temporal Entity- Relationship Models-A Survey”, IEEE Transactions on Knowledge and Data Engineer- ing , Volume 11, Number 3 (1999), pages 464–497.

[Grossman and Frieder 2004]

D. A. Grossman and O. Frieder, Information Retrieval: Algorithms and Heuristics , 2nd edition, Springer Verlag (2004).

[Gunning 2008]

P. K. Gunning, DB2 9 for Developers, MC Press (2008).

[Guo et al. 2003]

L. Guo, F. Shao, C. Botev, and J. Shanmugasundaram, “XRANK: Ranked Keyword Search over XML Documents”, In Proc. of the ACM SIGMOD Conf. on Management of Data (2003).

[Guttman 1984]

A. Guttman, “R-Trees: A Dynamic Index Structure for Spatial Searching”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1984), pages 47–57.

[Haas et al. 1989]

L. M. Haas, J. C. Freytag, G. M. Lohman, and H. Pirahesh, “Ex- tensible Query Processing in Starburst”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1989), pages 377–388.

[Haas et al. 1990]

L. M. Haas, W. Chang, G. M. Lohman, J. McPherson, P. F. Wilms, G. Lapis, B. G. Lindsay, H. Pirahesh, M. J. Carey, and E. J. Shekita, “Starburst Mid- Flight: As the Dust Clears”, IEEE Transactions on Knowledge and Data Engineering, Volume 2, Number 1 (1990), pages 143–160.

[Haerder and Reuter 1983]

T. Haerder and A. Reuter, “Principles of Transaction- Oriented Database Recovery”, ACM Computing Survey, Volume 15, Number 4 (1983), pages 287–318.

[Haerder and Rothermel 1987]

T. Haerder and K. Rothermel, “Concepts for Trans- action Recovery in Nested Transactions”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1987), pages 239–248.

[Halsall 2006]

F. Halsall, Computer Networking and the Internet : With Internet and Multiamedia Applications , Addison Wesley (2006).

[Han and Kamber 2000]

J. Han and M. Kamber, Data Mining: Concepts and Tech- niques , Morgan Kaufmann (2000).

[Harinarayan et al. 1996]

V. Harinarayan, J. D. Ullman, and A. Rajaraman, “Imple- menting Data Cubes Efficiently”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1996).

Bibliography 1299

[Haritsa et al. 1990]

J. Haritsa, M. Carey, and M. Livny, “On Being Optimistic about Real-Time Constraints”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1990).

[Harizopoulos and Ailamaki 2004]

S. Harizopoulos and A. Ailamaki, “STEPS to- wards Cache-resident Transaction Processing”, In Proc. of the International Conf. on Very Large Databases (2004), pages 660–671.

[Hellerstein and Stonebraker 2005]

J. M. Hellerstein and M. Stonebraker, editors, Readings in Database Systems , 4th edition, Morgan Kaufmann (2005).

[Hellerstein et al. 1995]

J. M. Hellerstein, J. F. Naughton, and A. Pfeffer, “General- ized Search Trees for Database Systems”, In Proc. of the International Conf. on Very Large Databases (1995), pages 562–573.

[Hennessy et al. 2006]

J. L. Hennessy, D. A. Patterson, and D. Goldberg, Computer Architecture: A Quantitative Approach , 4th edition, Morgan Kaufmann (2006).

[Hevner and Yao 1979]

A. R. Hevner and S. B. Yao, “Query Processing in Dis- tributed Database Systems”, IEEE Transactions on Software Engineering, Volume SE-5, Number 3 (1979), pages 177–187.

[Heywood et al. 2002]

I. Heywood, S. Cornelius, and S. Carver, An Introduction to Geographical Information Systems , 2nd edition, Prentice Hall (2002).

[Hong et al. 1993]

D. Hong, T. Johnson, and S. Chakravarthy, “Real-Time Transac- tion Scheduling: A Cost Conscious Approach”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1993).

[Howes et al. 1999]

T. A. Howes, M. C. Smith, and G. S. Good, Understanding and Deploying LDAP Directory Services , Macmillan Publishing (1999).

[Hristidis and Papakonstantinou 2002]

V. Hristidis and Y. Papakonstantinou, “DISCOVER: Keyword Search in Relational Databases”, In Proc. of the International Conf. on Very Large Databases (2002).

[Huang and Garcia-Molina 2001]

Y. Huang and H. Garcia-Molina, “Exactly-once Semantics in a Replicated Messaging System”, In Proc. of the International Conf. on Data Engineering (2001), pages 3–12.

[Hulgeri and Sudarshan 2003]

A. Hulgeri and S. Sudarshan, “AniPQO: Almost Non-Intrusive Parametric Query Optimization for Non-Linear Cost Functions”, In Proc. of the International Conf. on Very Large Databases (2003).

[IBM 1987]

IBM, “Systems Application Architecture: Common Programming In- terface, Database Reference”, Technical report, IBM Corporation, IBM Form Num- ber SC26–4348–0 (1987).

[Ilyas et al. 2008]

I. Ilyas, G. Beskales, and M. A. Soliman, “A Survey of top-k query processing techniques in relational database systems”, ACM Computing Surveys, Volume 40, Number 4 (2008).

1300 Bibliography [Imielinski and Badrinath 1994]

T. Imielinski and B. R. Badrinath, “Mobile Com- puting — Solutions and Challenges”, Communications of the ACM, Volume 37, Num- ber 10 (1994).

[Imielinski and Korth 1996]

T. Imielinski and H. F. Korth, editors, Mobile Comput- ing , Kluwer Academic Publishers (1996).

[Ioannidis and Christodoulakis 1993]

Y. Ioannidis and S. Christodoulakis, “Opti- mal Histograms for Limiting Worst-Case Error Propagation in the Size of Join Re- sults”, ACM Transactions on Database Systems, Volume 18, Number 4 (1993), pages 709–748.

[Ioannidis and Poosala 1995]

Y. E. Ioannidis and V. Poosala, “Balancing Histogram Optimality and Practicality for Query Result Size Estimation”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1995), pages 233–244.

[Ioannidis et al. 1992]

Y. E. Ioannidis, R. T. Ng, K. Shim, and T. K. Sellis, “Parametric Query Optimization”, In Proc. of the International Conf. on Very Large Databases (1992), pages 103–114.

[Jackson and Moulinier 2002]

P. Jackson and I. Moulinier, Natural Language Pro- cessing for Online Applications: Text Retrieval, Extraction, and Categorization , John Benjamin (2002).

[Jagadish et al. 1993]

H. V. Jagadish, A. Silberschatz, and S. Sudarshan, “Recov- ering from Main-Memory Lapses”, In Proc. of the International Conf. on Very Large Databases (1993).

[Jagadish et al. 1994]

H. Jagadish, D. Lieuwen, R. Rastogi, A. Silberschatz, and S. Sudarshan, “Dali: A High Performance Main Memory Storage Manager”, In Proc. of the International Conf. on Very Large Databases (1994).

[Jain and Dubes 1988]

A. K. Jain and R. C. Dubes, Algorithms for Clustering Data, Prentice Hall (1988).

[Jensen et al. 1994]

C. S. Jensen et al., “A Consensus Glossary of Temporal Database Concepts”, ACM SIGMOD Record, Volume 23, Number 1 (1994), pages 52–64.

[Jensen et al. 1996]

C. S. Jensen, R. T. Snodgrass, and M. Soo, “Extending Existing Dependency Theory to Temporal Databases”, IEEE Transactions on Knowledge and Data Engineering , Volume 8, Number 4 (1996), pages 563–582.

[Johnson 1999]

T. Johnson, “Performance Measurements of Compressed Bitmap Indices”, In Proc. of the International Conf. on Very Large Databases (1999).

[Johnson and Shasha 1993]

T. Johnson and D. Shasha, “The Performance of Con- current B-Tree Algorithms”, ACM Transactions on Database Systems, Volume 18, Number 1 (1993).

[Jones and Willet 1997]

K. S. Jones and P. Willet, editors, Readings in Information Retrieval , Morgan Kaufmann (1997).

Bibliography 1301

[Jordan and Russell 2003]

D. Jordan and C. Russell, Java Data Objects, O’Reilly (2003).

[Jorwekar et al. 2007]

S. Jorwekar, A. Fekete, K. Ramamritham, and S. Sudarshan, “Automating the Detection of Snapshot Isolation Anomalies”, In Proc. of the Inter- national Conf. on Very Large Databases (2007), pages 1263–1274.

[Joshi 1991]

A. Joshi, “Adaptive Locking Strategies in a Multi-Node Shared Data Model Environment”, In Proc. of the International Conf. on Very Large Databases (1991).

[Kanne and Moerkotte 2000]

C.-C. Kanne and G. Moerkotte, “Efficient Storage of

XML Data”, In Proc. of the International Conf. on Data Engineering (2000), page 198.

[Katz et al. 2004]

H. Katz, D. Chamberlin, D. Draper, M. Fernandez, M. Kay, J. Ro- bie, M. Rys, J. Simeon, J. Tivy, and P. Wadler, XQuery from the Experts: A Guide to the W3C XML Query Language , Addison Wesley (2004).

[Kaushik et al. 2004]

R. Kaushik, R. Krishnamurthy, J. F. Naughton, and R. Ra- makrishnan, “On the Integration of Structure Indexes and Inverted Lists”, In Proc. of the ACM SIGMOD Conf. on Management of Data (2004).

[Kedem and Silberschatz 1979]

Z. M. Kedem and A. Silberschatz, “Controlling Concurrency Using Locking Protocols”, In Proc. of the Annual IEEE Symposium on Foundations of Computer Science (1979), pages 275–285.

[Kedem and Silberschatz 1983]

Z. M. Kedem and A. Silberschatz, “Locking Pro- tocols: From Exclusive to Shared Locks”, Journal of the ACM, Volume 30, Number 4 (1983), pages 787–804.

[Kifer et al. 2005]

M. Kifer, A. Bernstein, and P. Lewis, Database Systems: An Appli-

cation Oriented Approach, Complete Version , 2nd edition, Addison Wesley (2005).

[Kim 1982]

W. Kim, “On Optimizing an SQL-like Nested Query”, ACM Transactions on Database Systems , Volume 3, Number 3 (1982), pages 443–469.

[Kim 1995]

W. Kim, editor, Modern Database Systems, ACM Press (1995).

[King et al. 1991]

R. P. King, N. Halim, H. Garcia-Molina, and C. Polyzois, “Man- agement of a Remote Backup Copy for Disaster Recovery”, ACM Transactions on Database Systems , Volume 16, Number 2 (1991), pages 338–368.

[Kitsuregawa and Ogawa 1990]

M. Kitsuregawa and Y. Ogawa, “Bucket Spreading Parallel Hash: A New, Robust, Parallel Hash Join Method for Skew in the Super Database Computer”, In Proc. of the International Conf. on Very Large Databases (1990), pages 210–221.

[Kleinberg 1999]

J. M. Kleinberg, “Authoritative Sources in a Hyperlinked Envi- ronment”, Journal of the ACM, Volume 46, Number 5 (1999), pages 604–632.

[Kleinrock 1975]

L. Kleinrock, Queueing Systems, Wiley-Interscience (1975).

[Klug 1982]

A. Klug, “Equivalence of Relational Algebra and Relational Calculus Query Languages Having Aggregate Functions”, Journal of the ACM, Volume 29, Number 3 (1982), pages 699–717.

1302 Bibliography [Knapp 1987]

E. Knapp, “Deadlock Detection in Distributed Databases”, ACM Computing Survey , Volume 19, Number 4 (1987).

[Knuth 1973]

D. E. Knuth, The Art of Computer Programming, Volume 3, Addison Wesley, Sorting and Searching (1973).

[Kohavi and Provost 2001]

R. Kohavi and F. Provost, editors, Applications of Data

Mining to Electronic Commerce , Kluwer Academic Publishers (2001).

[Konstan et al. 1997]

J. A. Konstan, B. N. Miller, D. Maltz, J. L. Herlocker, L. R. Gordon, and J. Riedl, “GroupLens: Applying Collaborative Filtering to Usenet News”, Communications of the ACM, Volume 40, Number 3 (1997), pages 77–87.

[Korth 1982]

H. F. Korth, “Deadlock Freedom Using Edge Locks”, ACM Transactions on Database Systems , Volume 7, Number 4 (1982), pages 632–652.

[Korth 1983]

H. F. Korth, “Locking Primitives in a Database System”, Journal of the ACM , Volume 30, Number 1 (1983), pages 55–79.

[Korth and Speegle 1990]

H. F. Korth and G. Speegle, “Long Duration Transactions in Software Design Projects”, In Proc. of the International Conf. on Data Engineering (1990), pages 568–575.

[Korth and Speegle 1994]

H. F. Korth and G. Speegle, “Formal Aspects of Concur- rency Control in Long Duration Transaction Systems Using the NT/PV Model”, ACM Transactions on Database Systems , Volume 19, Number 3 (1994), pages 492–535.

[Krishnaprasad et al. 2004]

M. Krishnaprasad, Z. Liu, A. Manikutty, J. W. Warner, V. Arora, and S. Kotsovolos, “Query Rewrite for XML in Oracle XML DB”, In Proc. of the International Conf. on Very Large Databases (2004), pages 1122–1133.

[Kung and Lehman 1980]

H. T. Kung and P. L. Lehman, “Concurrent Manipulation of Binary Search Trees”, ACM Transactions on Database Systems, Volume 5, Number 3 (1980), pages 339–353.

[Kung and Robinson 1981]

H. T. Kung and J. T. Robinson, “Optimistic Concur- rency Control”, ACM Transactions on Database Systems, Volume 6, Number 2 (1981), pages 312–326.

[Kurose and Ross 2005]

J. Kurose and K. Ross, Computer Networking—A Top-Down

Approach Featuring the Internet , 3rd edition, Addison Wesley (2005).

[Lahiri et al. 2001]

T. Lahiri, A. Ganesh, R. Weiss, and A. Joshi, “Fast-Start: Quick Fault Recovery in Oracle”, In Proc. of the ACM SIGMOD Conf. on Management of Data (2001).

[Lam and Kuo 2001]

K.-Y. Lam and T.-W. Kuo, editors, Real-Time Database Systems, Kluwer Academic Publishers (2001).

[Lamb et al. 1991]

C. Lamb, G. Landis, J. Orenstein, and D. Weinreb, “The Object- Store Database System”, Communications of the ACM, Volume 34, Number 10 (1991), pages 51–63.

Bibliography 1303

[Lamport 1978]

L. Lamport, “Time, Clocks, and the Ordering of Events in a Dis- tributed System”, Communications of the ACM, Volume 21, Number 7 (1978), pages 558–565.

[Lampson and Sturgis 1976]

B. Lampson and H. Sturgis, “Crash Recovery in a Distributed Data Storage System”, Technical report, Computer Science Laboratory, Xerox Palo Alto Research Center,Palo Alto (1976).

[Lecluse et al. 1988]

C. Lecluse, P. Richard, and F. Velez, “O2: An Object-Oriented Data Model”, In Proc. of the International Conf. on Very Large Databases (1988), pages 424–433.

[Lehman and Yao 1981]

P. L. Lehman and S. B. Yao, “Efficient Locking for Con- current Operations on B-trees”, ACM Transactions on Database Systems, Volume 6, Number 4 (1981), pages 650–670.

[Lehner et al. 2000]

W. Lehner, R. Sidle, H. Pirahesh, and R. Cochrane, “Main- tenance of Automatic Summary Tables”, In Proc. of the ACM SIGMOD Conf. on Management of Data (2000), pages 512–513.

[Lindsay et al. 1980]

B. G. Lindsay, P. G. Selinger, C. Galtieri, J. N. Gray, R. A. Lorie, T. G. Price, G. R. Putzolu, I. L. Traiger, and B. W. Wade. “Notes on Distributed Databases”, In Draffen and Poole, editors, Distributed Data Bases, pages 247–284. Cambridge University Press (1980).

[Litwin 1978]

W. Litwin, “Virtual Hashing: A Dynamically Changing Hashing”, In Proc. of the International Conf. on Very Large Databases (1978), pages 517–523.

[Litwin 1980]

W. Litwin, “Linear Hashing: A New Tool for File and Table Address- ing”, In Proc. of the International Conf. on Very Large Databases (1980), pages 212–223.

[Litwin 1981]

W. Litwin, “Trie Hashing”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1981), pages 19–29.

[Lo and Ravishankar 1996]

M.-L. Lo and C. V. Ravishankar, “Spatial Hash-Joins”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1996).

[Loeb 1998]

L. Loeb, Secure Electronic Transactions: Introduction and Technical Refer- ence , Artech House (1998).

[Lomet 1981]

D. G. Lomet, “Digital B-trees”, In Proc. of the International Conf. on Very Large Databases (1981), pages 333–344.

[Lomet et al. 2009]

D. Lomet, A. Fekete, G. Weikum, and M. Zwilling, “Unbundling Transaction Services in the Cloud”, In Proc. 4th Biennial Conference on Innovative Data Systems Research (2009).

[Lu et al. 1991]

H. Lu, M. Shan, and K. Tan, “Optimization of Multi-Way Join Queries for Parallel Execution”, In Proc. of the International Conf. on Very Large Databases (1991), pages 549–560.

[Lynch and Merritt 1986]

N. A. Lynch and M. Merritt, “Introduction to the Theory of Nested Transactions”, In Proc. of the International Conf. on Database Theory (1986).

1304 Bibliography [Lynch et al. 1988]

N. A. Lynch, M. Merritt, W. Weihl, and A. Fekete, “A Theory of Atomic Transactions”, In Proc. of the International Conf. on Database Theory (1988), pages 41–71.

[Maier 1983]

D. Maier, The Theory of Relational Databases, Computer Science Press (1983).

[Manning et al. 2008]

C. D. Manning, P. Raghavan, and H. Sch ¨utze, Introduction to Information Retrieval , Cambridge University Press (2008).

[Martin et al. 1989]

J. Martin, K. K. Chapman, and J. Leben, DB2, Concepts, Design, and Programming , Prentice Hall (1989).

[Mattison 1996]

R. Mattison, Data Warehousing: Strategies, Technologies, and Tech- niques , McGraw Hill (1996).

[McHugh and Widom 1999]

J. McHugh and J. Widom, “Query Optimization for XML”, In Proc. of the International Conf. on Very Large Databases (1999), pages 315–326.

[Mehrotra et al. 1991]

S. Mehrotra, R. Rastogi, H. F. Korth, and A. Silberschatz, “Non-Serializable Executions in Heterogeneous Distributed Database Systems”, In

Proc. of the International Conf. on Parallel and Distributed Information Systems (1991).

[Mehrotra et al. 2001]

S. Mehrotra, R. Rastogi, Y. Breitbart, H. F. Korth, and A. Sil- berschatz, “Overcoming Heterogeneity and Autonomy in Multidatabase Sys- tems.”, Inf. Comput., Volume 167, Number 2 (2001), pages 137–172.

[Melnik et al. 2007]

S. Melnik, A. Adya, and P. A. Bernstein, “Compiling map- pings to bridge applications and databases”, In Proc. of the ACM SIGMOD Conf. on Management of Data (2007), pages 461–472.

[Melton 2002]

J. Melton, Advanced SQL:1999 – Understanding Object-Relational and Other Advanced Features , Morgan Kaufmann (2002).

[Melton and Eisenberg 2000]

J. Melton and A. Eisenberg, Understanding SQL and Java Together : A Guide to SQLJ, JDBC, and Related Technologies , Morgan Kaufmann (2000).

[Melton and Simon 1993]

J. Melton and A. R. Simon, Understanding The New SQL : A Complete Guide , Morgan Kaufmann (1993).

[Melton and Simon 2001]

J. Melton and A. R. Simon, SQL:1999, Understanding Re- lational Language Components , Morgan Kaufmann (2001).

[Microsoft 1997]

Microsoft, Microsoft ODBC 3.0 Software Development Kit and Pro- grammer’s Reference , Microsoft Press (1997).

[Mistry et al. 2001]

H. Mistry, P. Roy, S. Sudarshan, and K. Ramamritham, “Materi- alized View Selection and Maintenance Using Multi-Query Optimization”, In Proc. of the ACM SIGMOD Conf. on Management of Data (2001).

[Mitchell 1997]

T. M. Mitchell, Machine Learning, McGraw Hill (1997).

Bibliography 1305

[Mohan 1990a]

C. Mohan, “ARIES/KVL: A Key-Value Locking Method for Con- currency Control of Multiaction Transactions Operations on B-Tree indexes”, In Proc. of the International Conf. on Very Large Databases (1990), pages 392–405.

[Mohan 1990b]

C. Mohan, “Commit-LSN: A Novel and Simple Method for Re- ducing Locking and Latching in Transaction Processing Systems”, In Proc. of the International Conf. on Very Large Databases (1990), pages 406–418.

[Mohan 1993]

C. Mohan, “IBM’s Relational Database Products:Features and Tech- nologies”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1993).

[Mohan and Levine 1992]

C. Mohan and F. Levine, “ARIES/IM:An Efficient and High-Concurrency Index Management Method Using Write-Ahead Logging”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1992).

[Mohan and Lindsay 1983]

C. Mohan and B. Lindsay, “Efficient Commit Protocols for the Tree of Processes Model of Distributed Transactions”, In Proc. of the ACM Symposium on Principles of Distributed Computing (1983).

[Mohan and Narang 1992]

C. Mohan and I. Narang, “Efficient Locking and Caching of Data in the Multisystem Shared Disks Transaction Environment”, In Proc. of the International Conf. on Extending Database Technology (1992).

[Mohan and Narang 1994]

C. Mohan and I. Narang, “ARIES/CSA: A Method for Database Recovery in Client-Server Architectures”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1994), pages 55–66.

[Mohan et al. 1986]

C. Mohan, B. Lindsay, and R. Obermarck, “Transaction Man- agement in the R* Distributed Database Management System”, ACM Transactions on Database Systems , Volume 11, Number 4 (1986), pages 378–396.

[Mohan et al. 1992]

C. Mohan, D. Haderle, B. Lindsay, H. Pirahesh, and P. Schwarz, “ARIES: A Transaction Recovery Method Supporting Fine-Granularity Locking and Partial Rollbacks Using Write-Ahead Logging”, ACM Transactions on Database Systems , Volume 17, Number 1 (1992).

[Moss 1985]

J. E. B. Moss, Nested Transactions: An Approach to Reliable Distributed Computing , MIT Press (1985).

[Moss 1987]

J. E. B. Moss, “Log-Based Recovery for Nested Transactions”, In Proc. of the International Conf. on Very Large Databases (1987), pages 427–432.

[Murthy and Banerjee 2003]

R. Murthy and S. Banerjee, “XML Schemas in Oracle XML DB”, In Proc. of the International Conf. on Very Large Databases (2003), pages 1009–1018.

[Nakayama et al. 1984]

T. Nakayama, M. Hirakawa, and T. Ichikawa, “Architecture and Algorithm for Parallel Execution of a Join Operation”, In Proc. of the International Conf. on Data Engineering (1984).

[Ng and Han 1994]

R. T. Ng and J. Han, “Efficient and Effective Clustering Methods for Spatial Data Mining”, In Proc. of the International Conf. on Very Large Databases (1994).

1306 Bibliography [NIST 1993]

NIST, “Integration Definition for Information Modeling (IDEF1X)”, Technical Report Federal Information Processing Standards Publication 184, National Institute of Standards and Technology (NIST), Available at www.idef.com/Downloads/pdf/Idef1x.pdf (1993).

[Nyberg et al. 1995]

C. Nyberg, T. Barclay, Z. Cvetanovic, J. Gray, and D. B. Lomet, “AlphaSort: A Cache-Sensitive Parallel External Sort”, VLDB Journal, Volume 4, Number 4 (1995), pages 603–627.

[O’Neil and O’Neil 2000]

P. O’Neil and E. O’Neil, Database: Principles, Program- ming, Performance , 2nd edition, Morgan Kaufmann (2000).

[O’Neil and Quass 1997]

P. O’Neil and D. Quass, “Improved Query Performance with Variant Indexes”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1997).

[O’Neil et al. 2004]

P. E. O’Neil, E. J. O’Neil, S. Pal, I. Cseri, G. Schaller, and N. West- bury, “ORDPATHs: Insert-Friendly XML Node Labels”, In Proc. of the ACM SIG- MOD Conf. on Management of Data (2004), pages 903–908.

[Ooi and S. Parthasarathy 2009]

B. C. Ooi and e. S. Parthasarathy, “Special Issue on Data Management on Cloud Computing Platforms”, Data Engineering Bulletin, Volume 32, Number 1 (2009).

[Orenstein 1982]

J. A. Orenstein, “Multidimensional Tries Used for Associative Searching”, Information Processing Letters, Volume 14, Number 4 (1982), pages 150– 157.

[Ozcan et al. 1997]

F. Ozcan, S. Nural, P. Koksal, C. Evrendilek, and A. Dogac, “Dy- namic Query Optimization in Multidatabases”, Data Engineering Bulletin, Volume 20, Number 3 (1997), pages 38–45.

[Ozden et al. 1994]

B. Ozden, A. Biliris, R. Rastogi, and A. Silberschatz, “A Low- cost Storage Server for a Movie on Demand Database”, In Proc. of the International Conf. on Very Large Databases (1994).

[Ozden et al. 1996a]

B. Ozden, R. Rastogi, P. Shenoy, and A. Silberschatz, “Fault- Tolerant Architectures for Continuous Media Servers”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1996).

[Ozden et al. 1996b]

B. Ozden, R. Rastogi, and A. Silberschatz, “On the Design of a Low-Cost Video-on-Demand Storage System”, Multimedia Systems Journal, Volume 4, Number 1 (1996), pages 40–54.

[Ozsoyoglu and Snodgrass 1995]

G. Ozsoyoglu and R. Snodgrass, “Temporal and Real-Time Databases: A Survey”, IEEE Transactions on Knowledge and Data Engineer- ing , Volume 7, Number 4 (1995), pages 513–532.

[Ozsu and Valduriez 1999]

T. Ozsu and P. Valduriez, Principles of Distributed Database Systems , 2nd edition, Prentice Hall (1999).

Bibliography 1307

[Padmanabhan et al. 2003]

S. Padmanabhan, B. Bhattacharjee, T. Malkemus, L. Cranston, and M. Huras, “Multi-Dimensional Clustering: A New Data Lay- out Scheme in DB2”, In Proc. of the ACM SIGMOD Conf. on Management of Data (2003), pages 637–641.

[Pal et al. 2004]

S. Pal, I. Cseri, G. Schaller, O. Seeliger, L. Giakoumakis, and V. Zolo- tov, “Indexing XML Data Stored in a Relational Database”, In Proc. of the International Conf. on Very Large Databases (2004), pages 1134–1145.

[Pang et al. 1995]

H.-H. Pang, M. J. Carey, and M. Livny, “Multiclass Scheduling in Real-Time Database Systems”, IEEE Transactions on Knowledge and Data Engineering, Volume 2, Number 4 (1995), pages 533–551.

[Papakonstantinou et al. 1996]

Y. Papakonstantinou, A. Gupta, and L. Haas, “Capabilities-Based Query Rewriting in Mediator Systems”, In Proc. of the Inter- national Conf. on Parallel and Distributed Information Systems (1996).

[Parker et al. 1983]

D. S. Parker, G. J. Popek, G. Rudisin, A. Stoughton, B. J. Walker, E. Walton, J. M. Chow, D. Edwards, S. Kiser, and C. Kline, “Detection of Mutual Inconsistency in Distributed Systems”, IEEE Transactions on Software Engineering, Volume 9, Number 3 (1983), pages 240–246.

[Patel and DeWitt 1996]

J. Patel and D. J. DeWitt, “Partition Based Spatial-Merge Join”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1996).

[Patterson 2004]

D. P. Patterson, “Latency Lags Bandwidth”, Communications of the ACM , Volume 47, Number 10 (2004), pages 71–75.

[Patterson et al. 1988]

D. A. Patterson, G. Gibson, and R. H. Katz, “A Case for Redundant Arrays of Inexpensive Disks (RAID)”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1988), pages 109–116.

[Pellenkoft et al. 1997]

A. Pellenkoft, C. A. Galindo-Legaria, and M. Kersten, “The Complexity of Transformation-Based Join Enumeration”, In Proc. of the International Conf. on Very Large Databases (1997), pages 306–315.

[Peterson and Davie 2007]

L. L. Peterson and B. S. Davie, Computer Networks: a Systems Approach , Morgan Kaufmann Publishers Inc. (2007).

[Pless 1998]

V. Pless, Introduction to the Theory of Error-Correcting Codes, 3rd edition, John Wiley and Sons (1998).

[Poe 1995]

V. Poe, Building a Data Warehouse for Decision Support, Prentice Hall (1995).

[Polyzois and Garcia-Molina 1994]

C. Polyzois and H. Garcia-Molina, “Evalua- tion of Remote Backup Algorithms for Transaction-Processing Systems”, ACM Transactions on Database Systems , Volume 19, Number 3 (1994), pages 423–449.

[Poosala et al. 1996]

V. Poosala, Y. E. Ioannidis, P. J. Haas, and E. J. Shekita, “Im- proved Histograms for Selectivity Estimation of Range Predicates”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1996), pages 294–305.

1308 Bibliography [Popek et al. 1981]

G. J. Popek, B. J. Walker, J. M. Chow, D. Edwards, C. Kline, G. Rudisin, and G. Thiel, “LOCUS: A Network Transparent, High Reliability Dis- tributed System”, In Proc. of the Eighth Symposium on Operating System Principles (1981), pages 169–177.

[P ¨oss and Potapov 2003]

M. P ¨oss and D. Potapov, “Data Compression in Oracle”, In Proc. of the International Conf. on Very Large Databases (2003), pages 937–947.

[Rahm 1993]

E. Rahm, “Empirical Performance Evaluation of Concurrency and Coherency Control Protocols for Database Sharing Systems”, ACM Transactions on Database Systems , Volume 8, Number 2 (1993).

[Ramakrishna and Larson 1989]

M. V. Ramakrishna and P. Larson, “File Organi- zation Using Composite Perfect Hashing”, ACM Transactions on Database Systems, Volume 14, Number 2 (1989), pages 231–263.

[Ramakrishnan and Gehrke 2002]

R. Ramakrishnan and J. Gehrke, Database Man- agement Systems , 3rd edition, McGraw Hill (2002).

[Ramakrishnan and Ullman 1995]

R. Ramakrishnan and J. D. Ullman, “A Survey of Deductive Database Systems”, Journal of Logic Programming, Volume 23, Number 2 (1995), pages 125–149.

[Ramakrishnan et al. 1992]

R. Ramakrishnan, D. Srivastava, and S. Sudarshan, Controlling the Search in Bottom-up Evaluation (1992).

[Ramesh et al. 1989]

R. Ramesh, A. J. G. Babu, and J. P. Kincaid, “Index Optimiza- tion: Theory and Experimental Results”, ACM Transactions on Database Systems, Volume 14, Number 1 (1989), pages 41–74.

[Rangan et al. 1992]

P. V. Rangan, H. M. Vin, and S. Ramanathan, “Designing an On-Demand Multimedia Service”, Communications Magazine, Volume 1, Number 1 (1992), pages 56–64.

[Rao and Ross 2000]

J. Rao and K. A. Ross, “Making B+-Trees Cache Conscious in Main Memory”, In Proc. of the ACM SIGMOD Conf. on Management of Data (2000), pages 475–486.

[Rathi et al. 1990]

A. Rathi, H. Lu, and G. E. Hedrick, “Performance Comparison of Extendable Hashing and Linear Hashing Techniques”, In Proc. ACM SIGSmall/PC Symposium on Small Systems (1990), pages 178–185.

[Reed 1983]

D. Reed, “Implementing Atomic Actions on Decentralized Data”, Transactions on Computer Systems , Volume 1, Number 1 (1983), pages 3–23.

[Revesz 2002]

P. Revesz, Introduction to Constraint Databases, Springer Verlag (2002).

[Richardson et al. 1987]

J. Richardson, H. Lu, and K. Mikkilineni, “Design and Evaluation of Parallel Pipelined Join Algorithms”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1987).

[Rivest 1976]

R. L. Rivest, “Partial Match Retrieval Via the Method of Superim- posed Codes”, SIAM Journal of Computing, Volume 5, Number 1 (1976), pages 19–50.

Bibliography 1309

[Robinson 1981]

J. Robinson, “The k-d-B Tree: A Search Structure for Large Mul- tidimensional Indexes”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1981), pages 10–18.

[Roos 2002]

R. M. Roos, Java Data Objects, Pearson Education (2002).

[Rosch 2003]

W. L. Rosch, The Winn L. Rosch Hardware Bible, 6th edition, Que (2003).

[Rosenthal and Reiner 1984]

A. Rosenthal and D. Reiner, “Extending the Algebraic Framework of Query Processing to Handle Outerjoins”, In Proc. of the International Conf. on Very Large Databases (1984), pages 334–343.

[Ross 1990]

K. A. Ross, “Modular Stratification and Magic Sets for DATALOG Programs with Negation”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1990).

[Ross 1999]

S. M. Ross, Introduction to Probability and Statistics for Engineers and Scientists , Harcourt/Academic Press (1999).

[Ross and Srivastava 1997]

K. A. Ross and D. Srivastava, “Fast Computation of Sparse Datacubes”, In Proc. of the International Conf. on Very Large Databases (1997), pages 116–125.

[Ross et al. 1996]

K. Ross, D. Srivastava, and S. Sudarshan, “Materialized View Maintenance and Integrity Constraint Checking: Trading Space for Time”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1996).

[Rothermel and Mohan 1989]

K. Rothermel and C. Mohan, “ARIES/NT: A Recov- ery Method Based on Write-Ahead Logging for Nested Transactions”, In Proc. of the International Conf. on Very Large Databases (1989), pages 337–346.

[Roy et al. 2000]

P. Roy, S. Seshadri, S. Sudarshan, and S. Bhobhe, “Efficient and Ex- tensible Algorithms for Multi-Query Optimization”, In Proc. of the ACM SIGMOD Conf. on Management of Data (2000).

[Rusinkiewicz and Sheth 1995]

M. Rusinkiewicz and A. Sheth. “Specification and Execution of Transactional Workflows”, In Kim [1995], pages 592–620 (1995).

[Rustin 1972]

R. Rustin, Data Base Systems, Prentice Hall (1972).

[Rys 2001]

M. Rys, “Bringing the Internet to Your Database: Using SQL Server 2000 and XML to Build Loosely-Coupled Systems”, In Proc. of the International Conf. on Data Engineering (2001), pages 465–472.

[Rys 2003]

M. Rys. “XQuery and Relational Database Systems”, In H. Katz, editor, XQuery From the Experts , pages 353–391. Addison Wesley (2003).

[Rys 2004]

M. Rys. “What’s New in FOR XML in Microsoft SQL Server 2005”. http://msdn.microsoft.com/en-us/library/ms345137(SQL.90).aspx (2004).

[Sagiv and Yannakakis 1981]

Y. Sagiv and M. Yannakakis, “Equivalence among Relational Expressions with the Union and Difference Operators”, Proc. of the ACM SIGMOD Conf. on Management of Data (1981).

1310 Bibliography [Salton 1989]

G. Salton, Automatic Text Processing, Addison Wesley (1989).

[Samet 1990]

H. Samet, The Design and Analysis of Spatial Data Structures, Addison Wesley (1990).

[Samet 1995a]

H. Samet, “General Research Issues in Multimedia Database Sys- tems”, ACM Computing Survey, Volume 27, Number 4 (1995), pages 630–632.

[Samet 1995b]

H. Samet. “Spatial Data Structures”, In Kim [1995], pages 361–385 (1995).

[Samet 2006]

H. Samet, Foundations of Multidimenional and Metric Data Structures, Morgan Kaufmann (2006).

[Samet and Aref 1995]

H. Samet and W. Aref. “Spatial Data Models and Query Processing”, In Kim [1995], pages 338–360 (1995).

[Sanders 1998]

R. E. Sanders, ODBC 3.5 Developer’s Guide, McGraw Hill (1998).

[Sarawagi 2000]

S. Sarawagi, “User-Adaptive Exploration of Multidimensional Data”, In Proc. of the International Conf. on Very Large Databases (2000), pages 307–316.

[Sarawagi et al. 2002]

S. Sarawagi, A. Bhamidipaty, A. Kirpal, and C. Mouli, “ALIAS: An Active Learning Led Interactive Deduplication System”, In Proc. of

the International Conf. on Very Large Databases (2002), pages 1103–1106.

[Schlageter 1981]

G. Schlageter, “Optimistic Methods for Concurrency Control in Distributed Database Systems”, In Proc. of the International Conf. on Very Large Databases (1981), pages 125–130.

[Schneider 1982]

H. J. Schneider, “Distributed Data Bases”, In Proc. of the Interna- tional Symposium on Distributed Databases (1982).

[Selinger et al. 1979]

P. G. Selinger, M. M. Astrahan, D. D. Chamberlin, R. A. Lorie, and T. G. Price, “Access Path Selection in a Relational Database System”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1979), pages 23–34.

[Sellis 1988]

T. K. Sellis, “Multiple Query Optimization”, ACM Transactions on Database Systems , Volume 13, Number 1 (1988), pages 23–52.

[Sellis et al. 1987]

T. K. Sellis, N. Roussopoulos, and C. Faloutsos, “TheR + -Tree: A Dynamic Index for Multi-Dimensional Objects”, In Proc. of the International Conf. on Very Large Databases (1987), pages 507–518.

[Seshadri et al. 1996]

P. Seshadri, H. Pirahesh, and T. Y. C. Leung, “Complex Query Decorrelation”, In Proc. of the International Conf. on Data Engineering (1996), pages 450–458.

[Shafer et al. 1996]

J. C. Shafer, R. Agrawal, and M. Mehta, “SPRINT: A Scalable Parallel Classifier for Data Mining”, In Proc. of the International Conf. on Very Large Databases (1996), pages 544–555.

[Shanmugasundaram et al. 1999]

J. Shanmugasundaram, G. He, K. Tufte, C. Zhang, D. DeWitt, and J. Naughton, “Relational Databases for Querying XML

Bibliography 1311

Documents: Limitations and Opportunities”, In Proc. of the International Conf. on Very Large Databases (1999).

[Shapiro 1986]

L. D. Shapiro, “Join Processing in Database Systems with Large Main Memories”, ACM Transactions on Database Systems, Volume 11, Number 3 (1986), pages 239–264.

[Shasha and Bonnet 2002]

D. Shasha and P. Bonnet, Database Tuning: Principles, Experiments, and Troubleshooting Techniques , Morgan Kaufmann (2002).

[Silberschatz 1982]

A. Silberschatz, “A Multi-Version Concurrency Control Scheme With No Rollbacks”, In Proc. of the ACM Symposium on Principles of Dis- tributed Computing (1982), pages 216–223.

[Silberschatz and Kedem 1980]

A. Silberschatz and Z. Kedem, “Consistency in Hierarchical Database Systems”, Journal of the ACM, Volume 27, Number 1 (1980), pages 72–80.

[Silberschatz et al. 1990]

A. Silberschatz, M. R. Stonebraker, and J. D. Ullman, “Database Systems: Achievements and Opportunities”, ACM SIGMOD Record, Vol-

ume 19, Number 4 (1990).

[Silberschatz et al. 1996]

A. Silberschatz, M. Stonebraker, and J. Ullman, “Database Research: Achievements and Opportunities into the 21st Century”, Technical Re- port CS-TR-96-1563, Department of Computer Science, Stanford University, Stan- ford (1996).

[Silberschatz et al. 2008]

A. Silberschatz, P. B. Galvin, and G. Gagne, Operating System Concepts , 8th edition, John Wiley and Sons (2008).

[Simmen et al. 1996]

D. Simmen, E. Shekita, and T. Malkemus, “Fundamental Techniques for Order Optimization”, In Proc. of the ACM SIGMOD Conf. on Man- agement of Data (1996), pages 57–67.

[Skeen 1981]

D. Skeen, “Non-blocking Commit Protocols”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1981), pages 133–142.

[Soderland 1999]

S. Soderland, “Learning Information Extraction Rules for Semi- structured and Free Text”, Machine Learning, Volume 34, Number 1–3 (1999), pages 233–272.

[Soo 1991]

M. Soo, “Bibliography on Temporal Databases”, ACM SIGMOD Record, Volume 20, Number 1 (1991), pages 14–23.

[SQL/XML 2004]

SQL/XML. “ISO/IEC 9075-14:2003, Information Technology: Database languages: SQL.Part 14: XML-Related Specifications (SQL/XML)” (2004).

[Srikant and Agrawal 1996a]

R. Srikant and R. Agrawal, “Mining Quantitative As- sociation Rules in Large Relational Tables”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1996).

1312 Bibliography [Srikant and Agrawal 1996b]

R. Srikant and R. Agrawal, “Mining Sequential Pat- terns: Generalizations and Performance Improvements”, In Proc. of the International Conf. on Extending Database Technology (1996), pages 3–17.

[Stam and Snodgrass 1988]

R. Stam and R. Snodgrass, “A Bibliography on Tem- poral Databases”, IEEE Transactions on Knowledge and Data Engineering, Volume 7, Number 4 (1988), pages 231–239.

[Stinson 2002]

B. Stinson, PostgreSQL Essential Reference, New Riders (2002).

[Stonebraker 1986]

M. Stonebraker, “Inclusion of New Types in Relational Database Systems”, In Proc. of the International Conf. on Data Engineering (1986), pages 262–269.

[Stonebraker and Rowe 1986]

M. Stonebraker and L. Rowe, “The Design of POST- GRES”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1986).

[Stonebraker et al. 1989]

M. Stonebraker, P. Aoki, and M. Seltzer, “Parallelism in XPRS”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1989).

[Stonebraker et al. 1990]

M. Stonebraker, A. Jhingran, J. Goh, and S. Potamianos, “On Rules, Procedure, Caching and Views in Database Systems”, In Proc. of the

ACM SIGMOD Conf. on Management of Data (1990), pages 281–290.

[Stuart et al. 1984]

D. G. Stuart, G. Buckley, and A. Silberschatz, “A Centralized Deadlock Detection Algorithm”, Technical report, Department of Computer Sci- ences, University of Texas, Austin (1984).

[Tanenbaum 2002]

A. S. Tanenbaum, Computer Networks, 4th edition, Prentice Hall (2002).

[Tansel et al. 1993]

A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snod- grass, Temporal Databases: Theory, Design and Implementation, Benjamin Cummings (1993).

[Teorey et al. 1986]

T. J. Teorey, D. Yang, and J. P. Fry, “A Logical Design Method- ology for Relational Databases Using the Extended Entity-Relationship Model”, ACM Computing Survey , Volume 18, Number 2 (1986), pages 197–222.

[Thalheim 2000]

B. Thalheim, Entity-Relationship Modeling: Foundations of Database Technology , Springer Verlag (2000).

[Thomas 1996]

S. A. Thomas, IPng and the TCP/IP Protocols: Implementing the Next Generation Internet , John Wiley and Sons (1996).

[Traiger et al. 1982]

I. L. Traiger, J. N. Gray, C. A. Galtieri, and B. G. Lindsay, “Trans- actions and Consistency in Distributed Database Management Systems”, ACM Transactions on Database Systems , Volume 7, Number 3 (1982), pages 323–342.

[Tyagi et al. 2003]

S. Tyagi, M. Vorburger, K. McCammon, and H. Bobzin, Core Java Data Objects , prenticehall (2003).

Bibliography 1313

[Umar 1997]

A. Umar, Application (Re)Engineering : Building Web-Based Applications and Dealing With Legacies , Prentice Hall (1997).

[UniSQL 1991]

UniSQL/X Database Management System User’s Manual: Release 1.2 . UniSQL, Inc. (1991).

[Verhofstad 1978]

J. S. M. Verhofstad, “Recovery Techniques for Database Sys- tems”, ACM Computing Survey, Volume 10, Number 2 (1978), pages 167–195.

[Vista 1998]

D. Vista, “Integration of Incremental View Maintenance into Query Optimizers”, In Proc. of the International Conf. on Extending Database Technology (1998).

[Vitter 2001]

J. S. Vitter, “External Memory Algorithms and Data Structures: Deal- ing with Massive Data”, ACM Computing Surveys, Volume 33, (2001), pages 209–271.

[Walsh et al. 2007]

N. Walsh et al. “XQuery 1.0 and XPath 2.0 Data Model”. http://www.w3.org/TR/xpath-datamodel. currently a W3C Recommendation (2007).

[Walton et al. 1991]

C. Walton, A. Dale, and R. Jenevein, “A Taxonomy and Per- formance Model of Data Skew Effects in Parallel Joins”, In Proc. of the International Conf. on Very Large Databases (1991).

[Weikum 1991]

G. Weikum, “Principles and Realization Strategies of Multilevel Transaction Management”, ACM Transactions on Database Systems, Volume 16, Number 1 (1991).

[Weikum et al. 1990]

G. Weikum, C. Hasse, P. Broessler, and P. Muth, “Multi-Level Recovery”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1990), pages 109–123.

[Wilschut et al. 1995]

A. N. Wilschut, J. Flokstra, and P. M. Apers, “Parallel Evalu- ation of Multi-Join Queues”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1995), pages 115–126.

[Witten and Frank 1999]

I. H. Witten and E. Frank, Data Mining: Practical Machine

Learning Tools and Techniques with Java Implementations , Morgan Kaufmann (1999).

[Witten et al. 1999]

I. H. Witten, A. Moffat, and T. C. Bell, Managing Gigabytes: Compressing and Indexing Documents and images , 2nd edition, Morgan Kaufmann (1999).

[Wolf 1991]

J. Wolf, “An Effective Algorithm for Parallelizing Hash Joins in the Presence of Data Skew”, In Proc. of the International Conf. on Data Engineering (1991).

[Wu and Buchmann 1998] M. Wu and A. Buchmann, “Encoded Bitmap Indexing

for Data Warehouses”, In Proc. of the International Conf. on Data Engineering (1998).

[Wu et al. 2003]

Y. Wu, J. M. Patel, and H. V. Jagadish, “Structural Join Order Se- lection for XML Query Optimization”, In Proc. of the International Conf. on Data Engineering (2003).

1314 Bibliography [X/Open 1991]

X/Open Snapshot: X/Open DTP: XA Interface . X/Open Company, Ltd. (1991).

[Yan and Larson 1995]

W. P. Yan and P. A. Larson, “Eager Aggregation and Lazy Aggregation”, In Proc. of the International Conf. on Very Large Databases (1995).

[Yannakakis et al. 1979]

M. Yannakakis, C. H. Papadimitriou, and H. T. Kung, “Locking Protocols: Safety and Freedom from Deadlock”, In Proc. of the IEEE Sym- posium on the Foundations of Computer Science (1979), pages 286–297.

[Zaharioudakis et al. 2000]

M. Zaharioudakis, R. Cochrane, G. Lapis, H. Pirahesh, and M. Urata, “Answering Complex SQL Queries using Automatic Summary Ta- bles”, In Proc. of the ACM SIGMOD Conf. on Management of Data (2000), pages

[Zeller and Gray 1990]

H. Zeller and J. Gray, “An Adaptive Hash Join Algorithm for Multiuser Environments”, In Proc. of the International Conf. on Very Large Databases (1990), pages 186–197.

[Zhang et al. 1996]

T. Zhang, R. Ramakrishnan, and M. Livny, “BIRCH: An Efficient Data Clustering Method for Very Large Databases”, In Proc. of the ACM SIGMOD Conf. on Management of Data (1996), pages 103–114.