Grouping, Aggregation, and Database Modification in QBE
C.2 Grouping, Aggregation, and Database Modification in QBE
Next, consider the types of queries that require grouping or aggregate functions. A grouping operator G. can be specified in a column to indicate that tuples should be grouped by the value of that column. Common functions can be specified, such as AVG. , SUM. , CNT. (count), MAX. , and MIN . In QBE the functions AVG. , SUM. , and
CNT. are applied to distinct values within a group in the default case. If we want these functions to apply to all values, we must use the prefix ALL . 3 This convention is different in SQL, where the default is to apply a function to all values.
1096 Appendix C Overview of the QBE Language
(a) EMPLOYEE Fname
Super_ssn Dno _FN
_DX DEPARTMENT
_LN
_Addr
Dname Dnumber
Mgrssn
Mgr_start_date
Research _DX RESULT
P. _FN _LN
_Addr
(b) EMPLOYEE Fname
Super_ssn Dno _E1
_Xssn _S1
RESULT P.
Figure C.5
Illustrating JOIN and result relations in QBE. (a) The query Q1. (b) The query Q8.
Figure C.6(a) shows query Q23 , which counts the number of distinct salary values in the EMPLOYEE relation. Query Q23A (Figure C.6(b) counts all salary values, which is the same as counting the number of employees. Figure C.6(c) shows Q24 , which retrieves each department number and the number of employees and average salary within each department; hence, the Dno column is used for grouping as indicated by
the G. function. Several of the operators G. , P. , and ALL can be specified in a single column. Figure C.6(d) shows query Q26 , which displays each project name and the number of employees working on it for projects on which more than two employees work.
QBE has a negation symbol, ¬, which is used in a manner similar to the NOT EXISTS function in SQL. Figure C.7 shows query Q6 , which lists the names of employees who have no dependents. The negation symbol ¬ says that we will select values of the _SX variable from the EMPLOYEE relation only if they do not occur in the DEPENDENT relation. The same effect can be produced by placing a ¬ _SX in the Essn column.
Although the QBE language as originally proposed was shown to support the equivalent of the EXISTS and NOT EXISTS functions of SQL, the QBE imple- mentation in QMF (under the DB2 system) does not provide this support. Hence, the QMF version of QBE, which we discuss here, is not relationally complete. Queries such as Q3 : Find employees who work on all projects controlled by depart-
Appendix C Overview of the QBE Language 1097
(a) EMPLOYEE Fname Minit Lname
Ssn
Bdate Address Sex
Salary
Super_ssn Dno
P.CNT.
(b) EMPLOYEE Fname Minit Lname
Ssn
Bdate Address Sex
Salary
Super_ssn Dno
P.CNT.ALL
(c) EMPLOYEE Fname Minit Lname
Ssn
Bdate Address Sex
Salary
Super_ssn Dno
P.AVG.ALL P.G. (d) PROJECT
P.CNT.ALL
Pname Pnumber
Plocation Dnum
P. _PX WORKS_ON
Essn Pno
Hours
P.CNT.EX G._PX
Figure C.6
CONDITIONS Functions and grouping in QBE. (a) The query Q23. (b) The query Q23A.
CNT._EX > 2 (c) The query Q24. (d) The query Q26.
EMPLOYEE Fname Minit Lname Ssn Bdate
Salary Super_ssn Dno P.
Address Sex
P.
_SX
DEPENDENT Essn Dependent_name
Sex Bdate Relationship
Figure C.7
_SX Illustrating negation by the query Q6.
There are three QBE operators for modifying the database: I. for insert, D. for delete, and U. for update. The insert and delete operators are specified in the template col- umn under the relation name, whereas the update operator is specified under the columns to be updated. Figure C.8(a) shows how to insert a new EMPLOYEE tuple.
For deletion, we first enter the D. operator and then specify the tuples to be deleted by a condition (Figure C.8(b)). To update a tuple, we specify the U. operator under the attribute name, followed by the new value of the attribute. We should also select
1098 Appendix C Overview of the QBE Language
(a)
EMPLOYEE Fname Minit Lname
Salary Super_ssn Dno I. Richard
K Marini 653298653 30-Dec-52 98 Oak Forest, Katy, TX
(b)
EMPLOYEE Fname Minit Lname
Salary Super_ssn Dno
D. 653298653
(c)
EMPLOYEE Fname Minit Lname
Salary Super_ssn Dno John
Smith U._S*1.1 U.4
Figure C.8
Modifying the database in QBE. (a) Insertion. (b) Deletion. (c) Update in QBE.
request to increase the salary of ‘John Smith’ by 10 percent and also to reassign him to department number 4.
QBE also has data definition capabilities. The tables of a database can be specified interactively, and a table definition can also be updated by adding, renaming, or removing a column. We can also specify various characteristics for each column, such as whether it is a key of the relation, what its data type is, and whether an index should be created on that field. QBE also has facilities for view definition, authoriza- tion, storing query definitions for later use, and so on.
QBE does not use the linear style of SQL; rather, it is a two-dimensional language because users specify a query moving around the full area of the screen. Tests on users have shown that QBE is easier to learn than SQL, especially for nonspecialists. In this sense, QBE was the first user-friendly visual relational database language.
More recently, numerous other user-friendly interfaces have been developed for commercial database systems. The use of menus, graphics, and forms is now becoming quite common. Filling forms partially to issue a search request is akin to using QBE. Visual query languages, which are still not so common, are likely to be offered with commercial relational databases in the future.
Bibliography
Abbreviations Used in the Bibliography TOIS: ACM Transactions on Information Systems (jour- ACM: Association for Computing Machinery
nal)
AFIPS: American Federation of Information Processing TOOIS: ACM Transactions on Office Information Systems Societies
(journal)
CACM: Communications of the ACM (journal) TSE: IEEE Transactions on Software Engineering (journal) CIKM: Proceedings of the International Conference on
VLDB: Proceedings of the International Conference on Information and Knowledge Management
Very Large Data Bases (issues after 1981 available from DASFAA: Proceedings of the International Conference on
Morgan Kaufmann, Menlo Park, California) Database Systems for Advanced Applications
DKE: Data and Knowledge Engineering, Elsevier Format for Bibliographic Citations Publishing (journal)
Book titles are in boldface—for example, Database EDS: Proceedings of the International Conference on Computers . Conference proceedings names are in ital- Expert Database Systems
ics—for example, ACM Pacific Conference. Journal names ER Conference: Proceedings of the International Confer-
are in boldface—for example, TODS or Information ence on Entity-Relationship Approach (now called
Systems . For journal citations, we give the volume number International Conference on Conceptual Modeling)
and issue number (within the volume, if any) and date of ICDCS: Proceedings of the IEEE International Conference
issue. For example, “TODS, 3:4, December 1978” refers to on Distributed Computing Systems
the December 1978 issue of ACM Transactions on ICDE: Proceedings of the IEEE International Conference
Database Systems, which is Volume 3, Number 4. Articles on Data Engineering
that appear in books or conference proceedings that are IEEE: Institute of Electrical and Electronics Engineers
themselves cited in the bibliography are referenced as “in” IEEE Computer: Computer magazine (journal) of the
these references—for example, “in VLDB [1978]” or “in IEEE CS
Rustin [1974].” Page numbers (abbreviated “pp.”) are pro- IEEE CS: IEEE Computer Society
vided with pp. at the end of the citation whenever avail- IFIP: International Federation for Information Processing
able. For citations with more than four authors, we will JACM: Journal of the ACM
give the first author only followed by et al. In the selected KDD: Knowledge Discovery in Databases
bibliography at the end of each chapter, we use et al. if LNCS: Lecture Notes in Computer Science
there are more than two authors. NCC: Proceedings of the National Computer Conference
(published by AFIPS) OOPSLA: Proceedings of the ACM Conference on
Bibliographic References Object-Oriented Programming Systems, Languages,
Abadi, D. J., Madden, S. R., and Hachem, N. [2008] and Applications
“Column Stores vs. Row Stores: How Different Are PAMI: Pattern Analysis and Machine Intelligence
They Really?” in SIGMOD [2008]. PODS: Proceedings of the ACM Symposium on Principles
Abbott, R., and Garcia-Molina, H. [1989] “Scheduling of Database Systems
Real-Time Transactions with Disk Resident Data,” in SIGMOD: Proceedings of the ACM SIGMOD Inter-
VLDB [1989].
national Conference on Management of Data Abiteboul, S., and Kanellakis, P. [1989] “Object Identity as SOSP: ACM Symposium on Operating System Principles
a Query Language Primitive,” in SIGMOD [1989]. TKDE: IEEE Transactions on Knowledge and Data
Abiteboul, S., Hull, R., and Vianu, V. [1995] Foundations Engineering (journal)
of Databases , Addison-Wesley, 1995. TOCS: ACM Transactions on Computer Systems (journal)
Abrial, J. [1974] “Data Semantics,” in Klimbie and TODS: ACM Transactions on Database Systems (journal)
Koffeman [1974].
10 Bibliography
Acharya, S., Alonso, R., Franklin, M., and Zdonik, S. Alashqur, A., Su, S., and Lam, H. [1989] “OQL: A Query [1995] “Broadcast Disks: Data Management for
Language for Manipulating Object-Oriented Asymmetric Communication Environments,” in SIG-
Databases,” in VLDB [1989]. MOD [1995].
Albano, A., Cardelli, L., and Orsini, R. [1985] “GALILEO: Adam, N., and Gongopadhyay, A. [1993] “Integrating
A Strongly Typed Interactive Conceptual Language,” Functional and Data Modeling in a Computer
TODS , 10:2, June 1985, pp. 230–260. Integrated Manufacturing System,” in ICDE [1993].
Albrecht J. H., [1996] “Universal GIS Operations,” Adriaans, P., and Zantinge, D. [1996] Data Mining,
University of Osnabrueck, Germany, Ph.D. Addison-Wesley, 1996.
Dissertation, 1996.
Afsarmanesh, H., McLeod, D., Knapp, D., and Parker, A. Allen, F., Loomis, M., and Mannino, M. [1982] “The [1985] “An Extensible Object-Oriented Approach to
Integrated Dictionary/Directory System,” ACM Databases for VLSI/CAD,” in VLDB [1985].
Computing Surveys , 14:2, June 1982. Agrawal, D., and ElAbbadi, A. [1990] “Storage Efficient
Allen, J. [1983] “Maintaining Knowledge about Temporal Replicated Databases,” TKDE, 2:3, September 1990.
Intervals,” in CACM 26:11, November 1983, pp. Agrawal, R. et al. [2008] “The Claremont Report on
Database Research,” available at http://db.cs.berkeley Alonso, G., Agrawal, D., El Abbadi, A., and Mohan, C. .edu/claremont/claremontreport08.pdf, May 2008.
[1997] “Functionalities and Limitations of Current Agrawal, R., and Gehani, N. [1989] “ODE: The Language
Workflow Management Systems,” IEEE Expert, 1997. and the Data Model,” in SIGMOD [1989].
Amir, A., Feldman, R., and Kashi, R. [1997] “A New and Agrawal, R., and Srikant, R. [1994] “Fast Algorithms for
Versatile Method for Association Generation,” Mining Association Rules in Large Databases,” in
Information Systems , 22:6, September 1997. VLDB [1994].
Anderson, S. et al. [1981] “Sequence and Organization of Agrawal, R., Gehani, N., and Srinivasan, J. [1990]
the Human Mitochondrial Genome.” Nature, 290: “OdeView: The Graphical Interface to Ode,” in SIG-
MOD [1990]. Andrews, T., and Harris, C. [1987] “Combining Language Agrawal, R., Imielinski, T., and Swami, A. [1993] “Mining
and Database Advances in an Object-Oriented Association Rules Between Sets of Items in Databases,”
Development Environment,” OOPSLA, 1987. in SIGMOD [1993].
ANSI [1975] American National Standards Institute Study Agrawal, R., Imielinski, T., and Swami, A. [1993b]
Group on Data Base Management Systems: Interim “Database Mining: A Performance Perspective,” TKDE
Report, FDT, 7:2, ACM, 1975. 5:6, December 1993.
ANSI [1986] American National Standards Institute: The Agrawal, R., Mehta, M., Shafer, J., and Srikant, R. [1996]
Database Language SQL , Document ANSI X3.135, “The Quest Data Mining System,” in KDD [1996].
Ahad, R., and Basu, A. [1991] “ESQL: A Query Language ANSI [1986a] American National Standards Institute: The for the Relational Model Supporting Image Domains,”
Database Language NDL , Document ANSI X3.133, in ICDE [1991].
Aho, A., and Ullman, J. [1979] “Universality of Data ANSI [1989] American National Standards Institute: Retrieval Languages,” Proc. POPL Conference, San
Information Resource Dictionary Systems , Antonio, TX, ACM, 1979.
Document ANSI X3.138, 1989. Aho, A., Beeri, C., and Ullman, J. [1979] “The Theory of
Antenucci, J. et al. [1998] Geographic Information Joins in Relational Databases,” TODS, 4:3, September
Systems: A Guide to the Technology , Chapman and 1979.
Hall, May 1998.
Aho, A., Sagiv, Y., and Ullman, J. [1979a] “Efficient Anwar, T., Beck, H., and Navathe, S. [1992] “Knowledge Optimization of a Class of Relational Expressions,”
Mining by Imprecise Querying: A Classification Based TODS , 4:4, December 1979.
Approach,” in ICDE [1992]. Akl, S. [1983] “Digital Signatures: A Tutorial Survey,” IEEE
Apers, P., Hevner, A., and Yao, S. [1983] “Optimization Computer , 16:2, February 1983.
Algorithms for Distributed Queries,” TSE, 9:1, January Alagic, S. [1999] “A Family of the ODMG Object Models,”
in Advances in Databases and Information Systems, Apweiler, R., Martin, M., O’Donovan, C., and Prues, M. Third East European Conference, ADBIS’99, Maribor,
[2003] “Managing Core Resources for Genomics and Slovenia, J. Eder, I. Rozman, T. Welzer (eds.),
Proteomics,” Pharmacogenomics, 4:3, May 2003, pp.
Bibliography 1101
Aref, W. et al. [2004] “VDBMS: A Testbed Facility or Baeza-Yates, R., and Ribero-Neto, B. [1999] Modern Research in Video Database Benchmarking,” in
Information Retrieval , Addison-Wesley, 1999. Multimedia Systems (MMS), 9:6, June 2004, pp.
Balbin, I., and Ramamohanrao, K. [1987] “A Generaliza- 98–115.
tion of the Different Approach to Recursive Query Arisawa, H., and Catarci, T. [2000] Advances in Visual
Evaluation,” Journal of Logic Programming, 15:4, Information Management, Proc. Fifth Working Conf.
On Visual Database Systems, Arisawa, H., Catarci, T. Bancilhon, F. [1985] “Naive Evaluation of Recursively (eds.), Fujkuoka, Japan, IFIP Conference Proceedings
Defined Relations,” in On Knowledge Base 168, Kluwer, 2000.
Management Systems (Brodie, M., and Mylopoulos, J., Armstrong, W. [1974] “Dependency Structures of Data
eds.), Islamorada workshop 1985, Springer, pp. Base Relationships,” Proc. IFIP Congress, 1974.
Ashburner, M. et al. [2000] “Gene Ontology: Tool for the Bancilhon, F., and Buneman, P., eds. [1990] Advances in unification of biology,” Nature Genetics, Vol. 25, May
Database Programming Languages , ACM Press, 1990. 2000, pp. 25–29.
Bancilhon, F., and Ferran, G. [1995] “The ODMG Astrahan, M. et al. [1976] “System R: A Relational
Standard for Object Databases,” DASFAA 1995, Approach to Data Base Management,” TODS, 1:2, June
Singapore, pp. 273–283.
1976. Bancilhon, F., and Ramakrishnan, R. [1986] “An Amateur’s Atkinson, M., and Buneman, P. [1987] “Types and
Introduction to Recursive Query Processing Persistence in Database Programming Languages” in
Strategies,” in SIGMOD [1986]. ACM Computing Surveys , 19:2, June 1987.
Bancilhon, F., Delobel, C., and Kanellakis, P., eds. [1992] Atkinson, Malcolm et al. [1990] The Object-Oriented
Building an Object-Oriented Database System: The
Database System Manifesto, Proc. Deductive and Object Story of O2 , Morgan Kaufmann, 1992. Oriented Database Conf. (DOOD), Kyoto, Japan, 1990.
Bancilhon, F., Maier, D., Sagiv, Y., and Ullman, J. [1986] Atluri, V. et al. [1997] “Multilevel Secure Transaction
“Magic Sets and Other Strange Ways to Implement Processing: Status and Prospects,” in Database
Logic Programs,” PODS [1986]. Security: Status and Prospects , Chapman and Hall,
Banerjee, J. et al. [1987] “Data Model Issues for Object- 1997, pp. 79–98.
Oriented Applications,” TOOIS, 5:1, January 1987. Atzeni, P., and De Antonellis, V. [1993] Relational
Banerjee, J., Kim, W., Kim, H., and Korth, H. [1987a] Database Theory , Benjamin/Cummings, 1993.
“Semantics and Implementation of Schema Evolution Atzeni, P., Mecca, G., and Merialdo, P. [1997] “To Weave
in Object-Oriented Databases,” in SIGMOD [1987]. the Web,” in VLDB [1997].
Barbara, D. [1999] “Mobile Computing and Databases – A Bachman, C. [1969] “Data Structure Diagrams,” Data
Survey,” TKDE, 11:1, January 1999. Base (Bulletin of ACM SIGFIDET), 1:2, March 1969.
Baroody, A., and DeWitt, D. [1981] “An Object-Oriented Bachman, C. [1973] “The Programmer as a Navigator,”
Approach to Database System Implementation,” CACM , 16:1, November 1973.
TODS , 6:4, December 1981. Bachman, C. [1974] “The Data Structure Set Model,” in
Barrett T. et al. [2005] “NCBI GEO: mining millions of Rustin [1974].
expression profiles—database and tools,” Nucleic Acid Bachman, C., and Williams, S. [1964] “A General Purpose
Research , 33: database issue, 2005, pp. 562–566. Programming System for Random Access Memories,”
Barrett, T. et al. [2007] “NCBI GEO: mining tens of mil- Proc. Fall Joint Computer Conference, AFIPS, 26, 1964.
lions of expression profiles—database and tools Badal, D., and Popek, G. [1979] “Cost and Performance
update,” in Nucleic Acids Research, 35:1, January 2007. Analysis of Semantic Integrity Validation Methods,” in
Barsalou, T., Siambela, N., Keller, A., and Wiederhold, G. SIGMOD [1979].
[1991] “Updating Relational Databases Through Badrinath, B., and Imielinski, T. [1992] “Replication and
Object-Based Views,” in SIGMOD [1991]. Mobility,” Proc. Workshop on the Management of
Bassiouni, M. [1988] “Single-Site and Distributed Replicated Data 1992: pp. 9–12
Optimistic Protocols for Concurrency Control,” TSE, Badrinath, B., and Ramamritham, K. [1992] “Semantics-
14:8, August 1988.
Based Concurrency Control: Beyond Commutativity,” Batini, C., Ceri, S., and Navathe, S. [1992] Database TODS , 17:1, March 1992.
An Entity-Relationship Approach, Baeza-Yates, R., and Larson, P. A. [1989] “Performance of
Design:
Benjamin/Cummings, 1992. B + -trees with Partial Expansions,” TKDE, 1:2, June
Batini, C., Lenzerini, M., and Navathe, S. [1987] “A
1102 Bibliography
Schema Integration,” ACM Computing Surveys, 18:4, Bernstein, P., and Goodman, N. [1980] “Timestamp-Based December 1987.
Algorithms for Concurrency Control in Distributed Batory, D. et al. [1988] “GENESIS: An Extensible Database
Database Systems,” in VLDB [1980]. Management System,” TSE, 14:11, November 1988.
Bernstein, P., and Goodman, N. [1981a] “Concurrency Batory, D., and Buchmann, A. [1984] “Molecular Objects,
Control in Distributed Database Systems,” ACM Abstract Data Types, and Data Models: A Framework,”
Computing Surveys , 13:2, June 1981. in VLDB [1984].
Bernstein, P., and Goodman, N. [1981b] “The Power of Bay, H., Tuytelaars, T., and Gool, L. V. [2006] “SURF:
Natural Semijoins,” SIAM Journal of Computing, Speeded Up Robust Features”, in Proc. Ninth European
10:4, December 1981.
Conference on Computer Vision, May 2006. Bernstein, P., and Goodman, N. [1984] “An Algorithm for Bayer, R., and McCreight, E. [1972] “Organization and
Concurrency Control and Recovery in Replicated Maintenance of Large Ordered Indexes,” Acta
Distributed Databases,” TODS, 9:4, December 1984. Informatica , 1:3, February 1972.
Bernstein, P., Blaustein, B., and Clarke, E. [1980] “Fast Bayer, R., Graham, M., and Seegmuller, G., eds. [1978]
Maintenance of Semantic Integrity Assertions Using Operating Systems: An Advanced Course , Springer-
Redundant Aggregate Data,” in VLDB [1980]. Verlag, 1978.
Bernstein, P., Hadzilacos, V., and Goodman, N. [1987] Beck, H., Anwar, T., and Navathe, S. [1994] “A Conceptual
Concurrency Control and Recovery in Database Clustering Algorithm for Database Schema Design,”
Systems, Addison-Wesley, 1987. TKDE , 6:3, June 1994.
Bertino, E. [1992] “Data Hiding and Security in Object- Beck, H., Gala, S., and Navathe, S. [1989] “Classification as
Oriented Databases,” in ICDE [1992]. a Query Processing Technique in the CANDIDE
Bertino, E. [1998] “Data Security,” in DKE 25:1–2, pp. Semantic Data Model,” in ICDE [1989].
Beeri, C., and Ramakrishnan, R. [1987] “On the Power of Bertino, E. and Sandhu, R., [2005] “Security—Concepts, Magic” in PODS [1987].
Approaches, and Challenges,” in IEEE Transactions on Beeri, C., Fagin, R., and Howard, J. [1977] “A Complete
Dependable Secure Computing (TDSC), 2:1, 2005, Axiomatization for Functional and Multivalued
pp. 2–19.
Dependencies,” in SIGMOD [1977]. Bertino, E., and Guerrini, G. [1998] “Extending the Ben-Zvi, J. [1982] “The Time Relational Model,” Ph.D. dis-
ODMG Object Model with Composite Objects,” OOP- sertation, University of California, Los Angeles, 1982.
SLA, Vancouver, Canada, 1998, pp. 259–270. Benson, D., Boguski, M., Lipman, D., and Ostell, J.,
Bertino, E., and Kim, W. [1989] “Indexing Techniques for “GenBank,” Nucleic Acids Research, 24:1, 1996.
Queries on Nested Objects,” TKDE, 1:2, June 1989. Benson, D., Karsch-Mizrachi, I., Lipman, D. et al. [2002]
Bertino, E., Catania, B., and Ferrari, E. [2001] “A Nested “GenBank,” Nucleic Acids Research, 36:1, January
Transaction Model for Multilevel Secure Database 2008.
Management Systems,” ACM Transactions on Berg, B., and Roth, J. [1989] Software for Optical Storage,
Information and System Security (TISSEC) , 4:4, Meckler, 1989.
November 2001, pp. 321–370. Bergman, M. K. [2001] “The Deep Web: Surfacing Hidden
Bertino, E., Negri, M., Pelagatti, G., and Sbattella, L. [1992] Value,” The Journal of Electronic Publishing, 7:1,
“Object-Oriented Query Languages: The Notion and August 2001.
the Issues,” TKDE, 4:3, June 1992. Berners-Lee, T., Caillian, R., Grooff, J., Pollermann, B.
Bertino, E., Pagani, E., and Rossi, G. [1992] “Fault [1992] “World-Wide Web: The Information Universe,”
Tolerance and Recovery in Mobile Computing
Electronic Networking: Research, Applications and
Systems,” in Kumar and Han [1992]. Policy , 1:2, 1992.
Bertino, F., Rabitti, F., and Gibbs, S. [1988] “Query Processing Berners-Lee, T., Caillian, R., Lautonen, A., Nielsen, H., and
in a Multimedia Document System,” TOIS, 6:1, 1988. Secret, A. [1994] “The World Wide Web,” CACM, 13:2,
Bhargava, B., and Helal, A. [1993] “Efficient Reliability August 1994.
Mechanisms in Distributed Database Systems,” CIKM, Bernstein, P. [1976] “Synthesizing Third Normal Form
November 1993.
Relations from Functional Dependencies,” TODS, 1:4, Bhargava, B., and Reidl, J. [1988] “A Model for Adaptable December 1976.
Systems for Transaction Processing,” in ICDE [1988]. Bernstein, P. and Goodman, N. [1983] “Multiversion
Biliris, A. [1992] “The Performance of Three Database Concurrency Control—Theory and Algorithms,”
Storage Structures for Managing Large Objects,” in
Bibliography 1103
Biller, H. [1979] “On the Equivalence of Data Base Booch, G., Rumbaugh, J., and Jacobson, I., Unified Schemas—A Semantic Approach to Data Translation,”
Modeling Language User Guide , Addison-Wesley, Information Systems , 4:1, 1979.
Bischoff, J., and T. Alexander, eds., Data Warehouse: Borges, K., Laender, A., and Davis, C. [1999] “Spatial data Practical Advice from the Experts , Prentice-Hall,
integrity constraints in object oriented geographic data 1997.
modeling,” Proc. 7th ACM International Symposium on Biskup, J., Dayal, U., and Bernstein, P. [1979] “Synthesizing
Advances in Geographic Information Systems, 1999. Independent Database Schemas,” in SIGMOD [1979].
Borgida, A., Brachman, R., McGuinness, D., and Resnick, Bitton, D., and Gray, J. [1988] “Disk Shadowing,” in VLDB
L. [1989] “CLASSIC: A Structural Data Model for [1988], pp. 331–338.
Objects,” in SIGMOD [1989]. Bjork, A. [1973] “Recovery Scenario for a DB/DC System,”
Borkin, S. [1978] “Data Model Equivalence,” in VLDB Proc. ACM National Conference, 1973.
Bjorner, D., and Lovengren, H. [1982] “Formalization of Bossomaier, T., and Green, D.[2002] Online GIS and Database Systems and a Formal Definition of IMS,” in
Metadata , Taylor and Francis, 2002. VLDB [1982].
Boukerche, A., and Tuck, T. [2001] “Improving Blaha, M., and Rumbaugh, J. [2005] Object-Oriented
Concurrency Control in Distributed Databases with Modeling and Design with UML , 2nd ed., Prentice-
Predeclared Tables,” in Proc. Euro-Par 2001: Parallel Hall, 2005.
Processing, 7th International Euro-Par Conference, Blaha, M., and Premerlani, W. [1998] Object-Oriented
Manchester, UK August 28–31, 2001, pp. 301–309. Modeling and Design for Database Applications ,
Boutselakis, H. et al. [2003] “E-MSD: the European Prentice-Hall, 1998.
Bioinformatics Institute Macromolecular Structure Blakeley, J., and Martin, N. [1990] “Join Index,
Database,” Nucleic Acids Research, 31:1, January 2003, Materialized View, and Hybrid-Hash Join: A
pp. 458–462.
Performance Analysis,” in ICDE [1990]. Bouzeghoub, M., and Metais, E. [1991] “Semantic Modelling Blakeley, J., Coburn, N., and Larson, P. [1989] “Updated
of Object-Oriented Databases,” in VLDB [1991]. Derived Relations: Detecting Irrelevant and
Boyce, R., Chamberlin, D., King, W., and Hammer, M. Autonomously Computable Updates,” TODS, 14:3,
[1975] “Specifying Queries as Relational Expressions,” September 1989.
CACM , 18:11, November 1975. Blasgen, M. et al. [1981] “System R: An Architectural Over-
Boyd, S., and Keromytis, A. [2004] “SQLrand: Preventing view,” IBM Systems Journal, 20:1, January 1981.
SQL injection attacks,” in Proc. 2nd Applied Blasgen, M., and Eswaran, K. [1976] “On the Evaluation of
Cryptography and Network Security Conf. (ACNS 2004), Queries in a Relational Database System,” IBM
June 2004, pp. 292–302.
Systems Journal , 16:1, January 1976. Bracchi, G., Paolini, P., and Pelagatti, G. [1976] “Binary Bleier, R., and Vorhaus, A. [1968] “File Organization in the
Logical Associations in Data Modelling,” in Nijssen SDC TDMS,” Proc. IFIP Congress.
Bocca, J. [1986] “EDUCE—A Marriage of Convenience: Brachman, R., and Levesque, H. [1984] “What Makes a Prolog and a Relational DBMS,” Proc. Third
Knowledge Base Knowledgeable? A View of Databases International Conference on Logic Programming,
from the Knowledge Level,” in EDS [1984]. Springer-Verlag, 1986.
Brandon, M. et al. [2005] MITOMAP: A human mito- Bocca, J. [1986a] “On the Evaluation Strategy of EDUCE,”
chondrial genome database—2004 Update, Nucleic in SIGMOD [1986].
Acid Research, 34:1, January 2005. Bodorick, P., Riordon, J., and Pyra, J. [1992] “Deciding on
Bratbergsengen, K. [1984] “Hashing Methods and Correct Distributed Query Processing,” TKDE, 4:3,
Relational Algebra Operators,” in VLDB [1984]. June 1992.
Bray, O. [1988] Computer Integrated Manufacturing— Boncz, P., Zukowski, M., and Nes, N. [2005]
The Data Management Strategy , Digital Press, 1988. “MonetDB/X100: Hyper-Pipelining Query Execution,”
Breitbart, Y., Komondoor, R., Rastogi, R., Seshadri, S., in Proc. Conf. on Innovative Data Systems Research
Silberschatz, A. [1999] “Update Propagation Protocols CIDR [2005].
for Replicated Databases,” in SIGMOD [1999], pp. Bonnet, P., Gehrke, J., and Seshadri, P. [2001] “Towards
Sensor Database Systems.,” in Proc. 2nd Int. Conf. on Breitbart, Y., Silberschatz, A., and Thompson, G. [1990] Mobile Data Management, Hong Kong, China, LNCS
“Reliable Transaction Management in a Multidatabase
1104 Bibliography
Brinkhoff, T., Kriegel, H.-P., and Seeger, B. [1993] Referential Integrity Checking and Intelligent Joins,” in “Efficient Processing of Spatial Joins Using R-trees,” in
SIGMOD [1989].
SIGMOD [1993]. Campbell, D., Embley, D., and Czejdo, B. [1985] “A Broder, A. [2002] “A Taxonomy of Web Search,” in SIGIR
Relationally Complete Query Language for the Entity- Forum, 36:2 ,September 2002, pp.3–10
Relationship Model,” in ER Conference [1985]. Brodeur, J., Bédard, Y., and Proulx, M. [2000] “Modelling
Cardenas, A. [1985] Data Base Management Systems, 2nd Geospatial Application Databases Using UML-Based
ed., Allyn and Bacon, 1985.
Repositories Aligned with International Standards in Carey, M. et al. [1986] “The Architecture of the EXODUS Geomatics,” Proc. 8th ACM International Symposium
Extensible DBMS,” in Dittrich and Dayal [1986]. on Advances in Geographic Information Systems.
Carey, M., DeWitt, D., and Vandenberg, S. [1988] “A Data Washington, DC, ACM Press, 2000, pp. 39–46.
Model and Query Language for Exodus,” in SIGMOD Brodie, M., and Mylopoulos, J., eds. [1985] On Knowledge
Base Management Systems , Springer-Verlag, 1985. Carey, M., DeWitt, D., Richardson, J., and Shekita, E. Brodie, M., Mylopoulos, J., and Schmidt, J., eds. [1984] On
[1986a] “Object and File Management in the Conceptual Modeling , Springer-Verlag, 1984.
EXODUS Extensible Database System,” in VLDB Brosey, M., and Shneiderman, B. [1978] “Two
Experimental Comparisons of Relational and Carey, M., Franklin, M., Livny, M., and Shekita, E. [1991] Hierarchical Database Models,” International Journal
“Data Caching Tradeoffs in Client-Server DBMS of Man-Machine Studies , 1978.
Architectures,” in SIGMOD [1991]. Bry, F. [1990] “Query Evaluation in Recursive Databases:
Carlis, J. [1986] “HAS, a Relational Algebra Operator or Bottom-up and Top-down Reconciled,” DKE, 5, 1990,
Divide Is Not Enough to Conquer,” in ICDE [1986]. pp. 289–312.
Carlis, J., and March, S. [1984] “A Descriptive Model of Buckley, C., Salton, G., and Allan, J. [1993] “The SMART
Physical Database Design Problems and Solutions,” in Information Retrieval Project,” In Proc. of the Workshop
ICDE [1984].
on Human Language Technology, Human Language Carneiro, G., and Vasconselos, N. [2005] “A Database Technology Conference, Association for Computa-
Centric View of Semantic Image Annotation and tional Linguistics, March 1993.
Retrieval,” in SIGIR [2005].
Bukhres, O. [1992] “Performance Comparison of Carroll, J. M. [1995] Scenario-Based Design: Envisioning Distributed Deadlock Detection Algorithms,” in ICDE
Work and Technology in System Development , Wiley, [1992].
Buneman, P., and Frankel, R. [1979] “FQL: A Functional Casanova, M., and Vidal, V. [1982] “Toward a Sound View Query Language,” in SIGMOD [1979].
Integration Method,” in PODS [1982]. Burkhard, W. [1976] “Hashing and Trie Algorithms for
Casanova, M., Fagin, R., and Papadimitriou, C. [1981] Partial Match Retrieval,” TODS, 1:2, June 1976, pp.
“Inclusion Dependencies and Their Interaction with 175–187.
Functional Dependencies,” in PODS [1981]. Burkhard, W. [1979] “Partial-match Hash Coding: Benefits
Casanova, M., Furtado, A., and Tuchermann, L. [1991] “A of Redunancy,” TODS, 4:2, June 1979, pp. 228–239.
Software Tool for Modular Database Design,” TODS, Bush, V. [1945] “As We May Think,” Atlantic Monthly,
16:2, June 1991.
176:1, January 1945. Reprinted in Kochen, M., ed., The Casanova, M., Tuchermann, L., Furtado, A., and Braga, A. Growth of Knowledge , Wiley, 1967.
[1989] “Optimization of Relational Schemas Butterworth, P. Otis, A., and Stein, J. [1991] : “The
Containing Inclusion Dependencies,” in VLDB [1989]. Gemstone Object Database Management System,” in
Castano, S., DeAntonellio, V., Fugini, M. G., and Pernici, B. CACM , 34:10, October 1991, pp. 64–77.
[1998] “Conceptual Schema Analysis: Techniques and Byte [1995] Special Issue on Mobile Computing, June
Applications,” TODS, 23:3, September 1998, pp. 1995.
CACM [1995] Special issue of the Communications of Catarci, T., Costabile, M. F., Levialdi, S., and Batini, C. the ACM , on Digital Libraries, 38:5, May 1995.
[1997] “Visual Query Systems for Databases: A Survey,” CACM [1998] Special issue of the Communications of
Journal of Visual Languages and Computing , 8:2, the ACM on Digital Libraries: Global Scope and
June 1997, pp. 215–260.
Unlimited Access, 41:4, April 1998. Catarci, T., Costabile, M. F., Santucci, G., and Tarantino, L., Cammarata, S., Ramachandra, P., and Shane, D. [1989]
eds. [1998] Proc. Fourth International Workshop on
Bibliography 1105
Cattell, R. [1991] Object Data Management: Object- Chakravarthy, S., Anwar, E., Maugis, L., and Mishra, D. Oriented and Extended Relational Database Systems ,
[1994] Design of Sentinel: An Object-oriented DBMS Addison-Wesley, 1991.
with Event-based Rules, Information and Software Cattell, R., and Barry, D. K. [2000], The Object Data
Technology , 36:9, 1994.
Standard: ODMG 3.0 , Morgan Kaufmann, 2000. Chakravarthy, S., Karlapalem, K., Navathe, S., and Tanaka, Cattell, R., and Skeen, J. [1992] “Object Operations
A. [1993] “Database Supported Co-operative Problem Benchmark,” TODS, 17:1, March 1992.
Solving,” International Journal of Intelligent Co- Cattell, R., ed. [1993] The Object Database Standard:
operative Information Systems , 2:3, September 1993. ODMG-93 , Release 1.2, Morgan Kaufmann, 1993.
Chakravarthy, U., Grant, J., and Minker, J. [1990] “Logic- Cattell, R., ed. [1997] The Object Database Standard:
Based Approach to Semantic Query Optimization,” ODMG, Release 2.0 , Morgan Kaufmann, 1997.
TODS , 15:2, June 1990.
Ceri, S., and Fraternali, P. [1997] Designing Database Chalmers, M., and Chitson, P. [1992] “Bead: Explorations
Applications with Objects and Rules: The IDEA
in Information Visualization,” Proc. ACM SIGIR Methodology , Addison-Wesley, 1997.
International Conference, June 1992. Ceri, S., and Owicki, S. [1983] “On the Use of Optimistic
Chamberlin, D. et al. [1976] “SEQUEL 2: A Unified Methods for Concurrency Control in Distributed
Approach to Data Definition, Manipulation, and Databases,” Proc. Sixth Berkeley Workshop on
Control,” IBM Journal of Research and Development, Distributed Data Management and Computer Networks,
20:6, November 1976.
February 1983. Chamberlin, D. et al. [1981] “A History and Evaluation of Ceri, S., and Pelagatti, G. [1984] “Correctness of Query
System R,” CACM, 24:10, October 1981. Execution Strategies in Distributed Databases,” TODS,
Chamberlin, D., and Boyce, R. [1974] “SEQUEL: A 8:4, December 1984.
Structured English Query Language,” in SIGMOD Ceri, S., and Pelagatti, G. [1984a] Distributed Databases:
Principles and Systems , McGraw-Hill, 1984. Chan, C., Ooi, B., and Lu, H. [1992] “Extensible Buffer Ceri, S., and Tanca, L. [1987] “Optimization of Systems of
Management of Indexes,” in VLDB [1992]. Algebraic Equations for Evaluating Datalog Queries,”
Chandy, K., Browne, J., Dissley, C., and Uhrig, W. [1975] in VLDB [1987].
“Analytical Models for Rollback and Recovery Ceri, S., Gottlob, G., and Tanca, L. [1990] Logic
Strategies in Database Systems,” TSE, 1:1, March 1975. Programming and Databases , Springer-Verlag, 1990.
Chang, C. [1981] “On the Evaluation of Queries Ceri, S., Navathe, S., and Wiederhold, G. [1983]
Containing Derived Relations in a Relational “Distribution Design of Logical Database Schemas,”
Database” in Gallaire et al. [1981]. TSE , 9:4, July 1983.
Chang, C., and Walker, A. [1984] “PROSQL: A Prolog Ceri, S., Negri, M., and Pelagatti, G. [1982] “Horizontal
Programming Interface with SQL/DS,” in EDS [1984]. Data Partitioning in Database Design,” in SIGMOD
Chang, E., and Katz, R. [1989] “Exploiting Inheritance and [1982].
Structure Semantics for Effective Clustering and Cesarini, F., and Soda, G. [1991] “A Dynamic Hash
Buffering in Object-Oriented Databases,” in SIGMOD Method with Signature,” TODS, 16:2, June 1991.
Chakrabarti, S. [2002] Mining the Web: Discovering Chang, N., and Fu, K. [1981] “Picture Query Languages Knowledge from Hypertext Data . Morgan-
for Pictorial Databases,” IEEE Computer, 14:11, Kaufmann, 2002.
November 1981.
Chakrabarti, S. et al. [1999] “Mining the Web’s Link Chang, P., and Myre, W. [1988] “OS/2 EE Database Structure,” Computer 32:8, August 1999, pp. 60–67.
Manager: Overview and Technical Highlights,” IBM Chakravarthy, S. [1990] “Active Database Management
Systems Journal , 27:2, 1988. Systems: Requirements, State-of-the-Art, and an
Chang, S., Lin, B., and Walser, R. [1979] “Generalized Evaluation,” in ER Conference [1990].
Zooming Techniques for Pictorial Database Systems,” Chakravarthy, S. [1991] “Divide and Conquer: A Basis for
NCC, AFIPS, 48, 1979.
Augmenting a Conventional Query Optimizer with Chatzoglu, P. D., and McCaulay, L. A. [1997] “Require- Multiple Query Processing Capabilities,” in ICDE [1991].
ments Capture and Analysis: A Survey of Current Chakravarthy, S. et al. [1989] “HiPAC: A Research Project
Practice,” Requirements Engineering, 1997, pp. 75–88. in Active, Time Constrained Database Management,”
Chaudhri, A., Rashid, A., and Zicari, R., eds. [2003] XML Final Technical Report, XAIT-89-02, Xerox Advanced
Data Management: Native XML and XML-Enabled
1106 Bibliography
Chaudhuri, S., and Dayal, U. [1997] “An Overview of Data Christodoulakis, S., and Faloutsos, C. [1986] “Design and Warehousing and OLAP Technology,” SIGMOD
Performance Considerations for an Optical Disk-Based Record , 26:1, March 1997.
Multimedia Object Server,” IEEE Computer, 19:12, Chen, M., and Yu, P. [1991] “Determining Beneficial
December 1986.
Semijoins for a Join Sequence in Distributed Query Chrysanthis, P. [1993] “Transaction Processing in a Mobile Processing,” in ICDE [1991].
Computing Environment,” Proc. IEEE Workshop on Chen, M., Han, J., and Yu, P. S., [1996] “Data Mining: An
Advances in Parallel and Distributed Systems, October Overview from a Database Perspective,” TKDE, 8:6,
1993, pp. 77–82.
December 1996. Chu, W., and Hurley, P. [1982] “Optimal Query Processing Chen, P. [1976] “The Entity Relationship Mode—Toward
for Distributed Database Systems,” IEEE Transactions a Unified View of Data,” TODS, 1:1, March 1976.
on Computers , 31:9, September 1982. Chen, P., and Patterson, D. [1990]. “Maximizing perform-
Ciborra, C., Migliarese, P., and Romano, P. [1984] “A ance in a striped disk array,” in Proceedings of
Methodological Inquiry of Organizational Noise in Symposium on Computer Architecture, IEEE, New York,
Socio-Technical Systems,” Human Relations, 37:8, 1990.
Chen, P. et al. [1994] RAID High Performance, Reliable Claybrook, B. [1992] File Management Techniques, Secondary Storage, ACM Computing Surveys, 26:2,
Wiley, 1992.
1994. Claybrook, B. [1992] OLTP: OnLine Transaction Chen, Q., and Kambayashi, Y. [1991] “Nested Relation
Processing Systems , Wiley, 1992. Based Database Knowledge Representation,” in
Clementini, E., and Di Felice, P. [2000] “Spatial SIGMOD [1991].
Operators,” in SIGMOD Record 29:3, 2000, pp. 31–38. Cheng, J. [1991] “Effective Clustering of Complex Objects
Clifford, J., and Tansel, A. [1985] “On an Algebra for in Object-Oriented Databases,” in SIGMOD [1991].
Historical Relational Databases: Two Views,” in Cheung, D., et al. [1996] “A Fast and Distributed
SIGMOD [1985].
Algorithm for Mining Association Rules,” in Proc. Int. Clocksin, W. F., and Mellish, C. S. [2003] Programming in Conf. on Parallel and Distributed Information Systems,
Prolog: Using the ISO Standard , 5th ed., Springer, PDIS [1996].
Childs, D. [1968] “Feasibility of a Set Theoretical Data Cockcroft, S. [1997] “A Taxonomy of Spatial Data Integrity Structure—A General Structure Based on a
Constraints,” GeoInformatica, 1997, pp. 327–343. Reconstituted Definition of Relation,” Proc. IFIP
CODASYL [1978] Data Description Language Journal of Congress, 1968.
Development, Canadian Government Publishing Chimenti, D. et al. [1987] “An Overview of the LDL
Centre, 1978.
System,” IEEE Data Engineering Bulletin, 10:4, 1987, Codd, E. [1970] “A Relational Model for Large Shared pp. 52–62.
Data Banks,” CACM, 13:6, June 1970. Chimenti, D. et al. [1990] “The LDL System Prototype,”
Codd, E. [1971] “A Data Base Sublanguage Founded on TKDE , 2:1, March 1990.
the Relational Calculus,” Proc. ACM SIGFIDET Chin, F. [1978] “Security in Statistical Databases for
Workshop on Data Description, Access, and Control, Queries with Small Counts,” TODS, 3:1, March 1978.
November 1971.
Chin, F., and Ozsoyoglu, G. [1981] “Statistical Database Codd, E. [1972] “Relational Completeness of Data Base Design,” TODS, 6:1, March 1981.
Sublanguages,” in Rustin [1972]. Chintalapati, R., Kumar, V., and Datta, A. [1997] “An
Codd, E. [1972a] “Further Normalization of the Data Base Adaptive Location Management Algorithm for Mobile
Relational Model,” in Rustin [1972]. Computing,” Proc. 22nd Annual Conf. on Local
Codd, E. [1974] “Recent Investigations in Relational Computer Networks (LCN ’97), Minneapolis, 1997.
Database Systems,” Proc. IFIP Congress, 1974. Chou, H.-T., and DeWitt, D. [1985] “An Evaluation of
Codd, E. [1978] “How About Recently? (English Dialog Buffer Management Strategies or Relational
with Relational Data Bases Using Rendezvous Version Databases,” VLDB [1985], pp. 127–141.
1),” in Shneiderman [1978]. Chou, H.-T., and Kim, W. [1986] “A Unifying Framework
Codd, E. [1979] “Extending the Database Relational for Version Control in a CAD Environment,” in VLDB
Model to Capture More Meaning,” TODS, 4:4, [1986], pp. 336–344.
December 1979.
Christodoulakis, S. et al. [1984] “Development of a Codd, E. [1982] “Relational Database: A Practical
Bibliography 1107
Codd, E. [1985] “Is Your DBMS Really Relational?” and Cruz, I. [1992] “Doodle: A Visual Language for Object- “Does Your DBMS Run By the Rules?,” Computer
Oriented Databases,” in SIGMOD [1992]. World , October 14 and October 21, 1985.
Curtice, R. [1981] “Data Dictionaries: An Assessment of Codd, E. [1986] “An Evaluation Scheme for Database
Current Practice and Problems,” in VLDB [1981]. Management Systems That Are Claimed to Be
Cuticchia, A., Fasman, K., Kingsbury, D., Robbins, R., and Relational,” in ICDE [1986].
Pearson, P. [1993] “The GDB Human Genome Codd, E. [1990] Relational Model for Data Management-
Database Anno 1993.” Nucleic Acids Research, 21:13, Version 2 , Addison-Wesley, 1990.
Codd, E. F., Codd, S. B., and Salley, C. T. [1993] “Providing Czejdo, B., Elmasri, R., Rusinkiewicz, M., and Embley, D. OLAP (On-Line Analytical Processing) to User
[1987] “An Algebraic Language for Graphical Query Analyst: An IT Mandate,” a white paper at
Formulation Using an Extended Entity-Relationship http://www.cs.bgu.ac.il/~dbm031/dw042/Papers/olap
Model,” Proc. ACM Computer Science Conference, 1987. _to_useranalysts_wp.pdf, 1993.
Dahl, R., and Bubenko, J. [1982] “IDBD: An Interactive Comer, D. [1979] “The Ubiquitous B-tree,” ACM
Design Tool for CODASYL DBTG Type Databases,” in Computing Surveys , 11:2, June 1979.
VLDB [1982].
Comer, D. [2008] Computer Networks and Internets, 5th Dahl, V. [1984] “Logic Programming for Constructive ed., Prentice-Hall, 2008.
Database Systems,” in EDS [1984]. Cooley, R. [2003] “The Use of Web Structure and Content
Danforth, S., and Tomlinson, C. [1988] “Type Theories to Identify Subjectively Interesting Web Usage
and Object-oriented Programming,” ACM Computing Patterns,” ACM Trans. On Internet Technology, 3:2,
Surveys , 20:1, 1998, pp. 29–72. May 2003, pp. 93–116.
Das, S. [1992] Deductive Databases and Logic Cooley, R., Mobasher, B., and Srivastava, J. [1997] “Web
Programming , Addison-Wesley, 1992. Mining: Information and Pattern Discovery on the
Das, S., Antony, S., Agrawal, D. et al. [2008] “Clouded World Wide Web,” in Proc. Ninth IEEE Int. Conf. on
Data: Comprehending Scalable Data Management Tools with Artificial Intelligence (ICTAI), November
Systems,” UCSB CS Technical Report 2008-18, 1997, pp. 558–567.
November 2008.
Cooley, R., Mobasher, B., and Srivastava, J. [2000] Date, C. [1983] An Introduction to Database Systems, “Automatic personalization based on Web usage min-
Vol. 2, Addison-Wesley, 1983. ing,” CACM, 43:8, August 2000.
Date, C. [1983a] “The Outer Join,” Proc. Second Corcho, C., Fernandez-Lopez, M., and Gomez-Perez, A.
International Conference on Databases (ICOD-2), 1983. [2003] “Methodologies, Tools and Languages for
Date, C. [1984] “A Critique of the SQL Database Building Ontologies. Where Is Their Meeting Point?,”
Language,” ACM SIGMOD Record, 14:3, November DKE , 46:1, July 2003.
Cornelio, A., and Navathe, S. [1993] “Applying Active Date, C. [2001] The Database Relational Model: A Database Models for Simulation,” in Proceedings of
Retrospective Review and Analysis: A Historical
1993 Winter Simulation Conference, IEEE, Los Angeles,
Account and Assessment of E. F. Codd’s Contribution
December 1993. to the Field of Database Technology , Addison-Wesley, Corson, S., and Macker, J. [1999] “Mobile Ad-Hoc
Networking: Routing Protocol Performance Issues and Date, C. [2004] An Introduction to Database Systems, Performance Considerations,” IETF Request for
8th ed., Addison-Wesley, 2004. Comments No. 2501, January 1999, available at
Date, C. J., and Darwen, H. [1993] A Guide to the SQL www.ietf.org/rfc/rfc2501.txt.
Standard , 3rd ed., Addison-Wesley. Cosmadakis, S., Kanellakis, P. C., and Vardi, M. [1990]
Date, C., and White, C. [1988] A Guide to SQL/DS, “Polynomial-time Implication Problems for Unary
Addison-Wesley, 1988.
Inclusion Dependencies,” JACM, 37:1, 1990, pp. 15–46. Date, C., and White, C. [1989] A Guide to DB2, 3rd ed., Covi, L., and Kling, R. [1996] “Organizational Dimensions
Addison-Wesley, 1989.
of Effective Digital Library Use: Closed Rational and Davies, C. [1973] “Recovery Semantics for a DB/DC Open Natural Systems Models,” Journal of American
System,” Proc. ACM National Conference, 1973. Society of Information Science (JASIS) , 47:9, 1996,
Dayal, U. et al. [1987] “PROBE Final Report,” Technical pp. 672–689.
Report CCA-87-02, Computer Corporation of Croft, B., Metzler, D., and Strohman, T. [2009] Search
America, December 1987.
1108 Bibliography
Dayal, U., Hsu, M., and Ladin, R. [1991] “A Transaction Information Science , Special Issue on Multimedia Model for Long-Running Activities,” in VLDB [1991].
Informing Technologies, Part 1, 2:4, 1999. DBTG [1971] Report of the CODASYL Data Base Task
Dipert, B., and Levy, M. [1993] Designing with Flash Group , ACM, April 1971.
Memory , Annabooks, 1993. Deelman, E., and Chervenak, A. L. [2008] “Data
Dittrich, K. [1986] “Object-Oriented Database Systems: Management Challenges of Data-Intensive Scientific
The Notion and the Issues,” in Dittrich and Dayal Workflows,” in Proc. IEEE International Symposium on
Cluster, Cloud, and Grid Computing, 2008, pp. Dittrich, K., and Dayal, U., eds. [1986] Proc. International 687–692.
Workshop on Object-Oriented Database Systems, IEEE Delcambre, L., Lim, B., and Urban, S. [1991] “Object-
CS, Pacific Grove, CA, September 1986. Centered Constraints,” in ICDE [1991].
Dittrich, K., Kotz, A., and Mulle, J. [1986] “An DeMarco, T. [1979] Structured Analysis and System
Event/Trigger Mechanism to Enforce Complex Specification , Prentice-Hall, 1979.
Consistency Constraints in Design Databases,” in ACM DeMers, M. [2002] Fundamentals of GIS, John Wiley,
SIGMOD Record , 15:3, 1986. 2002.
DKE [1997] Special Issue on Natural Language Processing, DeMichiel, L. [1989] “Performing Operations Over
DKE , 22:1, 1997.
Mismatched Domains,” in ICDE [1989]. Dodd, G. [1969] “APL—A Language for Associative Data Denning, D. [1980] “Secure Statistical Databases with
Handling in PL/I,” Proc. Fall Joint Computer Random Sample Queries,” TODS, 5:3, September 1980.
Conference, AFIPS, 29, 1969. Denning, D. E., and Denning, P. J. [1979] “Data Security,”
Dodd, G. [1969] “Elements of Data Management ACM Computing Surveys , 11:3, September 1979, pp.
Systems,” ACM Computing Surveys, 1:2, June 1969. 227–249.
Dogac, A. [1998] Special Section on Electronic Denning, D. et al. [1987] “A Multi-level Relational Data
Commerce, ACM SIGMOD Record, 27:4, December Model,” in Proc. IEEE Symp. On Security and Privacy,
1987, pp. 196–201. Dogac, A., Ozsu, M. T., Biliris, A., and Sellis, T., eds. [1994] Deshpande, A. [1989] “An Implementation for Nested
Advances in Object-oriented Databases Systems , Relational Databases,” Technical Report, Ph.D. disser-
NATO ASI Series. Series F: Computer and Systems tation, Indiana University, 1989.
Sciences, Vol. 130, Springer-Verlag, 1994. Devor, C., and Weeldreyer, J. [1980] “DDTS: A Testbed for
Dos Santos, C., Neuhold, E., and Furtado, A. [1979] “A Distributed Database Research,” Proc. ACM Pacific
Data Type Approach to the Entity-Relationship Conference, 1980.
Model,” in ER Conference [1979]. DeWitt, D. et al. [1984] “Implementation Techniques for
Du, D., and Tong, S. [1991] “Multilevel Extendible Main Memory Databases,” in SIGMOD [1984].
Hashing: A File Structure for Very Large Databases,” DeWitt, D. et al. [1990] “The Gamma Database Machine
TKDE , 3:3, September 1991. Project,” TKDE, 2:1, March 1990.
Du, H., and Ghanta, S. [1987] “A Framework for Efficient DeWitt, D., Futtersack, P., Maier, D., and Velez, F. [1990] “A
IC/VLSI CAD Databases,” in ICDE [1987]. Study of Three Alternative Workstation Server
Dumas, P. et al. [1982] “MOBILE-Burotique: Prospects for Architectures for Object-Oriented Database Systems,”
the Future,” in Naffah [1982]. in VLDB [1990].
Dumpala, S., and Arora, S. [1983] “Schema Translation Dhawan, C. [1997] Mobile Computing, McGraw-Hill,
Using the Entity-Relationship Approach,” in ER 1997.
Conference [1983].
Di, S. M. [2005] Distributed Data Management in Grid Dunham, M., and Helal, A. [1995] “Mobile Computing Environments , Wiley, 2005.
and Databases: Anything New?” ACM SIGMOD Dietrich, S., Friesen, O., and Calliss, W. [1999] “On
Record , 24:4, December 1995. Deductive and Object Oriented Databases: The
Dwyer, S. et al. [1982] “A Diagnostic Digital Imaging VALIDITY Experience,” Technical Report, Arizona
System,” Proc. IEEE CS Conference on Pattern State University, 1999.
Recognition and Image Processing, June 1982. Diffie, W., and Hellman, M. [1979] “Privacy and
Eastman, C. [1987] “Database Facilities for Engineering Authentication,” Proceedings of the IEEE, 67:3, March
Design,” Proceedings of the IEEE, 69:10, October 1979, pp. 397–429.
Dimitrova, N. [1999] “Multimedia Content Analysis and EDS [1984] Expert Database Systems, Kerschberg, L., ed.
Bibliography 1109
Systems, Kiawah Island, SC, October 1984), Elmasri, R., Larson, J., and Navathe, S. [1986] “Schema Benjamin/Cummings, 1986.
Integration Algorithms for Federated Databases and EDS [1986] Expert Database Systems, Kerschberg, L., ed.
Logical Database Design,” Honeywell CSDD, Technical (Proc. First International Conference on Expert Database
Report CSC-86-9: 8212, January 1986. Systems, Charleston, SC, April 1986), Benjamin/
Elmasri, R., Srinivas, P., and Thomas, G. [1987] Cummings, 1987.
“Fragmentation and Query Decomposition in the ECR EDS [1988] Expert Database Systems, Kerschberg, L., ed.
Model,” in ICDE [1987].
(Proc. Second International Conference on Expert Elmasri, R., Weeldreyer, J., and Hevner, A. [1985] “The Database Systems, Tysons Corner, VA, April 1988),
Category Concept: An Extension to the Entity- Benjamin/Cummings.
Relationship Model,” DKE, 1:1, May 1985. Eick, C. [1991] “A Methodology for the Design and
Engelbart, D., and English, W. [1968] “A Research Center Transformation of Conceptual Schemas,” in VLDB
for Augmenting Human Intellect,” Proc. Fall Joint [1991].
Computer Conference, AFIPS, December 1968. ElAbbadi, A., and Toueg, S. [1988] “The Group Paradigm
Epstein, R., Stonebraker, M., and Wong, E. [1978] for Concurrency Control,” in SIGMOD [1988].
“Distributed Query Processing in a Relational ElAbbadi, A., and Toueg, S. [1989] “Maintaining
Database System,” in SIGMOD [1978]. Availability in Partitioned Replicated Databases,”
ER Conference [1979] Entity-Relationship Approach to TODS , 14:2, June 1989.
Systems Analysis and Design , Chen, P., ed. (Proc. First Ellis, C., and Nutt, G. [1980] “Office Information Systems
International Conference on Entity-Relationship and Computer Science,” ACM Computing Surveys,
Approach, Los Angeles, December 1979), North- 12:1, March 1980.
Holland, 1980.
Elmagarmid A. K., ed. [1992] Database Transaction Models ER Conference [1981] Entity-Relationship Approach to for Advanced Applications , Morgan Kaufmann, 1992.
Information Modeling and Analysis , Chen, P., eds. Elmagarmid, A., and Helal, A. [1988] “Supporting
(Proc. Second International Conference on Entity- Updates in Heterogeneous Distributed Database
Relationship Approach, Washington, October 1981), Systems,” in ICDE [1988], pp. 564–569.
Elsevier Science, 1981.
Elmagarmid, A., Leu, Y., Litwin, W., and Rusinkiewicz, M. ER Conference [1983] Entity-Relationship Approach to [1990] “A Multidatabase Transaction Model for
Software Engineering , Davis, C., Jajodia, S., Ng, P., and Interbase,” in VLDB [1990].
Yeh, R., eds. (Proc. Third International Conference on Elmasri, R., and Larson, J. [1985] “A Graphical Query
Entity-Relationship Approach, Anaheim, CA, October Facility for ER Databases,” in ER Conference [1985].
1983), North-Holland, 1983. Elmasri, R., and Wiederhold, G. [1979] “Data Model
ER Conference [1985] Proc. Fourth International Integration Using the Structural Model,” in SIGMOD
Conference on Entity-Relationship Approach, Liu, J., ed., [1979].
Chicago, October 1985, IEEE CS. Elmasri, R., and Wiederhold, G. [1980] “Structural
ER Conference [1986] Proc. Fifth International Conference Properties of Relationships and Their Representation,”
on Entity-Relationship Approach, Spaccapietra, S., ed., NCC, AFIPS, 49, 1980.
Dijon, France, November 1986, Express-Tirages. Elmasri, R., and Wiederhold, G. [1981] “GORDAS: A
ER Conference [1987] Proc. Sixth International Conference Formal, High-Level Query Language for the Entity-
on Entity-Relationship Approach, March, S., ed., New Relationship Model,” in ER Conference [1981].
York, November 1987.
Elmasri, R., and Wuu, G. [1990] “A Temporal Model and ER Conference [1988] Proc. Seventh International Query Language for ER Databases,” in ICDE [1990].
Conference on Entity-Relationship Approach, Batini, C., Elmasri, R., and Wuu, G. [1990a] “The Time Index: An
ed., Rome, November 1988. Access Structure for Temporal Data,” in VLDB [1990].
ER Conference [1989] Proc. Eighth International Conference Elmasri, R., James, S., and Kouramajian, V. [1993]
on Entity-Relationship Approach, Lochovsky, F., ed., “Automatic Class and Method Generation for Object-
Toronto, October 1989.
Oriented Databases,” Proc. Third International ER Conference [1990] Proc. Ninth International Conference Conference on Deductive and Object-Oriented
on Entity-Relationship Approach, Kangassalo, H., ed., Databases (DOOD-93), Phoenix, AZ, December 1993.
Lausanne, Switzerland, September 1990. Elmasri, R., Kouramajian, V., and Fernando, S. [1993]
ER Conference [1991] Proc. Tenth International Conference “Temporal Database Modeling: An Object-Oriented
on Entity-Relationship Approach, Teorey, T., ed., San
1110 Bibliography
ER Conference [1992] Proc. Eleventh International ER Conference [2007] Proc. 26th Int. Conference on Conference on Entity-Relationship Approach, Pernul, G.,
Conceptual Modeling, Parent, C., Schewe, K.-D., Storey, and Tjoa, A., eds., Karlsruhe, Germany, October 1992.
V., Thalheim, B. (eds.), Auckland, New Zealand, LNCS ER Conference [1993] Proc. Twelfth International
4801, Springer, 2007.
Conference on Entity-Relationship Approach, Elmasri, R., ER Conference [2008] Proc. 27th Int. Conference on and Kouramajian, V., eds., Arlington, TX, December
Conceptual Modeling, Li, Q., Spaccapietra, S., Yu, E. S. 1993.
K., Olive, A. (eds.), Barcelona, Spain, LNCS 5231, ER Conference [1994] Proc. Thirteenth International Con-
Springer, 2008.
ference on Entity-Relationship Approach, Loucopoulos, ER Conference [2009] Proc. 28th Int. Conference on P., and Theodoulidis, B., eds., Manchester, England,
Conceptual Modeling, Laender, A., Castano, S., Dayal, December 1994.
U., Casati, F., de Oliveira (eds.), Gramado, RS, Brazil, ER Conference [1995] Proc. Fourteenth International
LNCS 5829, Springer, 2009. Conference on ER-OO Modeling, Papazouglou, M., and
ER Conference [2010] Proc. 29th Int. Conference on Tari, Z., eds., Brisbane, Australia, December 1995.
Conceptual Modeling, Vancouver, Canada, LNCS ER Conference [1996] Proc. Fifteenth International
Springer, forthcoming.
Conference on Conceptual Modeling, Thalheim, B., ed., ESRI [2009] “The Geodatabase: Modeling and Managing Cottbus, Germany, October 1996.
Spatial Data” in ArcNews, 30:4, ESRI, Winter ER Conference [1997] Proc. Sixteenth International
Conference on Conceptual Modeling, Embley, D., ed., Ester, M., Kriegel, H.-P., and Jorg, S., [2001] “Algorithms Los Angeles, October 1997.
and Applications for Spatial Data Mining,” in Research ER Conference [1998] Proc. Seventeenth International
Monograph in GIS , CRC Press, [2001]. Conference on Conceptual Modeling, Ling, T.-K., ed.,
Ester, M., Kriegel, H.-P., Sander, J., and Xu, X. [1996]. “A Singapore, November 1998.
Density-Based Algorithm for Discovering Clusters in ER Conference [1999] Proc. Eighteenth Conference on
Large Spatial Databases with Noise,” in KDD, 1996, Conceptual Modeling, Akoka, J., Bouzeghoub, M.,
AAAI Press, pp. 226–231.
Comyn-Wattiau, I., Métais, E., (eds.): Paris, France, Eswaran, K., and Chamberlin, D. [1975] “Functional LNCS 1728, Springer, 1999.
Specifications of a Subsystem for Database Integrity,” ER Conference [2000] Proc. Nineteenth Conference on
in VLDB [1975].
Conceptual Modeling, Laender, A., Liddle, S., Storey, V., Eswaran, K., Gray, J., Lorie, R., and Traiger, I. [1976] “The (eds.), Salt Lake City, LNCS 1920, Springer, 2000.
Notions of Consistency and Predicate Locks in a Data ER Conference [2001] Proc. Twentieth Conference on
Base System,” CACM, 19:11, November 1976. Conceptual Modeling, Kunii, H., Jajodia, S., Solveberg,
Etzioni, O. [1996] “The World-Wide Web: quagmire or A., (eds.), Yokohama, Japan, LNCS 2224, Springer,
gold mine?” CACM, 39:11, November 1996, pp. 65–68. 2001.
Everett, G., Dissly, C., and Hardgrave, W. [1971] RFMS ER Conference [2002] Proc. 21st Int. Conference on
User Manual , TRM-16, Computing Center, University Conceptual Modeling, Spaccapietra, S., March, S.,
of Texas at Austin, 1981.
Kambayashi, Y., (eds.), Tampere, Finland, LNCS 2503, Fagin, R. [1977] “Multivalued Dependencies and a New Springer, 2002.
Normal Form for Relational Databases,” TODS, 2:3, ER Conference [2003] Proc. 22nd Int. Conference on
September 1977.
Conceptual Modeling, Song, I.-Y., Liddle, S., Ling, T.- Fagin, R. [1979] “Normal Forms and Relational Database W., Scheuermann, P., (eds.), Tampere, Finland, LNCS
Operators,” in SIGMOD [1979]. 2813, Springer, 2003.
Fagin, R. [1981] “A Normal Form for Relational Databases ER Conference [2004] Proc. 23rd Int. Conference on
That Is Based on Domains and Keys,” TODS, 6:3, Conceptual Modeling, Atzeni, P., Chu, W., Lu, H., Zhou,
September 1981.
S., Ling, T.-W., (eds.), Shanghai, China, LNCS 3288, Fagin, R., Nievergelt, J., Pippenger, N., and Strong, H. Springer, 2004.
[1979] “Extendible Hashing—A Fast Access Method ER Conference [2005] Proc. 24th Int. Conference on
for Dynamic Files,” TODS, 4:3, September 1979. Conceptual Modeling, Delacambre, L.M.L., Kop, C.,
Falcone, S., and Paton, N. [1997]. “Deductive Object- Mayr, H., Mylopoulos, J., Pastor, O., (eds.), Klagenfurt,
Oriented Database Systems: A Survey,” Proc. 3rd Austria, LNCS 3716, Springer, 2005.
International Workshop Rules in Database Systems ER Conference [2006] Proc. 25th Int. Conference on
(RIDS ’97), Skovde, Sweden, June 1997.
Bibliography 1111
Faloutsos, C. et al. [1994] “Efficient and Effective Ford, D., Blakeley, J., and Bannon, T. [1993] “Open OODB: Querying by Image Content,” Journal of Intelligent
A Modular Object-Oriented DBMS,” in SIGMOD Information Systems , 3:4, 1994.
Faloutsos, G., and Jagadish, H. [1992] “On B-Tree Indices Foreman, G., and Zahorjan, J. [1994] “The Challenges of for Skewed Distributions,” in VLDB [1992].
Mobile Computing,” IEEE Computer, April 1994. Fan, J., Gao, Y., Luo, H. and Xu, G.[2004] “Automatic Image
Fotouhi, F., Grosky, W., Stanchev, P.[2007] , eds., Proc. of Annotation by Using Concept-sensitive Salient Objects
the First ACM Workshop on Many Faces of the for Image Content Representation,” in SIGIR, 2004.
Multimedia Semantics, MS 2007, Augsburg Germany, Farag, W., and Teorey, T. [1993] “FunBase: A Function-
September 2007.
based Information Management System,” CIKM, Fowler, M., and Scott, K. [2000] UML Distilled, 2nd ed., November 1993.
Addison-Wesley, 2000.
Farahmand, F., Navathe, S., Sharp, G., Enslow, P. [2003] Franaszek, P., Robinson, J., and Thomasian, A. [1992] “Managing Vulnerabilities of Information Systems to
“Concurrency Control for High Contention Security Incidents,” Proc. ACM 5th International
Environments,” TODS, 17:2, June 1992. Conference on Electronic Commerce, ICEC 2003,
Frank, A. [2003] “A linguistically justified proposal for a Pittsburgh, PA, September 2003, pp. 348–354.
spatio-temporal ontology,” a position paper in Proc. Farahmand, F., Navathe, S., Sharp, G., Enslow, P., “A
COSIT03- Int. Conf. on Spatial Information Theory, Management Perspective on Risk of Security Threats to
Ittingen, Switzerland, LNCS 2825, September 2003. Information Systems,” Journal of Information
Franklin, F. et al. [1992] “Crash Recovery in Client-Server Technology & Management , Vol. 6, pp. 203–225, 2005.
EXODUS,” in SIGMOD [1992]. Fayyad, U., Piatesky-Shapiro, G., Smyth, P., Uthurusamy,
Fraternali, P. [1999] Tools and Approaches for Data R. [1997] Advances in Knowledge Discovery and Data
Intensive Web Applications: A Survey, ACM Computing Mining , MIT Press, 1997.
Surveys, 31:3, September 1999. Fellbaum, C., ed. [1998] WordNet: An Electronic Lexical
Frenkel, K. [1991] “The Human Genome Project and Database , MIT Press, 1998.
Informatics,” CACM, November 1991. Fensel, D. [2000] “The Semantic Web and Its Languages,”
Friesen, O., Gauthier-Villars, G., Lefelorre, A., and Vieille, IEEE Intelligent Systems , Vol. 15, No. 6, Nov./Dec.
L., “Applications of Deductive Object-Oriented 2000, pp. 67–73.
Databases Using DEL,” in Ramakrishnan (1995). Fensel, D. [2003]: Ontologies: Silver Bullet for
Friis-Christensen, A., Tryfona, N., and Jensen, C. S. [2001] Knowledge Management and Electronic Commerce ,
“Requirements and Research Issues in Geographic Data 2nd ed., Springer-Verlag, Berlin, 2003.
Modeling,” Proc. 9th ACM International Symposium on Fernandez, E., Summers, R., and Wood, C. [1981] Database
Advances in Geographic Information Systems, 2001. Security and Integrity , Addison-Wesley, 1981.
Fugini, M., Castano, S., Martella G., and Samarati, P. Ferrier, A., and Stangret, C. [1982] “Heterogeneity in the
[1995] Database Security, ACM Press and Addison- Distributed Database Management System SIRIUS-
Wesley, 1995.
DELTA,” in VLDB [1982]. Furtado, A. [1978] “Formal Aspects of the Relational Fishman, D. et al. [1987] “IRIS: An Object-Oriented
Model,” Information Systems, 3:2, 1978. DBMS,” TOIS, 5:1, 1987, pp. 48–69.
Gadia, S. [1988] “A Homogeneous Relational Model and Flickner, M. et al. [1995] “Query by Image and Video
Query Language for Temporal Databases,” TODS, 13:4, Content: The QBIC System,” IEEE Computer, 28:9,
December 1988.
September 1995, pp. 23–32. Gait, J. [1988] “The Optical File Cabinet: A Random- Flynn, J., and Pitts, T. [2000] Inside ArcINFO 8, 2nd ed.,
Access File System for Write-Once Optical Disks,” IEEE On Word Press, 2000.
Computer , 21:6, June 1988. Folk, M. J., Zoellick, B., and Riccardi, G. [1998] File
Gallaire, H., and Minker, J., eds. [1978] Logic and Structures: An Object Oriented Approach with C++ ,
Databases , Plenum Press, 1978. 3rd ed., Addison-Wesley, 1998.
Gallaire, H., Minker, J., and Nicolas, J. [1984] “Logic and Fonseca, F., Egenhofer, M., Davis, C. and Câmara, G. [2002)]
Databases: A Deductive Approach,” ACM Computing “Semantic Granularity in Ontology-Driven Geographic
Surveys , 16:2, June 1984.
Information Systems,” in Annals of Mathematics and Gallaire, H., Minker, J., and Nicolas, J., eds. [1981] Advances Artificial Intelligence 36:1–2, pp. 121–151.
in Database Theory , Vol. 1, Plenum Press, 1981. Ford, D., and Christodoulakis, S. [1991] “Optimizing
Gamal-Eldin, M., Thomas, G., and Elmasri, R. [1988]
1112 Bibliography
in Parallel and Distributed Systems, IEEE CS, December Goodchild, M. F. [1992a] “Geographical Data Modeling,” 1988.
Computers & Geosciences 18:4, 1992, pp. 401–408. Gane, C., and Sarson, T. [1977] Structured Systems
Gordillo, S., and Balaguer, F. [1998] “Refining an Object-
Analysis: Tools and Techniques, Improved Systems
oriented GIS Design Model: Topologies and Field Technologies , 1977.
Data,” Proc. 6th ACM International Symposium on Gangopadhyay, A., and Adam, N. [1997] Database Issues
Advances in Geographic Information Systems, 1998. in Geographic Information Systems , Kluwer
Gotlieb, L. [1975] “Computing Joins of Relations,” in Academic Publishers, 1997.
SIGMOD [1975].
Garcia-Molina, H. [1982] “Elections in Distributed Graefe, G. [1993] “Query Evaluation Techniques for Large
Computing Systems,” IEEE Transactions on
Databases,” ACM Computing Surveys, 25:2, June 1993. Computers , 31:1, January 1982.
Graefe, G., and DeWitt, D. [1987] “The EXODUS Garcia-Molina, H. [1983] “Using Semantic Knowledge for
Optimizer Generator,” in SIGMOD [1987]. Transaction Processing in a Distributed Database,”
Gravano, L., and Garcia-Molina, H. [1997] “Merging TODS , 8:2, June 1983.
Ranks from Heterogeneous Sources,” in VLDB [1997]. Garcia-Molina, H., Ullman, J., and Widom, J. [2000]
Gray, J. [1978] “Notes on Data Base Operating Systems,” in Database System Implementation , Prentice-Hall,
Bayer, Graham, and Seegmuller [1978]. 2000.
Gray, J. [1981] “The Transaction Concept: Virtues and Garcia-Molina, H., Ullman, J., and Widom, J. [2009]
Limitations,” in VLDB [1981]. Database Systems: The Complete Book , 2nd ed.,
Gray, J., and Reuter, A. [1993] Transaction Processing: Prentice-Hall, 2009.
Concepts and Techniques , Morgan Kaufmann, 1993. Gedik, B., and Liu, L. [2005] “Location Privacy in Mobile
Gray, J., Helland, P., O’Neil, P., and Shasha, D. [1993] “The Systems: A Personalized Anonymization Model,” in
Dangers of Replication and a Solution,” SIGMOD ICDCS, 2005, pp. 620–629.
Gehani, N., Jagdish, H., and Shmueli, O. [1992] Gray, J., Horst, B., and Walker, M. [1990] “Parity Striping of “Composite Event Specification in Active Databases:
Disk Arrays: Low-Cost Reliable Storage with Acceptable Model and Implementation,” in VLDB [1992].
Throughput,” in VLDB [1990], pp. 148–161. Georgakopoulos, D., Rusinkiewicz, M., and Sheth, A. [1991]
Gray, J., Lorie, R., and Putzolu, G. [1975] “Granularity of “On Serializability of Multidatabase Transactions
Locks and Degrees of Consistency in a Shared Data Through Forced Local Conflicts,” in ICDE [1991].
Base,” in Nijssen [1975].
Gerritsen, R. [1975] “A Preliminary System for the Design Gray, J., McJones, P., and Blasgen, M. [1981] “The of DBTG Data Structures,” CACM, 18:10, October
Recovery Manager of the System R Database Manager,” 1975.
ACM Computing Surveys , 13:2, June 1981. Ghosh, S. [1984] “An Application of Statistical Databases
Griffiths, P., and Wade, B. [1976] “An Authorization in Manufacturing Testing,” in ICDE [1984].
Mechanism for a Relational Database System,” TODS, Ghosh, S. [1986] “Statistical Data Reduction for
1:3, September 1976.
Manufacturing Testing,” in ICDE [1986]. Grochowski, E., and Hoyt, R. F. [1996] “Future Trends in Gifford, D. [1979] “Weighted Voting for Replicated Data,”
Hard Disk Drives,” IEEE Transactions on Magnetics, SOSP, 1979.
32:3, May 1996.
Gladney, H. [1989] “Data Replicas in Distributed Grosky, W. [1994] “Multimedia Information Systems,” in Information Services,” TODS, 14:1, March 1989.
IEEE Multimedia, 1:1, Spring 1994. Gogolla, M., and Hohenstein, U. [1991] “Towards a
Grosky, W. [1997] “Managing Multimedia Information in Semantic View of an Extended Entity-Relationship
Database Systems,” in CACM, 40:12, December 1997. Model,” TODS, 16:3, September 1991.
Grosky, W., Jain, R., and Mehrotra, R., eds. [1997] The Goldberg, A., and Robson, D. [1989] Smalltalk-80: The
Handbook of Multimedia Information Management , Language , Addison-Wesley, 1989.
Prentice-Hall PTR, 1997.
Goldfine, A., and Konig, P. [1988] A Technical Overview of Gruber, T. [1995] “Toward principles for the design of the Information Resource Dictionary System (IRDS),
ontologies used for knowledge sharing,” International 2nd ed., NBS IR 88-3700, National Bureau of
Journal of Human-Computer Studies , 43:5–6, Standards.
Nov./Dec. 1995, pp. 907–928. Goodchild, M. F. [1992] “Geographical Information
Gupta, R. and Horowitz E. [1992] Object Oriented Science,” International Journal of Geographical
Databases with Applications to Case, Networks and
Bibliography 1113
Güting, R. [1994] “An Introduction to Spatial Database Hammer, M., and McLeod, D. [1981] “Database Systems,” in VLDB [1994].
Description with SDM: A Semantic Data Model,” Guttman, A. [1984] “R-Trees: A Dynamic Index Structure
TODS , 6:3, September 1981. for Spatial Searching,” in SIGMOD [1984].
Hammer, M., and Sarin, S. [1978] “Efficient Monitoring of Gwayer, M. [1996] Oracle Designer/2000 Web Server
Database Assertions,” in SIGMOD [1978]. Generator Technical Overview (version 1.3.2),
Han, J., Kamber, M., and Pei, J. [2005] Data Mining: Technical Report, Oracle Corporation, September
Concepts and Techniques , 2nd ed., Morgan 1996.
Kaufmann, 2005.
Gyssens, M.,Paredaens, J., and Van Gucht, D. [1990] “A Han, Y., Jiang, C. and Luo, X. [2004] “A Study of graph-oriented object model for database end-user
Concurrency Control in Web-Based Distributed Real- interfaces,” in SIGMOD [1990].
Time Database System Using Extended Time Petri Haas, P., and Swami, A. [1995] “Sampling-based Selectivity
Nets,” Proc. Int. Symposium on Parallel Architectures, Estimation for Joins Using Augmented Frequent Value
Algorithms, and Networks, 2004, pp. 67–72. Statistics,” in ICDE [1995].
Han, J., Pei, J., and Yin, Y. [2000] “Mining Frequent Haas, P., Naughton, J., Seshadri, S., and Stokes, L. [1995]
Patterns without Candidate Generation,” in SIGMOD “Sampling-based Estimation of the Number of
Distinct Values of an Attribute,” in VLDB [1995]. Hanson, E. [1992] “Rule Condition Testing and Action Hachem, N., and Berra, P. [1992] “New Order Preserving
Execution in Ariel,” in SIGMOD [1992]. Access Methods for Very Large Files Derived from
Hardgrave, W. [1980] “Ambiguity in Processing Boolean Linear Hashing,” TKDE, 4:1, February 1992.
Queries on TDMS Tree Structures: A Study of Four Hadzilacos, V. [1983] “An Operational Model for Database
Different Philosophies,” TSE, 6:4, July 1980. System Reliability,” in Proceedings of SIGACT-SIGMOD
Hardgrave, W. [1984] “BOLT: A Retrieval Language for Conference, March 1983.
Tree-Structured Database Systems,” in Tou [1984]. Hadzilacos, V. [1988] “A Theory of Reliability in Database
Harel, D., [1987] “Statecharts: A Visual Formulation for Systems,” JACM, 35:1, 1986.
Complex Systems,” in Science of Computer Haerder, T., and Reuter, A. [1983] “Principles of
Programming , 8:3, June 1987, pp. 231–274. Transaction Oriented Database Recovery—A
Harman, D. [1992] “Evaluation Issues in Information Taxonomy,” ACM Computing Surveys , 15:4,
Retrieval,” Information Processing and Management, September 1983, pp. 287–318.
28:4, pp. 439–440.
Haerder, T., and Rothermel, K. [1987] “Concepts for Harrington, J. [1987] Relational Database Management Transaction Recovery in Nested Transactions,” in
for Microcomputer: Design and Implementation , SIGMOD [1987].
Holt, Rinehart, and Winston, 1987. Hakonarson, H., Gulcher, J., and Stefansson, K.[2003].
Harris, L. [1978] “The ROBOT System: Natural Language “deCODE genetics, Inc.” Pharmacogenomics Journal,
Processing Applied to Data Base Query,” Proc. ACM 2003, pp. 209–215.
National Conference, December 1978. Halfond, W., and Orso. A. [2005] “AMNESIA: Analysis and
Haskin, R., and Lorie, R. [1982] “On Extending the Monitoring for Neutralizing SQL-Injection Attacks,” in
Functions of a Relational Database System,” in Proc. IEEE and ACM Int. Conf. on Automated Software
SIGMOD [1982].
Engineering (ASE 2005), November 2005, pp. 174–183. Hasse, C., and Weikum, G. [1991] “A Performance Halfond, W., Viegas, J., and Orso, A. [2006] “A
Evaluation of Multi-Level Transaction Management,” Classification of SQL Injection Attacks and
in VLDB [1991].
Countermeasures,” in Proc. Int. Symposium on Secure Hayes-Roth, F., Waterman, D., and Lenat, D., eds. [1983] Software Engineering, March 2006.
Building Expert Systems , Addison-Wesley, 1983. Hall, P. [1976] “Optimization of a Single Relational
Hayne, S., and Ram, S. [1990] “Multi-User View Expression in a Relational Data Base System,” IBM
Integration System: An Expert System for View Journal of Research and Development , 20:3, May
Integration,” in ICDE [1990]. 1976.
Heiler, S., and Zdonick, S. [1990] “Object Views: Hamilton, G., Catteli, R., and Fisher, M. [1997] JDBC
Extending the Vision,” in ICDE [1990].
Database Access with Java—A Tutorial and
Heiler, S., Hardhvalal, S., Zdonik, S., Blaustein, B., and Annotated Reference , Addison-Wesley, 1997.
Rosenthal, A. [1992] “A Flexible Framework for Hammer, M., and McLeod, D. [1975] “Semantic Integrity
Transaction Management in Engineering Environ-
1114 Bibliography
Helal, A., Hu, T., Elmasri, R., and Mukherjee, S. [1993] Hull, R., and King, R. [1987] “Semantic Database “Adaptive Transaction Scheduling,” CIKM, November
Modeling: Survey, Applications, and Research Issues,” 1993.
ACM Computing Surveys , 19:3, September 1987. Held, G., and Stonebraker, M. [1978] “B-Trees
Huxhold, W. [1991] An Introduction to Urban Reexamined,” CACM, 21:2, February 1978.
Geographic Information Systems , Oxford University Henriksen, C., Lauzon, J. P., and Morehouse, S. [1994]
Press, 1991.
“Open Geodata Access Through Standards,” IBM [1978] QBE Terminal Users Guide, Form Number StandardView Archive, 1994, 2:3, pp. 169–174.
SH20-2078-0.
Henschen, L., and Naqvi, S. [1984] “On Compiling IBM [1992] Systems Application Architecture Common Queries in Recursive First-Order Databases,” JACM,
Programming Interface Database Level 2 Reference , 31:1, January 1984.
Document Number SC26-4798-01. Hernandez, H., and Chan, E. [1991] “Constraint-Time-
ICDE [1984] Proc. IEEE CS International Conference on Maintainable BCNF Database Schemes,” TODS, 16:4,
Data Engineering, Shuey, R., ed., Los Angeles, CA, April December 1991.
Herot, C. [1980] “Spatial Management of Data,” TODS, ICDE [1986] Proc. IEEE CS International Conference on 5:4, December 1980.
Data Engineering, Wiederhold, G., ed., Los Angeles, Hevner, A., and Yao, S. [1979] “Query Processing in
February 1986.
Distributed Database Systems,” TSE, 5:3, May 1979. ICDE [1987] Proc. IEEE CS International Conference on Hinneburg, A., and Gabriel, H.-H., [2007] “DENCLUE
Data Engineering, Wah, B., ed., Los Angeles, February 2.0: Fast Clustering Based on Kernel Density
Estimation,” in Proc. IDA’2007: Advances in Intelligent ICDE [1988] Proc. IEEE CS International Conference on Data Analysis VII, 7th International Symposium on
Data Engineering, Carlis, J., ed., Los Angeles, February Intelligent Data Analysis, Ljubljana, Slovenia,
September 2007, LNCS 4723, Springer, 2007. ICDE [1989] Proc. IEEE CS International Conference on Data Hoffer, J. [1982] “An Empirical Investigation with
Engineering, Shuey, R., ed., Los Angeles, February 1989. Individual Differences in Database Models,” Proc.
ICDE [1990] Proc. IEEE CS International Conference on Data Third International Information Systems Conference,
Engineering, Liu, M., ed., Los Angeles, February 1990. December 1982.
ICDE [1991] Proc. IEEE CS International Conference on Hoffer, J., Prescott, M., and Topi, H. [2009] Modern
Data Engineering, Cercone, N., and Tsuchiya, M., eds., Database Management , 9th ed., Prentice-Hall, 2009.
Kobe, Japan, April 1991.
Holland, J. [1975] Adaptation in Natural and Artificial ICDE [1992] Proc. IEEE CS International Conference on Systems , University of Michigan Press, 1975.
Data Engineering, Golshani, F., ed., Phoenix, AZ, Holsapple, C., and Whinston, A., eds. [1987] Decision
February 1992.
Support Systems Theory and Application , Springer- ICDE [1993] Proc. IEEE CS International Conference on Verlag, 1987.
Data Engineering, Elmagarmid, A., and Neuhold, E., Holt, R. C. [1972] “Some Deadlock Properties of
eds., Vienna, Austria, April 1993. Computer Systems,” ACM Computing Surveys, 4:3,
ICDE [1994] Proc. IEEE CS International Conference on pp. 179–196.
Data Engineering, Houston, TX, February 1994. Holtzman J. M., and Goodman D. J., eds. [1993] Wireless
ICDE [1995] Proc. IEEE CS International Conference on Communications: Future Directions , Kluwer, 1993.
Data Engineering, Yu, P. S., and Chen, A. L. A., eds., Horowitz, B. [1992] “A Run-Time Execution Model for
Taipei, Taiwan, 1995.
Referential Integrity Maintenance”, in ICDE [1992], pp. ICDE [1996] Proc. IEEE CS International Conference on 548–556.
Data Engineering, Su, S. Y. W., ed., New Orleans, 1996. Howson, C. and P. Urbach, P. [1993] Scientific
ICDE [1997] Proc. IEEE CS International Conference on Reasoning: The Bayesian Approach , Open Court
Data Engineering, Gray, W. A., and Larson, P. A., eds., Publishing, December 1993.
Birmingham, England, 1997. Hsiao, D., and Kamel, M. [1989] “Heterogeneous
ICDE [1998] Proc. IEEE CS International Conference on Databases: Proliferation, Issues, and Solutions,” TKDE,
Data Engineering, Orlando, FL, February 1998. 1:1, March 1989.
ICDE [1999] Proc. IEEE CS International Conference on Hsu, A., and Imielinsky, T. [1985] “Integrity Checking for
Data Engineering, Sydney, Australia, March 1999. Multiple Updates,” in SIGMOD [1985].
ICDE [2000] Proc. IEEE CS International Conference on
Bibliography 1115
ICDE [2001] Proc. IEEE CS International Conference on Ioannidis, Y., and Kang, Y. [1990] “Randomized Data Engineering, Heidelberg, Germany, April 2001.
Algorithms for Optimizing Large Join Queries,” in ICDE [2002] Proc. IEEE CS International Conference on
SIGMOD [1990].
Data Engineering, San Jose, CA, February-March 2002. Ioannidis, Y., and Kang, Y. [1991] “Left-Deep vs. Bushy Trees: ICDE [2003] Proc. IEEE CS International Conference on
An Analysis of Strategy Spaces and Its Implications for Data Engineering, Dayal, U., Ramamritham, K., and
Query Optimization,” in SIGMOD [1991]. Vijayaraman, T. M., eds., Bangalore, India, March 2003.
Ioannidis, Y., and Wong, E. [1988] “Transforming Non- ICDE [2004] Proc. IEEE CS International Conference on
Linear Recursion to Linear Recursion,” in EDS [1988]. Data Engineering, Boston, MA, March-April 2004.
Iossophidis, J. [1979] “A Translator to Convert the DDL of ICDE [2005] Proc. IEEE CS International Conference on
ERM to the DDL of System 2000,” in ER Conference Data Engineering, Tokyo, Japan, April 2005.
ICDE [2006] Proc. IEEE CS International Conference on Irani, K., Purkayastha, S., and Teorey, T. [1979] “A Data Engineering, Liu, L., Reuter, A., Whang, K.-Y., and
Designer for DBMS-Processable Logical Database Zhang, J., eds., Atlanta, GA, April 2006.
Structures,” in VLDB [1979]. ICDE [2007] Proc. IEEE CS International Conference on
Iyer et al. [ 2004] “A Framework for Efficient Storage Data Engineering, Istanbul, Turkey, April 2007.
Security in RDBMSs,” in EDBT, 2004, pp. 147–164. ICDE [2008] Proc. IEEE CS International Conference on
Jacobson, I., Booch, G., and Rumbaugh, J. [1999] The Data Engineering, Cancun, Mexico, April 2008.
Unified Software Development Process , Addison- ICDE [2009] Proc. IEEE CS International Conference on
Wesley, 1999.
Data Engineering, Shanghai, China, March-April 2009. Jacobson, I., Christerson, M., Jonsson, P., and Overgaard, ICDE [2010] Proc. IEEE CS International Conference on
G. [1992] Object-Oriented Software Engineering: A Data Engineering, Long Beach, CA, March 2010, forth-
Use Case Driven Approach , Addison-Wesley, 1992. coming.
Jagadish, H. [1989] “Incorporating Hierarchy in a IGES [1983] International Graphics Exchange
Relational Model of Data,” in SIGMOD [1989]. Specification Version 2, National Bureau of Standards,
Jagadish, H. [1997] “Content-based Indexing and U.S. Department of Commerce, January 1983.
Retrieval,” in Grosky et al. [1997]. Imielinski, T., and Badrinath, B. [1994] “Mobile Wireless
Jajodia, S., Ammann, P., McCollum, C. D., “Surviving Computing: Challenges in Data Management,” CACM,
Information Warfare Attacks,” IEEE Computer, 32:4, 37:10, October 1994.
April 1999, pp. 57–63.
Imielinski, T., and Lipski, W. [1981] “On Representing Jajodia, S., and Kogan, B. [1990] “Integrating an Object- Incomplete Information in a Relational Database,” in
oriented Data Model with Multilevel Security,” Proc. VLDB [1981].
IEEE Symposium on Security and Privacy, May 1990, Indulska, M., and Orlowska, M. E. [2002] “On Aggregation
pp. 76–85.
Issues in Spatial Data Management,” (ACM Jajodia, S., and Mutchler, D. [1990] “Dynamic Voting International Conference Proceeding Series) Proc.
Algorithms for Maintaining the Consistency of a Thirteenth Australasian Conference on Database
Replicated Database,” TODS, 15:2, June 1990. Technologies, Melbourne, 2002, pp. 75–84.
Jajodia, S., and Sandhu, R. [1991] “Toward a Multilevel Informix [1998] “Web Integration Option for Informix
Secure Relational Data Model,” in SIGMOD [1991]. Dynamic Server,” available at www.informix.com.
Jajodia, S., Ng, P., and Springsteel, F. [1983] “The Problem Inmon, W. H. [1992] Building the Data Warehouse,
of Equivalence for Entity-Relationship Diagrams,” Wiley, 1992.
TSE , 9:5, September 1983.
Inmon, W., Strauss, D., and Neushloss, G. [2008] DW 2.0: Jardine, D., ed. [1977] The ANSI/SPARC DBMS Model,
The Architecture for the Next Generation of Data
North-Holland, 1977.
Warehousing , Morgan Kaufmann, 2008. Jarke, M., and Koch, J. [1984] “Query Optimization in Integrigy [2004] “An Introduction to SQL Injection
Database Systems,” ACM Computing Surveys, 16:2, Attacks for Oracle Developers,” Integrigy, April 2004,
June 1984.
available at www.net-security.org/dl/articles/Integrigy Jensen, C. et al. [1994] “A Glossary of Temporal Database IntrotoSQLInjectionAttacks.pdf.
Concepts,” ACM SIGMOD Record, 23:1, March 1994. Internet Engineering Task Force (IETF) [1999] “An
Jensen, C., and Snodgrass, R. [1992] “Temporal Architecture Framework for High Speed Mobile
Specialization,” in ICDE [1992]. Ad Hoc Network,” in Proc. 45th IETF Meeting, Oslo,
Jensen, C. et al. [2001] “Location-based Services: A
1116 Bibliography
Jhingran, A., and Khedkar, P. [1992] “Analysis of Recovery Kemper, A., and Wallrath, M. [1987] “An Analysis of in a Database System Using a Write-ahead Log
Geometric Modeling in Database Systems,” ACM Protocol,” in SIGMOD [1992].
Computing Surveys , 19:1, March 1987. Jing, J., Helal, A., and Elmagarmid, A. [1999] “Client-
Kemper, A., Lockemann, P., and Wallrath, M. [1987] “An server Computing in Mobile Environments,” ACM
Object-Oriented Database System for Engineering Computing Surveys , 31:2, June 1999.
Applications,” in SIGMOD [1987]. Johnson, T., and Shasha, D. [1993] “The Performance of
Kemper, A., Moerkotte, G., and Steinbrunn, M. [1992] Current B-Tree Algorithms,” TODS, 18:1, March 1993.
“Optimizing Boolean Expressions in Object Bases,” in Joshi, J., Aref, W., Ghafoor, A., and Spafford, E. [2001]
VLDB [1992].
“Security Models for Web-Based Applications,” CACM, Kent, W. [1978] Data and Reality, North-Holland, 1978. 44:2, February 2001, pp. 38–44.
Kent, W. [1979] “Limitations of Record-Based Jung, I.Y, . and Yeom, H.Y. [2008] “An efficient and trans-
Information Models,” TODS, 4:1, March 1979. parent transaction management based on the data
Kent, W. [1991] “Object-Oriented Database Programming workflow of HVEM DataGrid,” Proc. Challenges of
Languages,” in VLDB [1991]. Large Applications in Distributed Environments, 2008,
Kerschberg, L., Ting, P., and Yao, S. [1982] “Query pp. 35–44.
Optimization in Star Computer Networks,” TODS, 7:4, Kaefer, W., and Schoening, H. [1992] “Realizing a
December 1982.
Temporal Complex-Object Data Model,” in SIGMOD Ketabchi, M. A., Mathur, S., Risch, T., and Chen, J. [1990] [1992].
“Comparative Analysis of RDBMS and OODBMS: A Kamel, I., and Faloutsos, C. [1993] “On Packing R-trees,”
Case Study,” IEEE International Conference on CIKM, November 1993.
Manufacturing, 1990.
Kamel, N., and King, R. [1985] “A Model of Data Khan, L. [2000] “Ontology-based Information Selection,” Distribution Based on Texture Analysis,” in SIGMOD
Ph.D. dissertation, University of Southern California, [1985].
August 2000.
Kappel, G., and Schrefl, M. [1991] “Object/Behavior Khoshafian, S., and Baker A. [1996] Multimedia and Diagrams,” in ICDE [1991].
Imaging Databases , Morgan Kaufmann, 1996. Karlapalem, K., Navathe, S. B., and Ammar, M. [1996]
Khoshafian, S., Chan, A., Wong, A., and Wong, H.K.T. “Optimal Redesign Policies to Support Dynamic
[1992] Developing Client Server Applications, Processing of Applications on a Distributed Relational
Morgan Kaufmann, 1992.
Database System,” Information Systems, 21:4, 1996, Khoury, M. [2002] “Epidemiology and the Continuum pp. 353–367.
from Genetic Research to Genetic Testing,” in American Karolchik, D. et al. [2003] “The UCSC Genome Browser
Journal of Epidemiology , 2002, pp. 297–299. Database”, in Nucleic Acids Research, 31:1, January 2003.
Kifer, M., and Lozinskii, E. [1986] “A Framework for an Katz, R. [1985] Information Management for
Efficient Implementation of Deductive Databases,” Engineering Design: Surveys in Computer Science ,
Proc. Sixth Advanced Database Symposium, Tokyo, Springer-Verlag, 1985.
August 1986.
Katz, R., and Wong, E. [1982] “Decompiling CODASYL Kim W. [1995] Modern Database Systems: The Object DML into Relational Queries,” TODS, 7:1, March 1982.
Model, Interoperability, and Beyond , ACM Press, KDD [1996] Proc. Second International Conference on
Addison-Wesley, 1995.
Knowledge Discovery in Databases and Data Mining, Kim, P. [1996] “A Taxonomy on the Architecture of Portland, Oregon, August 1996.
Database Gateways for the Web,” Working Paper TR- Ke, Y., and Sukthankar, R. [2004] “PCA-SIFT: A More
96-U-10, Chungnam National University, Taejon, Distinctive Representation for Local Image
Korea (available from http://grigg.chungnam.ac.kr/ Descriptors,” in Proc. IEEE Conf. on Computer Vision
projects/UniWeb).
and Pattern Recognition, 2004. Kim, S.-H., Yoon, K.-J., and Kweon, I.-S. [2006] “Object Kedem, Z., and Silberschatz, A. [1980] “Non-Two Phase
Recognition Using a Generalized Robust Invariant Locking Protocols with Shared and Exclusive Locks,” in
Feature and Gestalt’s Law of Proximity and Similarity,” VLDB [1980].
in Proc. Conf. on Computer Vision and Pattern Keller, A. [1982] “Updates to Relational Database Through
Recognition Workshop (CVPRW ’06), 2006. Views Involving Joins,” in Scheuermann [1982].
Kim, W. [1982] “On Optimizing an SQL-like Nested Kemp, K. [1993]. “Spatial Databases: Sources and Issues,”
Query,” TODS, 3:3, September 1982.
Bibliography 1117
Kim, W. [1990] “Object-Oriented Databases: Definition Kooi, R. P., [1980] The Optimization of Queries in and Research Directions,” TKDE, 2:3, September 1990.
Relational Databases , Ph.D. Dissertation, Case Kim, W. et al. [1987] “Features of the ORION Object-
Western Reserve University, 1980: pp. 1–159. Oriented Database System,” Microelectronics and
Koperski, K., and Han, J. [1995] “Discovery of Spatial Computer Technology Corporation, Technical Report
Association Rules in Geographic Information ACA-ST-308-87, September 1987.
Databases,” in Proc. SSD’1995, 4 th Int. Symposium on Kim, W., and Lochovsky, F., eds. [1989] Object-oriented
Advances in Spatial Databases, Portland, Maine, LNCS Concepts, Databases, and Applications , ACM Press,
951, Springer, 1995.
Frontier Series, 1989. Korfhage, R. [1991] “To See, or Not to See: Is that the Kim, W., Garza, J., Ballou, N., and Woelk, D. [1990]
Query?” in Proc. ACM SIGIR International Conference, “Architecture of the ORION Next-Generation
June 1991.
Database System,” TKDE, 2:1, 1990, pp. 109–124. Korth, H. [1983] “Locking Primitives in a Database Kim, W., Reiner, D. S., and Batory, D., eds. [1985] Query
System,” JACM, 30:1, January 1983. Processing in Database Systems , Springer-Verlag, 1985.
Korth, H., Levy, E., and Silberschatz, A. [1990] “A Formal Kimball, R. [1996] The Data Warehouse Toolkit, Wiley,
Approach to Recovery by Compensating Transactions,” Inc. 1996.
in VLDB [1990].
King, J. [1981] “QUIST: A System for Semantic Query Kosala, R., and Blockeel, H. [2000] “Web Mining Research: Optimization in Relational Databases,” in VLDB
a Survey,” SIGKDD Explorations. 2:1, June 2000, pp. [1981].
Kitsuregawa, M., Nakayama, M., and Takagi, M. [1989] Kotz, A., Dittrich, K., Mulle, J. [1988] “Supporting “The Effect of Bucket Size Tuning in the Dynamic
Semantic Rules by a Generalized Event/Trigger Hybrid GRACE Hash Join Method,” in VLDB [1989].
Mechanism,” in VLDB [1988]. Kleinberg, J. M. [1999] “Authoritative sources in a hyper-
Krishnamurthy, R., and Naqvi, S. [1989] “Non- linked environment,” JACM 46:5, September 1999, pp.
Deterministic Choice in Datalog,” Proceeedings of the 604–632
3rd International Conference on Data and Knowledge Klimbie, J., and Koffeman, K., eds. [1974] Data Base
Bases, Jerusalem, June 1989. Management , North-Holland, 1974.
Krishnamurthy, R., Litwin, W., and Kent, W. [1991] Klug, A. [1982] “Equivalence of Relational Algebra and
“Language Features for Interoperability of Databases Relational Calculus Query Languages Having
with Semantic Discrepancies,” in SIGMOD [1991]. Aggregate Functions,” JACM, 29:3, July 1982.
Krovetz, R., and Croft B. [1992] “Lexical Ambiguity and Knuth, D. [1998] The Art of Computer Programming,
Information Retrieval” in TOIS, 10, April 1992. Vol. 3: Sorting and Searching , 2nd ed., Addison-
Kuhn, R. M., Karolchik, D., Zweig, et al. [2009] “The UCSC Wesley, 1998.
Genome Browser Database: update 2009,” Nucleic Kogelnik, A. [1998] “Biological Information Management
Acids Research , 37:1, January 2009. with Application to Human Genome Data,” Ph.D. dis-
Kulkarni K. et al., “Introducing Reference Types and sertation, Georgia Institute of Technology and Emory
Cleaning Up SQL3’s Object Model,” ISO WG3 Report University, 1998.
X3H2-95-456, November 1995. Kogelnik, A. et al. [1998] “MITOMAP: A human mito-
Kumar, A. [1991] “Performance Measurement of chondrial genome database—1998 update,” Nucleic
Some Main Memory Recovery Algorithms,” in ICDE Acids Research , 26:1, January 1998.
Kogelnik, A., Navathe, S., Wallace, D. [1997] “GENOME: A Kumar, A., and Segev, A. [1993] “Cost and Availability system for managing Human Genome Project Data.”
Tradeoffs in Replicated Concurrency Control,” TODS, Proceedings of Genome Informatics ’97, Eighth Workshop
18:1, March 1993.
on Genome Informatics, Tokyo, Japan, Sponsor: Human Kumar, A., and Stonebraker, M. [1987] “Semantics Based Genome Center, University of Tokyo, December 1997.
Transaction Management Techniques for Replicated Kohler, W. [1981] “A Survey of Techniques for
Data,” in SIGMOD [1987].
Synchronization and Recovery in Decentralized Kumar, D. [2007a]. “Genomic medicine: a new frontier of Computer Systems,” ACM Computing Surveys, 13:2,
medicine in the twenty first century”, Genomic June 1981.
Medicine , 2007, pp. 3–7.
Konsynski, B., Bracker, L., and Bracker, W. [1982] “A Kumar, D. [2007b]. “Genome mirror—2006”, Genomic Model for Specification of Office Communications,”
Medicine , 2007, pp. 87–90.
1118 Bibliography
Kumar, V., and Hsu, M. [1998] Recovery Mechanisms in Leiss, E. [1982] “Randomizing: A Practical Method for Database Systems , Prentice-Hall (PTR), 1998.
Protecting Statistical Databases Against Compromise,” Kumar, V., and Song, H. S. [1998] Database Recovery,
in VLDB [1982].
Kluwer Academic, 1998. Leiss, E. [1982a] Principles of Data Security, Plenum Kung, H., and Robinson, J. [1981] “Optimistic
Press, 1982.
Concurrency Control,” TODS, 6:2, June 1981. Lenat, D. [1995] “CYC: A Large-Scale Investment in Lacroix, M., and Pirotte, A. [1977a] “Domain-Oriented
Knowledge Infrastructure,” CACM 38:11, November Relational Languages,” in VLDB [1977].
1995, pp. 32–38.
Lacroix, M., and Pirotte, A. [1977b] “ILL: An English Lenzerini, M., and Santucci, C. [1983] “Cardinality Structured Query Language for Relational Data Bases,”
Constraints in the Entity Relationship Model,” in ER in Nijssen [1977].
Conference [1983].
Lai, M.-Y., and Wilkinson, W. K. [1984] “Distributed Leung, C., Hibler, B., and Mwara, N. [1992] “Picture Transaction Management in Jasmin,” in VLDB [1984].
Retrieval by Content Description,” in Journal of Lamb, C. et al. [1991] “The ObjectStore Database System,”
Information Science , 1992, pp. 111–119. in CACM, 34:10, October 1991, pp. 50–63.
Levesque, H. [1984] “The Logic of Incomplete Knowledge Lamport, L. [1978] “Time, Clocks, and the Ordering of
Bases,” in Brodie et al., Ch. 7 [1984]. Events in a Distributed System,” CACM, 21:7, July
Li, W.-S., Seluk Candan, K., Hirata, K., and Hara, Y. [1998] 1978.
Hierarchical Image Modeling for Object-based Media Lander, E. [2001] “Initial Sequencing and Analysis of the
Retrieval in DKE, 27:2, September 1998, pp. 139–176. Genome,” Nature, 409:6822, 2001.
Lien, E., and Weinberger, P. [1978] “Consistency, Langerak, R. [1990] “View Updates in Relational
Concurrency, and Crash Recovery,” in SIGMOD Databases with an Independent Scheme,” TODS, 15:1,
March 1990. Lieuwen, L., and DeWitt, D. [1992] “A Transformation- Lanka, S., and Mays, E. [1991] “Fully Persistent B1-Trees,”
Based Approach to Optimizing Loops in Database in SIGMOD [1991].
Programming Languages,” in SIGMOD [1992]. Larson, J. [1983] “Bridging the Gap Between Network and
Lilien, L., and Bhargava, B. [1985] “Database Integrity Relational Database Management Systems,” IEEE
Block Construct: Concepts and Design Issues,” TSE, Computer , 16:9, September 1983.
11:9, September 1985.
Larson, J., Navathe, S., and Elmasri, R. [1989] “Attribute Lin, J., and Dunham, M. H. [1998] “Mining Association Equivalence and its Use in Schema Integration,” TSE,
Rules,” in ICDE [1998].
15:2, April 1989. Lindsay, B. et al. [1984] “Computation and Larson, P. [1978] “Dynamic Hashing,” BIT, 18, 1978.
Communication in R*: A Distributed Database Larson, P. [1981] “Analysis of Index-Sequential Files with
Manager,” TOCS, 2:1, January 1984. Overflow Chaining,” TODS, 6:4, December 1981.
Lippman R. [1987] “An Introduction to Computing with Lassila, O. [1998] “Web Metadata: A Matter of Semantics,”
Neural Nets,” IEEE ASSP Magazine, April 1987. IEEE Internet Computing , 2:4, July/August 1998, pp.
Lipski, W. [1979] “On Semantic Issues Connected with 30–37.
Incomplete Information,” TODS, 4:3, September 1979. Laurini, R., and Thompson, D. [1992] Fundamentals of
Lipton, R., Naughton, J., and Schneider, D. [1990] Spatial Information Systems , Academic Press, 1992.
“Practical Selectivity Estimation through Adaptive Lausen G., and Vossen, G. [1997] Models and Languages
Sampling,” in SIGMOD [1990]. of Object Oriented Databases , Addison-Wesley, 1997.
Liskov, B., and Zilles, S. [1975] “Specification Techniques Lazebnik, S., Schmid, C., and Ponce, J. [2004] “Semi-Local
for Data Abstractions,” TSE, 1:1, March 1975. Affine Parts for Object Recognition,” in Proc. British
Litwin, W. [1980] “Linear Hashing: A New Tool for File Machine Vision Conference, Kingston University, The
and Table Addressing,” in VLDB [1980]. Institution of Engineering and Technology, U.K., 2004.
Liu, B. [2006] Web Data Mining: Exploring Hyperlinks, Lee, J., Elmasri, R., and Won, J. [1998] “An Integrated
Contents, and Usage Data (Data-Centric Systems and
Temporal Data Model Incorporating Time Series Applications), Springer, 2006. Concepts,” DKE, 24, 1998, pp. 257–276.
Liu, B. and Chen-Chuan-Chang, K. [2004] “Editorial: Lehman, P., and Yao, S. [1981] “Efficient Locking for
Special Issue on Web Content Mining,” SIGKDD Concurrent Operations on B-Trees,” TODS, 6:4,
Explorations Newsletter 6:2 , December 2004, pp. 1–4. December 1981.
Liu, K., and Sunderraman, R. [1988] “On Representing
Bibliography 1119
Liu, L., and Meersman, R. [1992] “Activity Model: A Mahajan, S., Donahoo. M. J., Navathe, S. B., Ammar, M., Declarative Approach for Capturing Communication
Malik, S. [1998] “Grouping Techniques for Update Behavior in Object-Oriented Databases,” in VLDB
Propagation in Intermittently Connected Databases,” [1992].
in ICDE [1998].
Lockemann, P., and Knutsen, W. [1968] “Recovery of Disk Maier, D. [1983] The Theory of Relational Databases, Contents After System Failure,” CACM, 11:8, August
Computer Science Press, 1983. 1968.
Maier, D., and Warren, D. S. [1988] Computing with Longley, P. et al [2001] Geographic Information Systems
Logic , Benjamin Cummings, 1988. and Science , John Wiley, 2001.
Maier, D., Stein, J., Otis, A., and Purdy, A. [1986] Lorie, R. [1977] “Physical Integrity in a Large Segmented
“Development of an Object-Oriented DBMS,” Database,” TODS, 2:1, March 1977.
OOPSLA, 1986.
Lorie, R., and Plouffe, W. [1983] “Complex Objects Malley, C., and Zdonick, S. [1986] “A Knowledge-Based and Their Use in Design Transactions,” in SIGMOD
Approach to Query Optimization,” in EDS [1986]. [1983].
Mannila, H., Toivonen, H., and Verkamo, A. [1994] Lowe, D. [2004] “Distinctive Image Features from Scale-
“Efficient Algorithms for Discovering Association Invariant Keypoints”, Int. Journal of Computer
Rules,” in KDD-94, AAAI Workshop on Knowledge Vision , Vol. 60, 2004, pp. 91–110.
Discovery in Databases, Seattle, 1994. Lozinskii, E. [1986] “A Problem-Oriented Inferential
Manning, C., and Schütze, H. [1999] Foundations of Database System,” TODS, 11:3, September 1986.
Statistical Natural Language Processing , MIT Press, Lu, H., Mikkilineni, K., and Richardson, J. [1987] “Design
and Evaluation of Algorithms to Compute the Transitive Manning, C., Raghavan, P., and and Schutze, H. [2008] Closure of a Database Relation,” in ICDE [1987].
Introduction to Information Retrieval , Cambridge Lubars, M., Potts, C., and Richter, C. [1993] “A Review of
University Press, 2008.
the State of Practice in Requirements Modeling,” Proc. Manola. F. [1998] “Towards a Richer Web Object Model,” IEEE International Symposium on Requirements
in ACM SIGMOD Record, 27:1, March 1998. Engineering, San Diego, CA, 1993.
Manolopoulos, Y., Nanopoulos, A., Papadopoulos, A., and Lucyk, B. [1993] Advanced Topics in DB2, Addison-
Theodoridis, Y. [2005] R-Trees: Theory and Wesley, 1993.
Applications , Springer, 2005. Luhn, H. P. [1957] “A Statistical Approach to Mechanized
March, S., and Severance, D. [1977] “The Determination Encoding and Searching of Literary Information,” IBM
of Efficient Record Segmentations and Blocking Journal of Research and Development, 1:4, October
Factors for Shared Files,” TODS, 2:3, September 1977. 1957, pp. 309–317.
Mark, L., Roussopoulos, N., Newsome, T., and Lunt, T., and Fernandez, E. [1990] “Database Security,” in
Laohapipattana, P. [1992] “Incrementally Maintained SIGMOD Record, 19:4, pp. 90–97.
Network to Relational Mappings,” Software Practice & Lunt, T. et al. [1990] “The Seaview Security Model,” IEEE
Experience , 22:12, December 1992. TSE , 16:6, pp. 593–607.
Markowitz, V., and Raz, Y. [1983] “ERROL: An Entity- Luo, J., and Nascimento, M. [2003] “Content-based Sub-
Relationship, Role Oriented, Query Language,” in ER image Retrieval via Hierarchical Tree Matching,” in
Conference [1983].
Proc. ACM Int Workshop on Multimedia Databases, Martin, J., and Odell, J. [2008] Principles of Object- New Orleans, pp. 63–69.
oriented Analysis and Design, Prentice-Hall, 2008. Madria, S. et al. [1999] “Research Issues in Web Data
Martin, J., Chapman, K., and Leben, J. [1989] DB2- Mining,” in Proc. First Int. Conf. on Data Warehousing
Concepts, Design, and Programming , Prentice-Hall, and Knowledge Discovery (Mohania, M., and Tjoa, A.,
eds.) LNCS 1676. Springer, pp. 303–312. Maryanski, F. [1980] “Backend Database Machines,” ACM Madria, S., Baseer, Mohammed, B., Kumar,V., and
Computing Surveys , 12:1, March 1980. Bhowmick, S. [2007] “A transaction model and multi-
Masunaga, Y. [1987] “Multimedia Databases: A Formal version concurrency control for mobile database sys-
Framework,” Proc. IEEE Office Automation Symposium, tems,” Distributed and Parallel Databases (DPD),
April 1987.
22:2–3, 2007, pp. 165–196.
Mattison, R.,
Data Warehousing: Strategies,
Maguire, D., Goodchild, M., and Rhind, D., eds. [1997] Technologies, and Techniques , McGraw-Hill, 1996.
Geographical Information Systems: Principles and
Maune, D. F. [2001] Digital Elevation Model
1120 Bibliography
McCarty, C. et al. [2005]. “Marshfield Clinic Personalized Miller, H. J., (2004) “Tobler’s First Law and Spatial Medicine Research Project (PMRP): design, methods
Analysis,” Annals of the Association of American and recruitment for a large population-based
Geographers, 94:2, 2004, pp. 284–289. biobank,” Personalized Medicine, 2005, pp. 49–70.
Milojicic, D. et al. [2002] Peer-to-Peer Computing, HP McClure, R., and Krüger, I. [2005] “SQL DOM: Compile
Laboratories Technical Report No. HPL-2002-57, Time Checking of Dynamic SQL Statements,” Proc.
HP Labs, Palo Alto, available at www.hpl.hp.com/ 27th Int. Conf. on Software Engineering, May 2005.
techreports/2002/HPL-2002-57R1.html. McLeish, M. [1989] “Further Results on the Security of
Minoura, T., and Wiederhold, G. [1981] “Resilient Partitioned Dynamic Statistical Databases,” TODS,
Extended True-Copy Token Scheme for a Distributed 14:1, March 1989.
Database,” TSE, 8:3, May 1981. McLeod, D., and Heimbigner, D. [1985] “A Federated
Missikoff, M., and Wiederhold, G. [1984] “Toward a Architecture for Information Systems,” TOOIS, 3:3,
Unified Approach for Expert and Database Systems,” in July 1985.
EDS [1984].
Mehrotra, S. et al. [1992] “The Concurrency Control Mitchell, T. [1997] Machine Learning, McGraw-Hill, 1997. Problem in Multidatabases: Characteristics and
Mitschang, B. [1989] “Extending the Relational Algebra to Solutions,” in SIGMOD [1992].
Capture Complex Objects,” in VLDB [1989]. Melton, J. [2003] Advanced SQL: 1999—Understanding
Mohan, C. [1993] “IBM’s Relational Database Products: Object-Relational and Other Advanced Features ,
Features and Technologies,” in SIGMOD [1993]. Morgan Kaufmann, 2003.
Mohan, C. et al. [1992] “ARIES: A Transaction Recovery Melton, J., and Mattos, N. [1996] “An Overview of SQL3—
Method Supporting Fine-Granularity Locking and The Emerging New Generation of the SQL Standard,
Partial Rollbacks Using Write-Ahead Logging,” TODS, Tutorial No. T5,” VLDB, Bombay, September 1996.
17:1, March 1992.
Melton, J., and Simon, A. R. [1993] Understanding the New Mohan, C., and Levine, F. [1992] “ARIES/IM: An Efficient SQL: A Complete Guide , Morgan Kaufmann, 1993.
and High-Concurrency Index Management Method Melton, J., and Simon, A. R. [2002] SQL: 1999—
Using Write-Ahead Logging,” in SIGMOD [1992]. Understanding Relational Language Components ,
Mohan, C., and Narang, I. [1992] “Algorithms for Creating Morgan Kaufmann, 2002.
Indexes for Very Large Tables without Quiescing Melton, J., Bauer, J., and Kulkarni, K. [1991] “Object ADTs
Updates,” in SIGMOD [1992]. (with improvements for value ADTs),” ISO WG3
Mohan, C., Haderle, D., Lindsay, B., Pirahesh, H., and Report X3H2-91-083, April 1991.
Schwarz, P. [1992] “ARIES: A Transaction Recovery Menasce, D., Popek, G., and Muntz, R. [1980] “A Locking
Method Supporting Fine-Granularity Locking and Protocol for Resource Coordination in Distributed
Partial Rollbacks Using Write-Ahead Logging,” TODS, Databases,” TODS, 5:2, June 1980.
17:1, March 1992.
Mendelzon, A., and Maier, D. [1979] “Generalized Mutual Morris, K. et al. [1987] “YAWN! (Yet Another Window on Dependencies and the Decomposition of Database
NAIL!), in ICDE [1987].
Relations,” in VLDB [1979]. Morris, K., Ullman, J., and VanGelden, A. [1986] “Design Mendelzon, A., Mihaila, G., and Milo, T. [1997] “Querying
Overview of the NAIL! System,” Proc. Third Inter- the World Wide Web,” Journal of Digital Libraries,
national Conference on Logic Programming, Springer- 1:1, April 1997.
Verlag, 1986.
Metais, E., Kedad, Z., Comyn-Wattiau, C., and Morris, R. [1968] “Scatter Storage Techniques,” CACM, Bouzeghoub, M., “Using Linguistic Knowledge in View
11:1, January 1968.
Integration: Toward a Third Generation of Tools,” Morsi, M., Navathe, S., and Kim, H. [1992] “An Extensible DKE , 23:1, June 1998.
Object-Oriented Database Testbed,” in ICDE [1992]. Mikkilineni, K., and Su, S. [1988] “An Evaluation of
Moss, J. [1982] “Nested Transactions and Reliable Relational Join Algorithms in a Pipelined Query
Distributed Computing,” Proc. Symposium on Processing Environment,” TSE, 14:6, June 1988.
Reliability in Distributed Software and Database Mikolajczyk, K., and Schmid, C. [2005] “A performance
Systems, IEEE CS, July 1982. evaluation of local descriptors”, IEEE Transactions on
Motro, A. [1987] “Superviews: Virtual Integration of PAMI , 10:27, 2005, pp. 1615–1630.
Multiple Databases,” TSE, 13:7, July 1987. Miller, G. A. [1990] “Nouns in WordNet: a lexical inheri-
Mouratidis, K. et al. [2006] “Continuous nearest neighbor tance system.” in International Journal of
monitoring in road networks,” in VLDB [2006], pp.
Bibliography 1121
Mukkamala, R. [1989] “Measuring the Effect of Data Navathe, S., and Schkolnick, M. [1978] “View Distribution and Replication Models on Performance
Representation in Logical Database Design,” in Evaluation of Distributed Systems,” in ICDE [1989].
SIGMOD [1978].
Mumick, I., Finkelstein, S., Pirahesh, H., and Ramakrishnan, Navathe, S., Ceri, S., Wiederhold, G., and Dou, J. [1984] R. [1990a] “Magic Is Relevant,” in SIGMOD [1990].
“Vertical Partitioning Algorithms for Database Mumick, I., Pirahesh, H., and Ramakrishnan, R. [1990b]
Design,” TODS, 9:4, December 1984. “The Magic of Duplicates and Aggregates,” in VLDB
Navathe, S., Elmasri, R., and Larson, J. [1986] “Integrating [1990].
User Views in Database Design,” IEEE Computer, 19:1, Muralikrishna, M. [1992] “Improved Unnesting
January 1986.
Algorithms for Join and Aggregate SQL Queries,” in Navathe, S., Patil, U., and Guan, W. [2007] “Genomic and VLDB [1992].
Proteomic Databases: Foundations, Current Status and Muralikrishna, M., and DeWitt, D. [1988] “Equi-depth
Future Applications,” in Journal of Computer Science Histograms for Estimating Selectivity Factors for
and Engineering , Korean Institute of Information Multi-dimensional Queries,” in SIGMOD [1988].
Scientists and Engineers (KIISE), 1:1, 2007, pp. 1–30 Mylopolous, J., Bernstein, P., and Wong, H. [1980] “A
Navathe, S., Sashidhar, T., and Elmasri, R. [1984a] Language Facility for Designing Database-Intensive
“Relationship Merging in Schema Integration,” in Applications,” TODS, 5:2, June 1980.
VLDB [1984].
Naedele, M., [2003] Standards for XML and Web Negri, M., Pelagatti, S., and Sbatella, L. [1991] “Formal Services Security, IEEE Computer, 36:4, April 2003, pp.
Semantics of SQL Queries,” TODS, 16:3, September 96–98.
Naish, L., and Thom, J. [1983] “The MU-PROLOG Ng, P. [1981] “Further Analysis of the Entity-Relationship Deductive Database,” Technical Report 83/10,
Approach to Database Design,” TSE, 7:1, January 1981. Department of Computer Science, University of
Ngu, A. [1989] “Transaction Modeling,” in ICDE [1989], Melbourne, 1983.
pp. 234–241.
Natan R. [ 2005] Implementing Database Security and Nicolas, J. [1978] “Mutual Dependencies and Some Results
Auditing: Includes Examples from Oracle, SQL
on Undecomposable Relations,” in VLDB [1978]. Server, DB2 UDB, and Sybase , Digital Press, 2005.
Nicolas, J. [1997] “Deductive Object-oriented Databases, Navathe, S. [1980] “An Intuitive Approach to Normalize
Technology, Products, and Applications: Where Are Network-Structured Data,” in VLDB [1980].
We?” Proc. Symposium on Digital Media Information Navathe, S., and Balaraman, A. [1991] “A Transaction
Base (DMIB ’97), Nara, Japan, November 1997. Architecture for a General Purpose Semantic Data
Nicolas, J., Phipps, G., Derr, M., and Ross, K. [1991] “Glue- Model,” in ER [1991], pp. 511–541.
NAIL!: A Deductive Database System,” in SIGMOD Navathe, S. B., Karlapalem, K., and Ra, M. Y. [1996] “A
Mixed Fragmentation Methodology for the Initial Niemiec, R. [2008] Oracle Database 10g Performance Distributed Database Design,” Journal of Computers
Tuning Tips & Techniques , McGraw Hill Osborne and Software Engineering , 3:4, 1996.
Media, 2008, 967 pp.
Navathe, S. B. et al. [1994] “Object Modeling Using Nievergelt, J. [1974] “Binary Search Trees and File Classification in CANDIDE and Its Application,” in
Organization,” ACM Computing Surveys, 6:3, Dogac et al. [1994].
September 1974.
Navathe, S., and Ahmed, R. [1989] “A Temporal Relational Nievergelt, J., Hinterberger, H., and Seveik, K. [1984]. “The Model and Query Language,” Information Sciences,
Grid File: An Adaptable Symmetric Multikey File 47:2, March 1989, pp. 147–175.
Structure,” TODS, 9:1, March 1984, pp. 38–71. Navathe, S., and Gadgil, S. [1982] “A Methodology for
Nijssen, G., ed. [1976] Modelling in Data Base View Integration in Logical Database Design,” in VLDB
Management Systems , North-Holland, 1976. [1982].
Nijssen, G., ed. [1977] Architecture and Models in Data Navathe, S., and Kerschberg, L. [1986] “Role of Data
Base Management Systems , North-Holland, 1977. Dictionaries in Database Design,” Information and
Nwosu, K., Berra, P., and Thuraisingham, B., eds. [1996] Management, 10:1, January 1986.
Design and Implementation of Multimedia Database
Navathe, S., and Savasere, A. [1996] “A Practical Schema Management Systems , Kluwer Academic, 1996. Integration Facility Using an Object Oriented
O’Neil, P., and O’Neil, P. [2001] Database: Principles, Approach,” in Multidatabase Systems (A. Elmagarmid
Programming, Performance , Morgan Kaufmann,
12 Bibliography
Obermarck, R. [1982] “Distributed Deadlock Detection with Set Valued Attributes and Aggregate Functions,” Algorithms,” TODS, 7:2, June 1982.
TODS , 12:4, December 1987. Oh, Y.-C. [1999] “Secure Database Modeling and Design,”
Ozsoyoglu, Z., and Yuan, L. [1987] “A New Normal Form Ph.D. dissertation, College of Computing, Georgia
for Nested Relations,” TODS, 12:1, March 1987. Institute of Technology, March 1999.
Ozsu, M. T., and Valduriez, P. [1999] Principles of Ohsuga, S. [1982] “Knowledge Based Systems as a New
Distributed Database Systems, 2nd ed., Prentice-Hall, Interactive Computer System of the Next Generation,”
in Computer Science and Technologies, North- Papadias, D. et al. [2003] “Query Processing in Spatial Holland, 1982.
Network Databases,” in VLDB [2003] pp. 802–813. Olken, F., Jagadish, J. [2003] Management for Integrative
Papadimitriou, C. [1979] “The Serializability of Concurrent Biology,” OMICS: A Journal of Integrative Biology,
Database Updates,” JACM, 26:4, October 1979. 7:1, January 2003.
Papadimitriou, C. [1986] The Theory of Database Olle, T. [1978] The CODASYL Approach to Data Base
Concurrency Control , Computer Science Press, 1986. Management , Wiley, 1978.
Papadimitriou, C., and Kanellakis, P. [1979] “On Olle, T., Sol, H., and Verrijn-Stuart, A., eds. [1982]
Concurrency Control by Multiple Versions,” TODS, Information System Design Methodology , North-
9:1, March 1974.
Holland, 1982. Papazoglou, M., and Valder, W. [1989] Relational Omiecinski, E., and Scheuermann, P. [1990] “A Parallel
Database Management: A Systems Programming
Algorithm for Record Clustering,” TODS, 15:4, Approach , Prentice-Hall, 1989. December 1990.
Paredaens, J., and Van Gucht, D. [1992] “Converting Omura, J. K. [1990] “Novel applications of cryptography
Nested Algebra Expressions into Flat Algebra in digital communications,” IEEE Communications
Expressions,” TODS, 17:1, March 1992. Magazine , 28:5, May 1990, pp. 21–29.
Parent, C., and Spaccapietra, S. [1985] “An Algebra for a Open GIS Consortium, Inc. [1999] “OpenGIS® Simple
General Entity-Relationship Model,” TSE, 11:7, July Features Specification for SQL,” Revision 1.1, OpenGIS
Project Document 99-049, May 1999. Paris, J. [1986] “Voting with Witnesses: A Consistency Open GIS Consortium, Inc. [2003] “OpenGIS® Geography
Scheme for Replicated Files,” in ICDE [1986]. Markup Language (GML) Implementation Specifica-
Park, J., Chen, M., and Yu, P. [1995] “An Effective Hash- tion,” Version 3, OGC 02-023r4., 2003.
Based Algorithm for Mining Association Rules,” in Oracle [2005] Oracle 10, Introduction to LDAP and
SIGMOD [1995].
Oracle Internet Directory 10g Release 2, Oracle Paton, A. W., ed. [1999] Active Rules in Database Corporation, 2005.
Systems , Springer-Verlag, 1999. Oracle [2007] Oracle Label Security Administrator’s
Paton, N. W., and Diaz, O. [1999] Survey of Active Guide, 11g (release 11.1) , Part no. B28529-01, Oracle,
Database Systems, ACM Computing Surveys, 31:1, available at http://download.oracle.com/docs/cd/
1999, pp. 63–103.
B28359_01/network.111/b28529/intro.htm. Patterson, D., Gibson, G., and Katz, R. [1988] “A Case for Oracle [2008] Oracle 11 Distributed Database Concepts
Redundant Arrays of Inexpensive Disks (RAID),” in 11g Release 1, Oracle Corporation, 2008.
SIGMOD [1988].
Oracle [2009] “An Oracle White Paper: Leading Practices Paul, H. et al. [1987] “Architecture and Implementation of for Driving Down the Costs of Managing Your Oracle
the Darmstadt Database Kernel System,” in SIGMOD Identity and Access Management Suite,” Oracle, April
2009. Pazandak, P., and Srivastava, J., “Evaluating Object DBMSs Osborn, S. L. [1977] “Normal Forms for Relational
for Multimedia,” IEEE Multimedia, 4:3, pp. 34–49. Databases,” Ph.D. dissertation, University of Waterloo,
Pazos- Rangel, R. et. al. [2006] “Least Likely to Use: A New 1977.
Page Replacement Strategy for Improving Database Osborn, S. L. [1989] “The Role of Polymorphism in
Management System Response Time,” in Proc. CSR Schema Evolution in an Object-Oriented Database,”
2006: Computer Science- Theory and Applications, St. TKDE , 1:3, September 1989.
Petersburg, Russia, LNCS, Volume 3967, Springer, Osborn, S. L.[1979] “Towards a Universal Relation
2006, pp. 314–323.
Interface,” in VLDB [1979]. PDES [1991] “A High-Lead Architecture for Implementing Ozsoyoglu, G., Ozsoyoglu, Z., and Matos, V. [1985]
a PDES/STEP Data Sharing Environment,” Publication
Bibliography 1123
Pearson, P. et al. [1994] “The Status of Online Mendelian Price, B. [2004] “ESRI Systems IntegrationTechnical Inheritance in Man (OMIM) Medio 1994” Nucleic
Brief—ArcSDE High-Availability Overview,” ESRI, Acids Research , 22:17, 1994.
2004, Rev 2 (www.lincoln.ne.gov/city/pworks/gis/pdf/ Peckham, J., and Maryanski, F. [1988] “Semantic Data
arcsde.pdf).
Models,” ACM Computing Surveys, 20:3, September Rabitti, F., Bertino, E., Kim, W., and Woelk, D. [1991] “A 1988, pp. 153–189.
Model of Authorization for Next-Generation Database Peng, T. and Tsou, M. [2003] Internet GIS: Distributed
Systems,” TODS, 16:1, March 1991.
Geographic Information Services for the Internet
Ramakrishnan, R., and Gehrke, J. [2003] Database and Wireless Network , Wiley, 2003.
Management Systems, 3rd ed., McGraw-Hill, 2003. Pfleeger, C. P., and Pfleeger, S. [2007] Security in
Ramakrishnan, R., and Ullman, J. [1995] “Survey of Computing , 4th ed., Prentice-Hall, 2007.
Research in Deductive Database Systems,” Journal of Phipps, G., Derr, M., and Ross, K. [1991] “Glue-NAIL!: A
Logic Programming , 23:2, 1995, pp. 125–149. Deductive Database System,” in SIGMOD [1991].
Ramakrishnan, R., ed. [1995] Applications of Logic Piatetsky-Shapiro, G., and Frawley, W., eds. [1991]
Databases , Kluwer Academic, 1995. Knowledge Discovery in Databases , AAAI Press/MIT
Ramakrishnan, R., Srivastava, D., and Sudarshan, S. [1992] Press, 1991.
“{CORAL} : {C} ontrol, {R} elations and {L} ogic,” in Pistor P., and Anderson, F. [1986] “Designing a
VLDB [1992].
Generalized NF2 Model with an SQL-type Language Ramakrishnan, R., Srivastava, D., Sudarshan, S., and Interface,” in VLDB [1986], pp. 278–285.
Sheshadri, P. [1993] “Implementation of the {CORAL} Pitoura, E., and Bhargava, B. [1995] “Maintaining
deductive database system,” in SIGMOD [1993]. Consistency of Data in Mobile Distributed
Ramamoorthy, C., and Wah, B. [1979] “The Placement of Environments.” In 15th ICDCS, May 1995, pp. 404–413.
Relations on a Distributed Relational Database,” Pitoura, E., and Samaras, G. [1998] Data Management for
Proc. First International Conference on Distributed Mobile Computing , Kluwer, 1998.
Computing Systems, IEEE CS, 1979. Pitoura, E., Bukhres, O., and Elmagarmid, A. [1995]
Ramesh, V., and Ram, S. [1997] “Integrity Constraint “Object Orientation in Multidatabase Systems,” ACM
Integration in Heterogeneous Databases an Computing Surveys , 27:2, June 1995.
Enhanced Methodology for Schema Integration,” Polavarapu, N. et al. [2005] “Investigation into Biomedical
Information Systems , 22:8, December 1997, Literature Screening Using Support Vector Machines,” in
pp. 423–446.
Proc. 4 th Int. IEEE Computational Systems Bioinformatics Ratnasamy, S. et al. [2001] “A Scalable Content- Conference (CSB’05), August 2005, pp. 366–374.
Addressable Network.” SIGCOMM 2001. Ponceleon D. et al. [1999] “CueVideo: Automated
Reed, D. P. [1983] “Implementing Atomic Actions on Multimedia Indexing and Retrieval,” Proc. 7th ACM
Decentralized Data,” TOCS, 1:1, February 1983, pp. Multimedia Conf., Orlando, Fl., October 1999, p.199.
Ponniah, P. [2002] Data Warehousing Fundamentals: A Reese, G. [1997] Database Programming with JDBC and Comprehensive Guide for IT Professionals , Wiley
Java, O’Reilley, 1997.
Interscience, 2002. Reisner, P. [1977] “Use of Psychological Experimentation Poosala, V., Ioannidis, Y., Haas, P., and Shekita, E. [1996]
as an Aid to Development of a Query Language,” TSE, “Improved Histograms for Selectivity Estimation of
3:3, May 1977.
Range Predicates,” in SIGMOD [1996]. Reisner, P. [1981] “Human Factors Studies of Database Porter, M. F. [1980] “An algorithm for suffix stripping,”
Query Languages: A Survey and Assessment,” ACM Program , 14:3, pp. 130–137.
Computing Surveys , 13:1, March 1981. Potter, B., Sinclair, J., and Till, D. [1996] An Introduction
Reiter, R. [1984] “Towards a Logical Reconstruction of to Formal Specification and Z , 2nd ed., Prentice-Hall,
Relational Database Theory,” in Brodie et al., Ch. 8 1996.
Prabhakaran, B. [1996] Multimedia Database Manage- Reuter, A. [1980] “A Fast Transaction Oriented Logging ment Systems , Springer-Verlag, 1996.
Scheme for UNDO recovery,” TSE 6:4, pp. 348–356. Prasad, S. et al. [2004] “SyD: A Middleware Testbed for
Ries, D., and Stonebraker, M. [1977] “Effects of Locking Collaborative Applications over Small Heterogeneous
Granularity in a Database Management System,” Devices and Data Stores,” Proc. ACM/IFIP/USENIX 5th
TODS , 2:3, September 1977.
International Middleware Conference (MW-04), Rissanen, J. [1977] “Independent Components of
1124 Bibliography
Rivest, R. et al.[1978] “A Method for Obtaining Digital Rusinkiewicz, M. et al. [1988] “OMNIBASE—A Loosely Signatures and Public-Key Cryptosystems,” CACM,
Coupled: Design and Implementation of a 21:2, February 1978, pp. 120–126.
Multidatabase System,” IEEE Distributed Processing Robbins, R. [1993] “Genome Informatics: Requirements
Newsletter , 10:2, November 1988. and Challenges,” Proc. Second International Conference
Rustin, R., ed. [1972] Data Base Systems, Prentice-Hall, on Bioinformatics, Supercomputing and Complex
Genome Analysis, World Scientific Publishing, 1993. Rustin, R., ed. [1974] Proc. BJNAV2. Robertson, S. [1997] “The Probability Ranking Principle in
Sacca, D., and Zaniolo, C. [1987] “Implementation of IR,” in Readings in Information Retrieval (Jones, K. S.,
Recursive Queries for a Data Language Based on Pure and Willett, P., eds.), Morgan Kaufmann Multimedia
Horn Clauses,” Proc. Fourth International Conference on Information and Systems Series, pp. 281–286.
Logic Programming, MIT Press, 1986. Robertson, S., Walker, S., and Hancock-Beaulieu, M. [1995]
Sadri, F., and Ullman, J. [1982] “Template Dependencies: A “Large Test Collection Experiments on an Operational,
Large Class of Dependencies in Relational Databases Interactive System: Okapi at TREC,” Information
and Its Complete Axiomatization,” JACM, 29:2, April
Processing and Management,
31, pp. 345–360.
Rocchio, J. [1971] “Relevance Feedback in Information Sagiv, Y., and Yannakakis, M. [1981] “Equivalence among Retrieval,” in The SMART Retrieval System:
Relational Expressions with the Union and Difference Experiments in Automatic Document Processing , (G.
Operators,” JACM, 27:4, November 1981. Salton, ed.), Prentice-Hall, pp. 313–323.
Sahay, S. et al. [2008] “Discovering Semantic Biomedical Rosenkrantz, D., Stearns, D., and Lewis, P. [1978] System-
Relations Utilizing the Web,” in Journal of ACM Level Concurrency Control for Distributed Database
Transactions on Knowledge Discovery from Data
Systems, TODS, 3:2, pp. 178–198. (TKDD) , Special issue on Bioinformatics, 2:1, 2008. Rotem, D., [1991] “Spatial Join Indices,” in ICDE [1991].
Sakai, H. [1980] “Entity-Relationship Approach to Roth, M. A., Korth, H. F., and Silberschatz, A. [1988]
Conceptual Schema Design,” in SIGMOD [1980]. “Extended Algebra and Calculus for Non-1NF
Salem, K., and Garcia-Molina, H. [1986] “Disk Striping,” Relational Databases,” TODS, 13:4, 1988, pp. 389–417.
in ICDE [1986], pp. 336–342. Roth, M., and Korth, H. [1987] “The Design of Non-1NF
Salton, G. [1968] Automatic Information Organization Relational Databases into Nested Normal Form,” in
and Retrieval , McGraw Hill, 1968. SIGMOD [1987].
Salton, G. [1971] The SMART Retrieval System— Rothnie, J. et al. [1980] “Introduction to a System for
Experiments in Automatic Document Processing , Distributed Databases (SDD-1),” TODS, 5:1, March
Prentice-Hall, 1971.
1980. Salton, G. [1990] “Full Text Information Processing Using Roussopoulos, N. [1991] “An Incremental Access Method
the Smart System,” IEEE Data Engineering Bulletin for View-Cache: Concept, Algorithms, and Cost
13:1, 1990, pp. 2–9.
Analysis,” TODS, 16:3, September 1991. Salton, G., and Buckley, C. [1991] “Global Text Matching for Roussopoulos, N., Kelley, S., and Vincent, F. [1995]
Information Retrieval” in Science, 253, August 1991. “Nearest Neighbor Queries,” in SIGMOD [1995], pp.
Salton, G., Yang, C. S., and Yu, C. T. [1975] “A theory of 71–79.
term importance in automatic text analysis,” Journal of Rozen, S., and Shasha, D. [1991] “A Framework for Auto-
the American Society for Information Science , 26, pp. mating Physical Database Design,” in VLDB [1991].
Rudensteiner, E. [1992] “Multiview: A Methodology for Salzberg, B. [1988] File Structures: An Analytic Supporting Multiple Views in Object-Oriented
Approach , Prentice-Hall, 1988. Databases,” in VLDB [1992].
Salzberg, B. et al. [1990] “FastSort: A Distributed Single- Ruemmler, C., and Wilkes, J. [1994] “An Introduction to
Input Single-Output External Sort,” in SIGMOD [1990]. Disk Drive Modeling,” IEEE Computer, 27:3, March
Samet, H. [1990] The Design and Analysis of Spatial 1994, pp. 17–27.
Data Structures , Addison-Wesley, 1990. Rumbaugh, J., Blaha, M., Premerlani, W., Eddy, F., and
Samet, H. [1990a] Applications of Spatial Data Lorensen, W. [1991] Object Oriented Modeling and
Structures: Computer Graphics, Image Processing,
Design , Prentice-Hall, 1991. and GIS , Addison-Wesley, 1990. Rumbaugh, J., Jacobson, I., Booch, G. [1999] The Unified
Sammut, C., and Sammut, R. [1983] “The Modeling Language Reference Manual , Addison-
Implementation of UNSW-PROLOG,” The Australian
Bibliography 1125
Santucci, G. [1998] “Semantic Schema Refinements for Senko, M. [1975] “Specification of Stored Data Structures Multilevel Schema Integration,” DKE, 25:3, 1998, pp.
and Desired Output in DIAM II with FORAL,” in 301–326.
VLDB [1975].
Sarasua, W., and O’Neill, W. [1999]. “GIS in Senko, M. [1980] “A Query Maintenance Language for the Transportation,” in Taylor and Francis [1999].
Data Independent Accessing Model II,” Information Sarawagi, S., Thomas, S., and Agrawal, R. [1998]
Systems , 5:4, 1980.
“Integrating Association Rules Mining with Relational Shapiro, L. [1986] “Join Processing in Database Systems Database systems: Alternatives and Implications,” in
with Large Main Memories,” TODS, 11:3, 1986. SIGMOD [1998].
Shasha, D., and Bonnet, P. [2002] Database Tuning: Savasere, A., Omiecinski, E., and Navathe, S. [1995] “An
Principles, Experiments, and Troubleshooting
Efficient Algorithm for Mining Association Rules,” in Techniques , Morgan Kaufmann, Revised ed., 2002. VLDB [1995].
Shasha, D., and Goodman, N. [1988] “Concurrent Search Savasere, A., Omiecinski, E., and Navathe, S. [1998]
Structure Algorithms,” TODS, 13:1, March 1988. “Mining for Strong Negative Association in a Large
Shekhar, S., and Chawla, S. [2003] Spatial Databases, A Database of Customer Transactions,” in ICDE [1998].
Tour , Prentice-Hall, 2003.
Schatz, B. [1995] “Information Analysis in the Net: The Shekhar, S., and Xong, H. [2008] Encyclopedia of GIS, Interspace of the Twenty-First Century,” Keynote Plenary
Springer Link (Online service). Lecture at American Society for Information Science
Shekita, E., and Carey, M. [1989] “Performance (ASIS) Annual Meeting, Chicago, October 11, 1995.
Enhancement Through Replication in an Object- Schatz, B. [1997] “Information Retrieval in Digital
Oriented DBMS,” in SIGMOD [1989]. Libraries: Bringing Search to the Net,” Science, 275:17
Shenoy, S., and Ozsoyoglu, Z. [1989] “Design and January 1997.
Implementation of a Semantic Query Optimizer,” Schek, H. J., and Scholl, M. H. [1986] “The Relational
TKDE , 1:3, September 1989. Model with Relation-valued Attributes,” Information
Sheth, A. P., and Larson, J. A. [1990] “Federated Database Systems , 11:2, 1986.
Systems for Managing Distributed, Heterogeneous, Schek, H. J., Paul, H. B., Scholl, M. H., and Weikum, G.
and Autonomous Databases,” ACM Computing [1990] “The DASDBS Project: Objects, Experiences,
Surveys , 22:3, September 1990, pp. 183–236. and Future Projects,” TKDE, 2:1, 1990.
Sheth, A., Gala, S., and Navathe, S. [1993] “On Automatic Scheuermann, P., Schiffner, G., and Weber, H. [1979]
Reasoning for Schema Integration,” in International “Abstraction Capabilities and Invariant Properties
Journal of Intelligent Co-operative Information
Modeling within the Entity-Relationship Approach,” in
Systems , 2:1, March 1993.
ER Conference [1979]. Sheth, A., Larson, J., Cornelio, A., and Navathe, S. [1988] Schlimmer, J., Mitchell, T., and McDermott, J. [1991]
“A Tool for Integrating Conceptual Schemas and User “Justification Based Refinement of Expert Knowledge”
Views,” in ICDE [1988].
in Piatetsky-Shapiro and Frawley [1991]. Shipman, D. [1981] “The Functional Data Model and the Schlossnagle, G. [2005] Advanced PHP Programming,
Data Language DAPLEX,” TODS, 6:1, March 1981. Sams, 2005.
Shlaer, S., Mellor, S. [1988] Object-Oriented System Schmidt, J., and Swenson, J. [1975] “On the Semantics of
Analysis: Modeling the World in Data , Prentice-Hall, the Relational Model,” in SIGMOD [1975].
Schneider, R. D. [2006] MySQL Database Design and Shneiderman, B., ed. [1978] Databases: Improving Tuining , MySQL Press, 2006.
Usability and Responsiveness , Academic Press, 1978. Scholl, M. O., Voisard, A., and Rigaux, P. [2001] Spatial
Sibley, E., and Kerschberg, L. [1977] “Data Architecture Database Management Systems , Morgan Kauffman,
and Data Model Considerations,” NCC, AFIPS, 46, 2001.
Sciore, E. [1982] “A Complete Axiomatization for Full Join Siegel, M., and Madnick, S. [1991] “A Metadata Approach Dependencies,” JACM, 29:2, April 1982.
to Resolving Semantic Conflicts,” in VLDB [1991]. Scott, M., and Fowler, K. [1997] UML Distilled: Applying
Siegel, M., Sciore, E., and Salveter, S. [1992] “A Method for the Standard Object Modeling Language, Addison-
Automatic Rule Derivation to Support Semantic Query Wesley, 1997.
Optimization,” TODS, 17:4, December 1992. Selinger, P. et al. [1979] “Access Path Selection in a
SIGMOD [1974] Proc. ACM SIGMOD-SIGFIDET Relational Database Management System,” in SIGMOD
Conference on Data Description, Access, and Control,
1126 Bibliography
SIGMOD [1975] Proc. 1975 ACM SIGMOD International SIGMOD [1992] Proc. 1992 ACM SIGMOD International Conference on Management of Data, King, F., ed., San
Conference on Management of Data, Stonebraker, M., Jose, CA, May 1975.
ed., San Diego, CA, June 1992. SIGMOD [1976] Proc. 1976 ACM SIGMOD International
SIGMOD [1993] Proc. 1993 ACM SIGMOD International Conference on Management of Data, Rothnie, J., ed.,
Conference on Management of Data, Buneman, P., and Washington, June 1976.
Jajodia, S., eds., Washington, June 1993. SIGMOD [1977] Proc. 1977 ACM SIGMOD International
SIGMOD [1994] Proceedings of 1994 ACM SIGMOD Conference on Management of Data, Smith, D., ed.,
International Conference on Management of Data, Toronto, August 1977.
Snodgrass, R. T., and Winslett, M., eds., Minneapolis, SIGMOD [1978] Proc. 1978 ACM SIGMOD International
MN, June 1994.
Conference on Management of Data, Lowenthal, E., and SIGMOD [1995] Proceedings of 1995 ACM SIGMOD Dale, N., eds., Austin, TX, May/June 1978.
International Conference on Management of Data, SIGMOD [1979] Proc. 1979 ACM SIGMOD International
Carey, M., and Schneider, D. A., eds., Minneapolis, MN, Conference on Management of Data, Bernstein, P., ed.,
June 1995.
Boston, MA, May/June 1979. SIGMOD [1996] Proceedings of 1996 ACM SIGMOD SIGMOD [1980] Proc. 1980 ACM SIGMOD International
International Conference on Management of Data, Jagadish, Conference on Management of Data, Chen, P., and
H. V., and Mumick, I. P., eds., Montreal, June 1996. Sprowls, R., eds., Santa Monica, CA, May 1980.
SIGMOD [1997] Proceedings of 1997 ACM SIGMOD SIGMOD [1981] Proc. 1981 ACM SIGMOD International
International Conference on Management of Data, Conference on Management of Data, Lien, Y., ed., Ann
Peckham, J., ed., Tucson, AZ, May 1997. Arbor, MI, April/May 1981.
SIGMOD [1998] Proceedings of 1998 ACM SIGMOD SIGMOD [1982] Proc. 1982 ACM SIGMOD International
International Conference on Management of Data, Haas, Conference on Management of Data, Schkolnick, M.,
L., and Tiwary, A., eds., Seattle, WA, June 1998. ed., Orlando, FL, June 1982.
SIGMOD [1999] Proceedings of 1999 ACM SIGMOD SIGMOD [1983] Proc. 1983 ACM SIGMOD International
International Conference on Management of Data, Conference on Management of Data, DeWitt, D., and
Faloutsos, C., ed., Philadelphia, PA, May 1999. Gardarin, G., eds., San Jose, CA, May 1983.
SIGMOD [2000] Proceedings of 2000 ACM SIGMOD SIGMOD [1984] Proc. 1984 ACM SIGMOD Internaitonal
International Conference on Management of Data, Conference on Management of Data, Yormark, E., ed.,
Chen, W., Naughton J., and Bernstein, P., eds., Dallas, Boston, MA, June 1984.
TX, May 2000.
SIGMOD [1985] Proc. 1985 ACM SIGMOD International SIGMOD [2001] Proceedings of 2001 ACM SIGMOD Conference on Management of Data, Navathe, S., ed.,
International Conference on Management of Data, Aref, Austin, TX, May 1985.
W., ed., Santa Barbara, CA, May 2001. SIGMOD [1986] Proc. 1986 ACM SIGMOD International
SIGMOD [2002] Proceedings of 2002 ACM SIGMOD Conference on Management of Data, Zaniolo, C., ed.,
International Conference on Management of Data, Washington, May 1986.
Franklin, M., Moon, B., and Ailamaki, A., eds., SIGMOD [1987] Proc. 1987 ACM SIGMOD International
Madison, WI, June 2002.
Conference on Management of Data, Dayal, U., and SIGMOD [2003] Proceedings of 2003 ACM SIGMOD Traiger, I., eds., San Francisco, CA, May 1987.
International Conference on Management of Data, SIGMOD [1988] Proc. 1988 ACM SIGMOD International
Halevy, Y., Zachary, G., and Doan, A., eds., San Diego, Conference on Management of Data, Boral, H., and
CA, June 2003.
Larson, P., eds., Chicago, June 1988. SIGMOD [2004] Proceedings of 2004 ACM SIGMOD SIGMOD [1989] Proc. 1989 ACM SIGMOD International
International Conference on Management of Data, Conference on Management of Data, Clifford, J.,
Weikum, G., Christian König, A., and DeBloch, S., eds., Lindsay, B., and Maier, D., eds., Portland, OR, June
Paris, France, June 2004.
1989. SIGMOD [2005] Proceedings of 2005 ACM SIGMOD SIGMOD [1990] Proc. 1990 ACM SIGMOD International
International Conference on Management of Data, Conference on Management of Data, Garcia-Molina, H.,
Widom, J., ed., Baltimore, MD, June 2005. and Jagadish, H., eds., Atlantic City, NJ, June 1990.
SIGMOD [2006] Proceedings of 2006 ACM SIGMOD SIGMOD [1991] Proc. 1991 ACM SIGMOD International
International Conference on Management of Data, Conference on Management of Data, Clifford, J., and
Chaudhari, S., Hristidis,V., and Polyzotis, N., eds.,
Bibliography 1127
SIGMOD [2007] Proceedings of 2007 ACM SIGMOD Snodgrass, R., ed. [1995] The TSQL2 Temporal Query International Conference on Management of Data,
Language , Springer, 1995.
Chan, C.-Y., Ooi, B.-C., and Zhou, A., eds., Beijing, Soutou, G. [1998] “Analysis of Constraints for N-ary China, June 2007.
Relationships,” in ER98.
SIGMOD [2008] Proceedings of 2008 ACM SIGMOD Spaccapietra, S., and Jain, R., eds. [1995] Proc. Visual International Conference on Management of Data,
Database Workshop, Lausanne, Switzerland, October Wang, J. T.-L., ed., Vancouver, Canada, June 2008.
SIGMOD [2009] Proceedings of 2009 ACM SIGMOD Spiliopoulou, M. [2000] “Web Usage Mining for Web Site International Conference on Management of Data,
Evaluation,” CACM 43:8, August 2000, pp. 127–134. Cetintemel, U., Zdonik,S., Kossman, D., and Tatbul, N.,
Spooner D., Michael, A., and Donald, B. [1986] “Modeling eds., Providence, RI, June–July 2009.
CAD Data with Data Abstraction and Object-Oriented SIGMOD [2010] Proceedings of 2010 ACM SIGMOD
Technique,” in ICDE [1986]. International Conference on Management of Data,
Srikant, R., and Agrawal, R. [1995] “Mining Generalized Indianapolis, IN, June 2010, forthcoming.
Association Rules,” in VLDB [1995]. Silberschatz, A., Korth, H., and Sudarshan, S. [2006]
Srinivas, M., and Patnaik, L. [1994] “Genetic Algorithms: Database System Concepts, 5th ed., McGraw-Hill, 2006.
A Survey,” IEEE Computer, 27:6, June 1994, pp.17–26. Silberschatz, A., Stonebraker, M., and Ullman, J. [1990]
Srinivasan, V., and Carey, M. [1991] “Performance of B- “Database Systems: Achievements and Opportunities,”
Tree Concurrency Control Algorithms,” in SIGMOD in ACM SIGMOD Record, 19:4, December 1990.
Simon, H. A. [1971] “Designing Organizations for an Srivastava, D., Ramakrishnan, R., Sudarshan, S., and Information-Rich World,” in Computers, Communi-
Sheshadri, P. [1993] “Coral++: Adding Object-orienta- cations and the Public Interest , (Greenberger, M.,
tion to a Logic Database Language,” in VLDB [1993]. ed.), The Johns Hopkins University Press, 1971, (pp.
Srivastava, J, et al. [2000] “Web Usage Mining: Discovery 37–72).
and Applications of Usage Patterns from Web Data,” Sion, R., Atallah, M., and Prabhakar, S. [2004] “Protecting
SIGKDD Explorations , 1:2, 2000. Rights Proofs for Relational Data Using
Stachour, P., and Thuraisingham, B. [1990] “The Design Watermarking,” TKDE, 16:12, 2004, pp. 1509–1525.
and Implementation of INGRES,” TKDE, 2:2, June Sklar, D. [2005] Learning PHP5, O’Reilly Media, Inc.,
2005. Stallings, W. [1997] Data and Computer Communi- Smith, G. [1990] “The Semantic Data Model for Security:
cations , 5th ed., Prentice-Hall, 1997. Representing the Security Semantics of an
Stallings, W. [2010] Network Security Essentials, Application,” in ICDE [1990].
Applications and Standards , 4th ed., Prentice-Hall, Smith, J. et al. [1981] “MULTIBASE: Integrating
Distributed Heterogeneous Database Systems,” NCC, Stevens, P., and Pooley, R. [2003] Using UML: Software AFIPS, 50, 1981.
Engineering with Objects and Components , Revised Smith, J. R., and Chang, S.-F. [1996] “VisualSEEk: A Fully
edition, Addison-Wesley, 2003. Automated Content-Based Image Query System,” Proc.
Stoesser, G. et al. [2003] “The EMBL Nucleotide Sequence 4 th ACM Multimedia Conf., Boston, MA, November
Database: Major New Developments,” Nucleic Acids 1996, pp. 87–98.
Research , 31:1, January 2003, pp. 17–22. Smith, J., and Chang, P. [1975] “Optimizing the
Stoica, I., Morris, R., Karger, D. et al. [2001] “Chord: A Performance of a Relational Algebra Interface,” CACM,
Scalable Peer-To-Peer Lookup Service for Internet 18:10, October 1975.
Applications,” SIGCOMM 2001. Smith, J., and Smith, D. [1977] “Database Abstractions:
Stonebraker, M., Aoki, P., Litwin W., et al. [1996] Aggregation and Generalization,” TODS, 2:2, June 1977.
“Mariposa: A Wide-Area Distributed Database System” Smith, K., and Winslett, M. [1992] “Entity Modeling in the
VLDB J , 5:1, 1996, pp. 48–63. MLS Relational Model,” in VLDB [1992].
Stonebraker M. et al. [2005] “C-store: A column oriented Smith, P., and Barnes, G. [1987] Files and Databases: An
DBMS,” in VLDB [2005].
Introduction , Addison-Wesley, 1987. Stonebraker, M. [1975] “Implementation of Integrity Snodgrass, R. [1987] “The Temporal Query Language
Constraints and Views by Query Modification,” in TQuel,” TODS, 12:2, June 1987.
SIGMOD [1975].
Snodgrass, R., and Ahn, I. [1985] “A Taxonomy of Time in Stonebraker, M. [1993] “The Miro DBMS” in SIGMOD
1128 Bibliography
Stonebraker, M., and Rowe, L. [1986] “The Design of Thomas, J., and Gould, J. [1975] “A Psychological Study of POSTGRES,” in SIGMOD [1986].
Query by Example,” NCC AFIPS, 44, 1975. Stonebraker, M., ed. [1994] Readings in Database
Thomas, R. [1979] “A Majority Consensus Approach to Systems , 2nd ed., Morgan Kaufmann, 1994.
Concurrency Control for Multiple Copy Data Bases,” Stonebraker, M., Hanson, E., and Hong, C. [1987] “The
TODS , 4:2, June 1979.
Design of the POSTGRES Rules System,” in ICDE Thomasian, A. [1991] “Performance Limits of Two-Phase [1987].
Locking,” in ICDE [1991].
Stonebraker, M., with Moore, D. [1996] Object-Relational Thuraisingham, B. [2001] Managing and Mining DBMSs: The Next Great Wave , Morgan Kaufmann,
Multimedia Databases , CRC Press, 2001. 1996.
Thuraisingham, B., Clifton, C., Gupta, A., Bertino, E., and Stonebraker, M., Wong, E., Kreps, P., and Held, G. [1976]
Ferrari, E. [2001] “Directions for Web and “The Design and Implementation of INGRES,” TODS,
E-commerce Applications Security,” Proc. 10th IEEE 1:3, September 1976.
International Workshops on Enabling Technologies: Stroustrup, B. [1997] The C++ Programming Language:
Infrastructure for Collaborative Enterprises, 2001, pp. Special Edition , Pearson, 1997.
Su, S. [1985] “A Semantic Association Model for Todd, S. [1976] “The Peterlee Relational Test Vehicle—A Corporate and Scientific-Statistical Databases,”
System Overview,” IBM Systems Journal, 15:4, Information Science , 29, 1985.
December 1976.
Su, S. [1988] Database Computers, McGraw-Hill, 1988. Toivonen, H., “Sampling Large Databases for Association Su, S., Krishnamurthy, V., and Lam, H. [1988] “An Object-
Rules,” in VLDB [1996].
Oriented Semantic Association Model (OSAM*),” in Tou, J., ed. [1984] Information Systems COINS-IV,
AI in Industrial Engineering and Manufacturing:
Plenum Press, 1984.
Theoretical Issues and Applications , American Tsangaris, M., and Naughton, J. [1992] “On the Institute of Industrial Engineers, 1988.
Performance of Object Clustering Techniques,” in Subrahmanian V. S., and Jajodia, S., eds. [1996]
SIGMOD [1992].
Tsichritzis, D. [1982] “Forms Management,” CACM, 25:7, Directions , Springer-Verlag, 1996.
Multimedia Database Systems: Issues and Research
July 1982.
Subrahmanian, V. [1998] Principles of Multimedia Tsichritzis, D., and Klug, A., eds. [1978] The Databases Systems , Morgan Kaufmann, 1998.
ANSI/X3/SPARC DBMS Framework , AFIPS Press, Sunderraman, R. [2007] ORACLE 10g Programming: A
Primer , Addison-Wesley, 2007. Tsichritzis, D., and Lochovsky, F. [1976] “Hierarchical Swami, A., and Gupta, A. [1989] “Optimization of Large
Database Management: A Survey,” ACM Computing Join Queries: Combining Heuristics and
Surveys , 8:1, March 1976.
Combinatorial Techniques,” in SIGMOD [1989]. Tsichritzis, D., and Lochovsky, F. [1982] Data Models, Sybase [2005] System Administration Guide: Volume 1
Prentice-Hall, 1982.
and Volume 2 (Adaptive Server Enterprise 15.0),
Tsotras, V., and Gopinath, B. [1992] “Optimal Versioning Sybase, 2005.
of Object Classes,” in ICDE [1992]. Tan, P., Steinbach, M., and Kumar, V. [2006] Introduction
Tsou, D. M., and Fischer, P. C. [1982] “Decomposition of a to Data Mining , Addison-Wesley, 2006.
Relation Scheme into Boyce Codd Normal Form,” Tanenbaum, A. [2003] Computer Networks, 4th ed.,
SIGACT News, 14:3, 1982, pp. 23–29. Prentice-Hall PTR, 2003.
U.S. Congress [1988] “Office of Technology Report, Tansel, A. et al., eds. [1993] Temporal Databases: Theory,
Appendix D: Databases, Repositories, and Design, and Implementation , Benjamin Cummings,
Informatics,” in Mapping Our Genes: Genome 1993.
Projects: How Big, How Fast? John Hopkins Teorey, T. [1994] Database Modeling and Design: The
University Press, 1988.
Fundamental Principles , 2nd ed., Morgan Kaufmann, U.S. Department of Commerce [1993] TIGER/Line Files, 1994.
Bureau of Census, Washington, 1993. Teorey, T., Yang, D., and Fry, J. [1986] “A Logical Design
Ullman, J. [1982] Principles of Database Systems, 2nd Methodology for Relational Databases Using the
ed., Computer Science Press, 1982.
Extended Entity-Relationship Model,” ACM
Ullman, J. [1985] “Implementation of Logical Query Computing Surveys , 18:2, June 1986.
Languages for Databases,” TODS, 10:3, September 1985.
Bibliography 1129
Ullman, J. [1988] Principles of Database and Knowledge- VLDB [1976] Systems for Large Databases, Lockemann, Base Systems , Vol. 1, Computer Science Press, 1988.
P., and Neuhold, E., eds., in Proc. Second International Ullman, J. [1989] Principles of Database and Knowledge-
Conference on Very Large Data Bases, Brussels, Belgium, Base Systems , Vol. 2, Computer Science Press, 1989.
July 1976, North-Holland, 1976. Ullman, J. D., and Widom, J. [1997] A First Course in
VLDB [1977] Proc.Third International Conference on Very Database Systems , Prentice-Hall, 1997.
Large Data Bases, Merten, A., ed., Tokyo, Japan, Uschold, M., and Gruninger, M. [1996] “Ontologies:
October 1977.
Principles, Methods and Applications,” Knowledge VLDB [1978] Proc. Fourth International Conference on Very Engineering Review , 11:2, June 1996.
Large Data Bases, Bubenko, J., and Yao, S., eds., West Vadivelu, V., Jayakumar, R. V., Muthuvel, M., et al. [2008]
Berlin, Germany, September 1978. “A backup mechanism with concurrency control for
VLDB [1979] Proc. Fifth International Conference on Very multilevel secure distributed database systems.”, Proc.
Large Data Bases, Furtado, A., and Morgan, H., eds., Int. Conf. on Digital Information Management, 2008,
Rio de Janeiro, Brazil, October 1979. pp. 57–62.
VLDB [1980] Proc. Sixth International Conference on Very Vaidya, J., and Clifton, C., “Privacy-Preserving Data
Large Data Bases, Lochovsky, F., and Taylor, R., eds., Mining: Why, How, and What For?” IEEE Security &
Montreal, Canada, October 1980. Privacy (IEEESP) , November–December 2004, pp.
VLDB [1981] Proc. Seventh International Conference on 19–27.
Very Large Data Bases, Zaniolo, C., and Delobel, C., Valduriez, P., and Gardarin, G. [1989] Analysis and
eds., Cannes, France, September 1981. Comparison of Relational Database Systems ,
VLDB [1982] Proc. Eighth International Conference on Very Addison-Wesley, 1989.
Large Data Bases, McLeod, D., and Villasenor, Y., eds., van Rijsbergen, C. J. [1979] Information Retrieval,
Mexico City, September 1982. Butterworths, 1979.
VLDB [1983] Proc. Ninth International Conference on Very Vassiliou, Y. [1980] “Functional Dependencies and
Large Data Bases, Schkolnick, M., and Thanos, C., eds., Incomplete Information,” in VLDB [1980].
Florence, Italy, October/November 1983. Vélez, F., Bernard, G., Darnis, V. [1989] “The O2 Object
VLDB [1984] Proc. Tenth International Conference on Very Manager: an Overview.” In VLDB [1989] , pp. 357–366.
Large Data Bases, Dayal, U., Schlageter, G., and Seng, L., Verheijen, G., and VanBekkum, J. [1982] “NIAM: An
eds., Singapore, August 1984. Information Analysis Method,” in Olle et al. [1982].
VLDB [1985] Proc. Eleventh International Conference on Verhofstad, J. [1978] “Recovery Techniques for Database
Very Large Data Bases, Pirotte, A., and Vassiliou, Y., Systems,” ACM Computing Surveys, 10:2, June 1978.
eds., Stockholm, Sweden, August 1985. Vielle, L. [1986] “Recursive Axioms in Deductive
VLDB [1986] Proc. Twelfth International Conference on Databases: The Query-Subquery Approach,” in EDS
Very Large Data Bases, Chu, W., Gardarin, G., and [1986].
Ohsuga, S., eds., Kyoto, Japan, August 1986. Vielle, L. [1987] “Database Complete Proof Production
VLDB [1987] Proc. Thirteenth International Conference on Based on SLD-resolution,” in Proc. Fourth International
Very Large Data Bases, Stocker, P., Kent, W., and Conference on Logic Programming, 1987.
Hammersley, P., eds., Brighton, England, September Vielle, L. [1988] “From QSQ Towards QoSaQ: Global
Optimization of Recursive Queries,” in EDS [1988]. VLDB [1988] Proc. Fourteenth International Conference on Vielle, L. [1998] “VALIDITY: Knowledge Independence for
Very Large Data Bases, Bancilhon, F., and DeWitt, D., Electronic Mediation,” invited paper, in Practical
eds., Los Angeles, August/September 1988. Applications of Prolog/Practical Applications of
VLDB [1989] Proc. Fifteenth International Conference on Constraint Technology (PAP/PACT ’98), London, March
Very Large Data Bases, Apers, P., and Wiederhold, G., 1998.
eds., Amsterdam, August 1989. Vin, H., Zellweger, P., Swinehart, D., and Venkat Rangan, P.
VLDB [1990] Proc. Sixteenth International Conference on [1991] “Multimedia Conferencing in the Etherphone
Very Large Data Bases, McLeod, D., Sacks-Davis, R., Environment,” IEEE Computer, Special Issue on
and Schek, H., eds., Brisbane, Australia, August 1990. Multimedia Information Systems, 24:10, October 1991.
VLDB [1991] Proc. Seventeenth International Conference VLDB [1975] Proc. First International Conference on Very
on Very Large Data Bases, Lohman, G., Sernadas, A., Large Data Bases, Kerr, D., ed., Framingham, MA,
and Camps, R., eds., Barcelona, Catalonia, Spain, September 1975.
September 1991.
1130 Bibliography
VLDB [1992] Proc. Eighteenth International Conference on VLDB [2008] Proc. 34th International Conference on Very Very Large Data Bases, Yuan, L., ed., Vancouver,
Large Data Bases, as Proceedings of the VLDB Canada, August 1992.
Endowment, Volume 1, Auckland, New Zealand, VLDB [1993] Proc. Nineteenth International Conference on
August 2008.
Very Large Data Bases, Agrawal, R., Baker, S., and Bell, VLDB [2009] Proc. 35th International Conference on D. A., eds., Dublin, Ireland, August 1993.
Very Large Data Bases, as Proceedings of the VLDB [1994] Proc. 20th International Conference on Very
VLDB Endowment, Volume 2 , Lyon, France, August Large Data Bases, Bocca, J., Jarke, M., and Zaniolo, C.,
eds., Santiago, Chile, September 1994. VLDB [2010] Proc. 36th International Conference on Very VLDB [1995] Proc. 21st International Conference on Very
Large Data Bases, as Proceedings of the VLDB Large Data Bases, Dayal, U., Gray, P.M.D., and Nishio,
Endowment, Volume 3, Singapore, August 2010, forth- S., eds., Zurich, Switzerland, September 1995.
coming.
VLDB [1996] Proc. 22nd International Conference on Very Voorhees, E., and Harman, D., eds., [2005] TREC Large Data Bases, Vijayaraman, T. M., Buchman, A. P.,
Experiment and Evaluation in Information Retrieval,
Mohan, C., and Sarda, N. L., eds., Bombay, India,
MIT Press, 2005.
September 1996. Vorhaus, A., and Mills, R. [1967] “The Time-Shared Data VLDB [1997] Proc. 23rd International Conference on Very
Management System: A New Approach to Data Large Data Bases, Jarke, M., Carey, M. J., Dittrich, K. R.,
Management,” System Development Corporation, Lochovsky, F. H., and Loucopoulos, P., eds., Zurich,
Report SP-2634, 1967.
Switzerland, September 1997. Wallace, D. [1995] “1994 William Allan Award Address: VLDB [1998] Proc. 24th International Conference on Very
Mitochondrial DNA Variation in Human Evolution, Large Data Bases, Gupta, A., Shmueli, O., and Widom,
Degenerative Disease, and Aging.” American Journal J., eds., New York, September 1998.
of Human Genetics , 57:201–223, 1995. VLDB [1999] Proc. 25th International Conference on Very
Walton, C., Dale, A., and Jenevein, R. [1991] “A Taxonomy Large Data Bases, Zdonik, S. B., Valduriez, P., and
and Performance Model of Data Skew Effects in Orlowska, M., eds., Edinburgh, Scotland, September
Parallel Joins,” in VLDB [1991]. 1999.
Wang, K. [1990] “Polynomial Time Designs Toward Both VLDB [2000] Proc. 26th International Conference on Very
BCNF and Efficient Data Manipulation,” in Large Data Bases, Abbadi, A. et al., eds., Cairo, Egypt,
SIGMOD [1990].
September 2000. Wang, Y., and Madnick, S. [1989] “The Inter-Database VLDB [2001] Proc. 27th International Conference on Very
Instance Identity Problem in Integrating Autonomous Large Data Bases, Apers, P. et al., eds., Rome, Italy,
Systems,” in ICDE [1989].
September 2001. Wang, Y., and Rowe, L. [1991] “Cache Consistency and VLDB [2002] Proc. 28th International Conference on Very
Concurrency Control in a Client/Server DBMS Large Data Bases, Bernstein, P., Ionnidis, Y.,
Architecture,” in SIGMOD [1991]. Ramakrishnan, R., eds., Hong Kong, China, August
Warren, D. [1992] “Memoing for Logic Programs,” CACM, 2002.
35:3, ACM, March 1992.
VLDB [2003] Proc. 29th International Conference on Very Weddell, G. [1992] “Reasoning About Functional Large Data Bases, Freytag, J. et al., eds., Berlin,
Dependencies Generalized for Semantic Data Models,” Germany, September 2003.
TODS , 17:1, March 1992.
VLDB [2004] Proc. 30th International Conference on Very Weikum, G. [1991] “Principles and Realization Strategies Large Data Bases, Nascimento, M. et al., eds., Toronto,
of Multilevel Transaction Management,” TODS, 16:1, Canada, September 2004.
March 1991.
VLDB [2005] Proc. 31st International Conference on Very Weiss, S., and Indurkhya, N. [1998] Predictive Data Large Data Bases, Böhm, K. et al., eds., Trondheim,
Mining: A Practical Guide , Morgan Kaufmann, 1998. Norway, August-September 2005.
Whang, K. [1985] “Query Optimization in Office By VLDB [2006] Proc. 32nd International Conference on Very
Example,” IBM Research Report RC 11571, December Large Data Bases, Dayal, U. et al., eds., Seoul, Korea,
September 2006. Whang, K., and Navathe, S. [1987] “An Extended VLDB [2007] Proc. 33rd International Conference on Very
Disjunctive Normal Form Approach for Processing Large Data Bases, Koch, C. et al., eds., Vienna, Austria,
Recursive Logic Queries in Loosely Coupled
Bibliography 1131
Whang, K., and Navathe, S. [1992] “Integrating Expert Wong, E. [1983] “Dynamic Rematerialization: Processing Systems with Database Management Systems—an
Distributed Queries Using Redundant Data,” TSE, 9:3, Extended Disjunctive Normal Form Approach,”
May 1983.
Information Sciences , 64, March 1992. Wong, E., and Youssefi, K. [1976] “Decomposition—A Whang, K., Malhotra, A., Sockut, G., and Burns, L. [1990]
Strategy for Query Processing,” TODS, 1:3, September “Supporting Universal Quantification in a Two-
Dimensional Database Query Language,” in ICDE Wong, H. [1984] “Micro and Macro Statistical/Scientific [1990].
Database Management,” in ICDE [1984]. Whang, K., Wiederhold, G., and Sagalowicz, D. [1982]
Wood, J., and Silver, D. [1989] Joint Application Design: “Physical Design of Network Model Databases Using
How to Design Quality Systems in 40% Less Time , the Property of Separability,” in VLDB [1982].
Wiley, 1989.
Widom, J., “Research Problems in Data Warehousing,” Worboys, M., Duckham, M. [2004] GIS – A Computing CIKM, November 1995.
Perspective , 2nd ed., CRC Press, 2004. Widom, J., and Ceri, S. [1996] Active Database Systems,
Wright, A., Carothers, A., and Campbell, H. [2002]. “Gene- Morgan Kaufmann, 1996.
environment interactions the BioBank UK study,” Widom, J., and Finkelstein, S. [1990] “Set Oriented
Pharmacogenomics Journal , 2002, pp. 75–82. Production Rules in Relational Database Systems,” in
Wu, X., and Ichikawa, T. [1992] “KDA: A Knowledge- SIGMOD [1990].
based Database Assistant with a Query Guiding Wiederhold, G. [1984] “Knowledge and Database
Facility,” TKDE 4:5, October 1992. Management,” IEEE Software, January 1984.
www.oracle.com/ocom/groups/public/@ocompublic/ Wiederhold, G. [1987] File Organization for Database
documents/webcontent/039544.pdf. Design , McGraw-Hill, 1987.
Xie, I. [2008] Interactive Information Retrieval in Digital Wiederhold, G. [1995] “Digital Libraries, Value, and
Environments , IGI Publishing, Hershey, PA, 2008. Productivity,” CACM, April 1995.
Xie, W. [2005] “Supporting Distributed Transaction Wiederhold, G., and Elmasri, R. [1979] “The Structural
Processing Over Mobile and Heterogeneous Model for Database Design,” in ER Conference
Platforms,” Ph.D. dissertation, Georgia Tech, 2005. [1979].
Xie, W., Navathe, S., Prasad, S. [2003] “Supporting QoS- Wiederhold, G., Beetem, A., and Short, G. [1982] “A
Aware Transaction in the Middleware for a System of Database Approach to Communication in VLSI Design,”
Mobile Devices (SyD),” in Proc. 1st Int. Workshop on
IEEE Transactions on Computer-Aided Design of
Mobile Distributed Computing in ICDCS ’03, Integrated Circuits and Systems , 1:2, April 1982.
Providence, RI, May 2003.
Wilkinson, K., Lyngbaek, P., and Hasan, W. [1990] “The XML (2005): www.w3.org/XML/. IRIS Architecture and Implementation,” TKDE, 2:1,
Yannakakis, Y. [1984] “Serializability by Locking,” JACM, March 1990.
Willshire, M. [1991] “How Spacey Can They Get? Space Yao, S. [1979] “Optimization of Query Evaluation Overhead for Storage and Indexing with Object-
Algorithms,” TODS, 4:2, June 1979. Oriented Databases,” in ICDE [1991].
Yao, S., ed. [1985] Principles of Database Design, Vol. 1: Wilson, B., and Navathe, S. [1986] “An Analytical
Logical Organizations , Prentice-Hall, 1985. Framework for Limited Redesign of Distributed
Yee, K.-P. et al. [2003] “Faceted metadata for image search Databases,” Proc. Sixth Advanced Database Symposium,
and browsing,” Proc.ACM CHI 2003 (Conference on Tokyo, August 1986.
Human Factors in Computing Systems), Ft. Lauderdale, Wiorkowski, G., and Kull, D. [1992] DB2: Design and
FL, pp. 401–408.
Development Guide , 3rd ed., Addison-Wesley, 1992. Yee, W. et al. [2002] “Efficient Data Allocation over Wirth, N. [1985] Algorithms and Data Structures,
Multiple Channels at Broadcast Servers,” IEEE Prentice-Hall, 1985.
Transactions on Computers, Special Issue on Mobility Witten, I. H., Bell, T. C., and Moffat, A. [1994] Managing
and Databases, 51:10, 2002.
Gigabytes: Compressing and Indexing Documents
Yee, W., Donahoo, M., and Navathe, S. [2001] “Scaling and Images, Wiley, 1994.
Replica Maintenance in Intermittently Synchronized Wolfson, O. Chamberlain, S., Kalpakis, K., and Yesha, Y.
Databases,” in CIKM, 2001. [2001] “Modeling Moving Objects for Location Based
Yoshitaka, A., and Ichikawa, K. [1999] “A Survey on Services,” NSF Workshop on Infrastructure for Mobile
Content-Based Retrieval for Multimedia Databases,”
1132 Bibliography
Youssefi, K. and Wong, E. [1979] “Query Processing in a Zhang, T., Ramakrishnan, R., and Livny, M. [1996] “Birch: Relational Database Management System,” in VLDB
An Efficient Data Clustering Method for Very Large [1979].
Databases,” in SIGMOD [1996]. Zadeh, L. [1983] “The Role of Fuzzy Logic in the
Zhao, R., and Grosky, W. [2002] “Bridging the Semantic Management of Uncertainty in Expert Systems,” in
Gap in Image Retrieval,” in Distributed Multimedia Fuzzy Sets and Systems , 11, North-Holland, 1983.
Databases: Techniques and Applications (Shih, T. K., Zaniolo, C. [1976] “Analysis and Design of Relational
ed.), Idea Publishing, 2002. Schemata for Database Systems,” Ph.D. dissertation,
Zhou, X., and Pu, P. [2002] “Visual and Multimedia University of California, Los Angeles, 1976.
Information Management,” Proc. Sixth Working Conf. Zaniolo, C. [1988] “Design and Implementation of a Logic
on Visual Database Systems, Zhou, X., and Pu, P. (eds.), Based Language for Data Intensive Applications,”
Brisbane Australia, IFIP Conference Proceedings 216, ICLP/SLP 1988, pp. 1666–1687.
Kluwer, 2002.
Zaniolo, C. [1990] “Deductive Databases: Theory meets Zicari, R. [1991] “A Framework for Schema Updates in an Practice,” in EDBT,1990, pp. 1–15.
Object-Oriented Database System,” in ICDE [1991]. Zaniolo, C. et al. [1986] “Object-Oriented Database
Zloof, M. [1975] “Query by Example,” NCC, AFIPS, 44, Systems and Knowledge Systems,” in EDS [1984].
Zaniolo, C. et al. [1997] Advanced Database Systems, Zloof, M. [1982] “Office By Example: A Business Language Morgan Kaufmann, 1997.
That Unifies Data, Word Processing, and Electronic Zantinge, D., and Adriaans, P. [1996] Managing Client
Mail,” IBM Systems Journal, 21:3, 1982. Server, Addison-Wesley, 1996.
Zobel, J., Moffat, A., and Sacks-Davis, R. [1992] “An Zave, P. [1997] “Classification of Research Efforts in
Efficient Indexing Technique for Full-Text Database
Requirements Engineering,” ACM Computing
Systems,” in VLDB [1992].
Surveys , 29:4, December 1997. Zvieli, A. [1986] “A Fuzzy Relational Calculus,” in EDS Zeiler, Michael. [1999] Modeling Our World—The ESRI
Guide to Geodatabase Design , 1999.
Index
* (asterisk), for retrieving all attrib-
triggers specifying, 933 ute values of selected tuples,
restricting unauthorized access,
Active state, transactions, 752 102–103
Active transaction, in recovery * (wildcard symbol)
row-level access control, 852–853
process, 812 types of queries in IR systems,
security control measures, 837
Activity diagrams, UML, 334 1008–1009
user authorization and, 841
Actuators, on hard disks, 591 using with XPath, 433
in XML, 853–854
Acyclic graphs (hierarchies), in . (concatenate operator), in PHP,
Access matrix model, for discre-
object data models, 50 485
tionary privileges, 843
Ad-hoc querying, 1075 || (concatenate operator), in SQL,
Access methods, file organization
Adleman, Len, 865 105
and, 601
Administration, of data warehous- 1NF (first normal form), 65,
Access mode, SQL transactions, 770
ing, 1080–1081 519–523
Access paths
Advanced Encryption Standard 2NF (Second normal form)
classifying DBMSs by, 50
(AES), 863 general definition of, 526–527
in physical data models, 31
AES (Advanced Encryption overview of, 523
Access structures, 631. See also
Standard), 863 2PC (two-phase commit) protocol
Indexes
AFIM (after image), in data item recovery in multidatabase sys-
Accounts
updates, 810–811 tems, 825–826
assigning privileges at account
After triggers, 938 transaction management in dis-
level, 842–843
Agent-based approach, to Web tributed databases, 908
DBAs assigning account numbers,
content analysis, 1024–1025 3NF (third normal form). See Third
Aggregate functions normal form (3NF)
ACID (atomicity, consistency, isola-
collection operators in OQL, 3PC (three-phase commit) protocol,
tion, durability) properties, of
transactions, 754–755
grouping and, 166–168 4NF (fourth normal form). See
Action component, of triggers, 133
implementing aggregate opera- Fourth normal form (4NF)
Actions, in ECA model
tions, 698–699 5NF (fifth normal form), 534–535
defined, 933–934
query processing and optimizing, Aborted transactions
in STARBURST example, 940
698–699 recovery process and, 812
Activate command, in active data-
in relational algebra, 146 types of transactions, 750
base systems, 938
in SQL, 124–126 Abstraction
Activation, in sequence diagrams,
in tuple relational calculus, aggregation and, 269
182–183 association and, 270
Active database systems
Aggregation concepts in semantic data models,
creating triggers in SQL, 111
as abstraction concept, 269–271 268
design and implementation issues
in QBE (Query-By-Example), identification and, 269
with, 937–940
1095–1098 Access control
generalized model for, 933–937
temporal, 957 database security, 839–840
inferencing and actions using
in UML class diagrams, 227 MAC (mandatory access control),
rules, 21
overview of, 932
Algebra
transformation rules for relational mandatory vs. discretionary,
potential applications of, 942–943
algebra operations, 706–708 850–851
statement-level active rules in
translating SQL queries into rela- policies for e-commerce and Web,
STARBURST example, 940–942
tional algebra, 681–682 854–855
technology of, 3
Algorithms RBAC (role-based access control),
triggers and, 132, 942–943
Apriori, 1041–1042 851–852
Active rules
overview of, 931
ARIES recovery, 821–825
1134 Index
deadlock prevention, 786–787
federated databases and, 886 decision tree induction,
example of fragmentation, alloca-
middle tier in three-tier architec- 1052–1054
tion, and replication, 898–901
ture, 48 for ER-to-Relational mapping,
Allocation schema, of databases, 896
Applications, database 286–287
ALTER command, 138–139
in active database systems, FP-growth, 1045–1047
ALTER TABLE command, 90, 92,
942–943 FP-tree (frequent-pattern tree),
application program accessing 1043–1045
American National Standards
databases, 6 genetic algorithms (GAs), 1059
Institute (ANSI), 88
as canned transactions, 449 heuristic algebraic optimization,
Analysis phase, of ARIES recovery
designing, 199, 310 708–709
algorithm, 823
environment, 43–44 HITS ranking, 1021–1022
Analytical components, of design
ER modeling for, 245 k-means clustering, 1055–1056
tools, 344
extending capabilities of, 24–26 PageRank algorithm, 1021
Anchor record (block anchor), 633
flexibility provided by relational partition, 1047
Anchor text
databases, 23–24 public (asymmetric) key, 863–865
browsing and, 999
life cycle of, 308–309 recovery, 818–819
hyperlink component, 1020
object-oriented, 24 sampling algorithm, 1042
AND , OR , NOT connectives
software programs implementing, for set operations, 697–698
for complex conditions in QBE,
spatial data and, 964–965 Algorithms, file related
symmetric key algorithms, 863
in formulas, 176
testing, 199 binary search on ordering key of
AND and OR operators in Prolog
traditional, 3 disk file, 603
languages, 972
using hierarchical and network hashing, 608
in three-valued logic, 116–117
systems, 23 search procedure for linear hash-
Annotations, XML schema lan-
Apriori algorithm, 1041–1042 ing, 616
guage, 429
Architecture, database Algorithms, indexing
Anomalies, avoiding redundant
centralized architecture, 44 B+-tree searches, 655–656
information in tuples, 507–509
client/server architecture, 44–46 searching nondense multilevel
ANSI (American National Standards
three-tier and n-iter architectures primary index, 646
Institute), 88
for Web applications, 47–49 Algorithms, normalization
Antimonotonicity property
two-tier client/server architecture, closure of X under F, 548
Apriori algorithm using,
46–47 dependency preservation and
Architecture, distributed database nonadditive join decomposi-
association rules, 1041
federated database schema, tion into 3NF, 560–563
API (application programming
890–891 dependency preservation into
interface)
parallel vs. distributed architec- 3NF, 558–559
client-side API for calling
ture, 887–888 for finding a key of a relation, 551
DBMSs, 47
pure distributed databases, for minimal sets of functional
for data mining, 1061
889–890 dependencies, 550
for database programming, 449
three-tier client/server architec- nonadditive join decomposition
Append-only databases, 953
ture, 892–894 into 4NF, 570
Application-based constraints, 68
Architecture, of Oracle Label nonadditive join decomposition
Application conversion, in database
Security, 869 into BCNF, 559–560
application life cycle, 308
Archives, magnetic tape for, 593 problems with, 565–566
Application development
Arguments, in Prolog languages, 970 relational synthesis into 3NF with
advantages of distributed data-
ARIES recovery algorithm, 821–825 dependency preservation and
bases for, 882
Arithmetic nonadditive join property,
database approach reducing
functions and procedures, 560–562
development time, 22
572–574 summary of, 567
DBMS tools for, 44
operators in SQL, 105–106 testing for nonadditive join prop-
Application layer (business logic), in
Armstrong’s inference rules, 548 erty, 554–555
three-tier client/server architec-
ture, 892–893
Arrays
Aliases, in SQL, 101–102
constructor, 359 Allen’s algebra, 955
Application programmers, 16
Application programs, 449
creating UDTs, 373
Index 1135
Authentication Arrow notation, as alternative to dot
Arrays of texels, 967
overview of, 176
SQL injection attack bypassing, notation, 382
truth values of, 184
Attribute data, GIS systems, 960
AS qualifier, for renaming attributes,
weakness of, 855 122
Attribute-defined specialization, of
Authority, hubs and, 1020 ASC keyword, for ascending order
superclass, 252
Authorization of query results, 107
Attribute-defined subclasses, 264
identifiers, 89, 842 Assertions
Attribute preservation condition, of
privileges, 874 relational schemas and, 66
a decomposition, 552
subsystem in DBMSs, 19 specifying constraints as, 74,
Attribute versioning, for incorporat-
Automated tools, for database 131–132
ing time in OODBs, 953–954
design, 342–346 Association rules
Attributes
Automatic analysis, of multimedia among hierarchies, 1047–1048
clear semantics for, 503–507
sources, 965 Apriori algorithm, 1041–1042
in data modeling, 31
Autonomy complications in, 1050–1051
dealing with ambiguous names in
degree of local autonomy for example of, 1037
SQL, 100–101
DDMBS software, 884 form of, 1040
HTML tags, 419
in distributed databases, 881 FP-growth algorithms, 1045–1047
in ODMG object model, 386
in federated databases, 886–887 FP-tree (frequent-pattern tree)
prime and nonprime, 519, 526
transparency as complement to, algorithm, 1043–1045
relationships and, 214, 218
renaming, 122
multidimensional associations,
Availability 1048–1049
retrieving all values of selected
of data, 840–841 negative associations, 1049–1050
tuples, 102–103
in distributed databases, 881–882 overview of, 1039–1041
semantics of, 503–507, 514
loss of, as security threat, 836 Partition algorithm, 1047
specifying attribute constraints in
of up-to-date information, 22 in pattern discovery phase of Web
SQL, 94–95
AVERAGE function usage analysis, 1026
subsets of, 68–69
grouping and, 166–168 Sampling algorithm, 1042
of superclass, 252
implementing, 698 Associations, 269–271
symbols for, 1084
Average precision, measures of rele- autonomy in federated databases,
time conditions and, 956
vance in I, 1017 887
time-varying and nontime-
AVG function, in SQL, 124–125 ER relationships compared with,
varying, 953
Axes, of XPath expressions, 433 227
in UML class diagrams, 227
Axioms, in deductive databases, 975 spatial, 963
XML documents, 420
B-link tree, 800 Associative arrays, PHP, 487
Attributes, in ER model
complex, 206–207
B-trees
Asterisk (*), for retrieving all attrib-
file organization and, 617 ute values of selected tuples,
composite vs. simple, 205–206
overview of, 649–652 102–103
constraints on, 208–209
variations on, 660 Asymmetric (public) key algo-
NULL values, 206
overview of, 203–205
B+-trees
algorithms for searches with, Atom constructors, 358
rithms, 863–865
single-valued vs. multivalued, 206
655–656 Atomic domains, in relational
stored vs. derived, 206
cost functions of selection, 714 model, 61
value sets (domains) of, 209–210
decision making in database Atomic formulas, in Datalog lan-
Attributes, in relational model
design, 730 guage, 973
defined, 61
methods for simple selection, 686 Atomic literals, 378
relation schema and, 62
overview of, 652–655 Atomic objects
Attributes (indexing fields)
search, insertion, deletion with, object lifetime and, 378
deciding whether to index, 730
655–660 in ODMG object model, 386–388
ordered index on multiple, 661
variations on, 660 Atomic values
records and, 631
Bachman diagrams, 1084–1085 1NF and, 519
secondary indexes, 636
Back-ends, database, 25 in tuples, 65
single-level indexes, 632
Backflushing data, in data ware- Atomicity property, of transactions,
Audio clips, in multimedia data-
houses, 1076 14, 754–755
bases, 932, 965
Audio data sources, in multimedia
Backup and recovery. See also
1136 Index
DBMS component modules, 42
Boolean model, for information magnetic tape for, 592
degree of relationship, 213
retrieval, 1002–1003 recovering from catastrophic
mapping EER schema to ODB
Boolean queries, in information failure, 826–827
schema, 397
retrieval systems, 1007–1008 Backup sites, for distributed data-
mapping ER-to-Relational data
Bottom-tier database server, PHP, base, 910–911
models, 289–291
482 Backup utility, 43
Binary representation, of hashing
Bottom-up approach Bag constructor, 359
function, 612
in relational database design, 502, Bag (multiset), of tuples, 103–105,
Binary searches
cost functions for, 713
for schema design, 316 Base classes, 265
files, 603
Bottom-up conceptual synthesis, Base tables
methods for simple selection, 686
257 specifying, 90
Binary trees, 718
Boyce-Codd normal form (BCNF) views and, 133
Bind variables (parameterized state-
nonadditive join decomposition BCNF (Boyce-Codd normal form)
ments), protecting against SQL
into, 559–560 nonadditive join decomposition
injection, 858
overview of, 529–531 into, 559–560
Bindings
Browsing. See also Web browsers overview of, 529–531
early and late binding in ODMS,
interfaces, 38 Before triggers, in active database
modes of interaction in IR sys- systems, 938
impedance mismatch and, 450
tems, 999 Begin transaction, transaction types,
to OOPLs, 376, 407
Buckets, of disk blocks, 609 745
Bit-level data striping, RAID and,
Buffer management BEGIN_TRANSACTION operation,
DBMS component modules, 40 751
Bit-string data types, in SQL, 92–93
storage and, 593–594 Behavioral diagrams, UML, 329
Bitemporal databases, 946, 950
Bitemporal time relations, 950–952
Buffers
Behaviors
address of, 590 of database applications, 30
Bitmap indexes
DBMS buffer space, 683 in ODMG object model, 382
for B+-tree leaf nodes, 666
in DBMSs, 19 Bell-LaPadula model, 847
in multidimensional data models,
performance of nested-loop joins Best Match 25 (BM25), 1006
and, 690 BFIM (before image), in data item
overview of, 663–666
Bulk transfer rate (btr) updates, 810–811
Bits, of data, 588
as disk parameter, 1088 Bfr. See Blocking factor (bfr)
Blind writes, 768
for hard disks, 592 Bidirectional associations, in UML
BLOBs (binary large objects), 595
Business metadata, in data ware- class diagrams, 227
Block-level striping, RAID, 620
housing, 1078 Binary associations, in UML class
Block size, as disk parameter, 1088
Business rules diagrams, 227
Block transfer time (btt)
applications for active databases, Binary balanced strategy, for view
as disk parameter, 1088
943 integration process, 319
for hard disks, 591
integrity constraints in databases, Binary decompositions, 553–556
Blocking factor (bfr)
for files, 597
Binary ladder integration strategy,
relational model constraints, 68 for view integration process,
multilevel indexes and, 643
Bytes, of data, 588 319
in query cost estimation, 712
C language Binary large objects (BLOBs), 595
Blocking records, 597
embedded SQL and, 451–452 Binary relational operations
Blocks of data
as host language in SQL/CLI, DIVISION operation, 162–163
allocation on disk, 598
464–468 EQUIJOIN and NATURAL JOIN
buffer management and, 593–594
PHP interpreter written in, 482 operations, 159–161
pointers and, 597
C++ language binding, in ODMG, JOIN operation, 157–158
in query cost estimation, 712
407–408 overview of, 146
sequential order for accessing, 592
Cache memory, 585 Binary relationships
BM25 (Best Match 25), 1006
Body, HTML, 419
Caching
choosing between binary and
database cache, 746 ternary relationships, 228–231
Boolean conditions, in tuple rela-
in database recovery, 809–810 comparing RDB design with
tional calculus, 176–177
Boolean data types
in DBMSs, 19
Index 1137
in deductive database systems, time series data and, 957
temporal databases and, 945–947
Chaining, for collision resolution,
974–975 Call statement, SQL, 475
Clauses, in simple SQL queries, 107 Candidate keys
Character-string data types, in SQL,
92 Clearance, in mandatory access con- database design and, 729
trol, 848 defined, 519
CHECK clauses
Client computers functional dependency and, 514
restricting attribute or domain
accessing specialized servers, 45 relational model constraints, 69
values with, 94–95
DBMS access and, 42 Canned transactions, 15
specifying constraints on tuples, 97
Client module, DBMS, 29 Cardinality
Checkpoints
Client (presentation) layer, three-tier of domains, 63
in ARIES recovery algorithm, 822
client/server architecture, 892 selection cardinality, 712
in database recovery, 812–813
Client programs, 42, 451 Cardinality ratio
Chicken feet notation, 1085
Client/server architecture for binary relationship, 216–217
Child nodes, of tree structures, 646
for DBMSs, 44–46 notation for, 1084–1085
Chronon, in temporal databases, 945
three-tier client/server architec- Cartesian product, 63
Ciphertext, 862, 864. See also
ture, 892–894 CARTESIAN PRODUCT operation
Encryption
two-tier client/server architecture, algorithms for, 697–698
Class diagrams
46–47 in relational algebra, 155–157
ER diagrams compared with, 200
Client tier, PHP, 482 Cartridge, Oracle, 931
notation of, 226–228
UML and, 329–330
Clients
Cascade option, in delete operation,
Class hierarchies. See Type (class)
client level in two-tier client/serv-
er architecture, 47 Cascadeless (avoid cascading roll-
77 hierarchies
client program calling database back), of transactions, 759
Class properties, in knowledge
server, 451 Cascading rollback (or cascading
representation, 268
in client/server architecture, 46 abort)
Class/subclass relationships, 247,
Close operation, files, 600 in database recovery, 813–815
The closed world assumption, 66 timestamp ordering and, 790
Classes
Closure of X under F, 548 of transactions, 758
built-in to ODMG object model,
Cloud computing, 914–915 CASE (computer aided software
Clustered file, 606, 636 engineering), 1083
compared with entities, 227
Clustering Case, text preprocessing in informa-
in EER model, 264
concept hierarchies and, 1024 tion retrieval, 1011
names, in UML class diagrams,
data mining and, 1054–1055 Catalogs
k-means clustering algorithm, catalog information used in cost
in object data models, 50
1055–1056 functions, 712–713
security classes in mandatory
knowledge discovery and, 1039 DBMS, 10–11
access control, 847
in pattern discovery phase of Web SQL, 90
type definitions and operation
usage analysis, 1026–1027 transaction management in
definitions, 361–362
spatial, 964 distributed databases, 913
Classification
Clustering field, 635 Catastrophic failure, database recov-
classification trees in data mining,
Clustering indexes ery techniques for, 826–827
cost functions for SELECT opera- Categories, in EER
concept hierarchies and, 1024
tions, 713–714 defined, 265
data mining and, 1051–1054
decision making in database modeling, 258–260
faceted classification scheme,
design, 730 Categorization, in agent-based
implementing aggregate opera- approach to Web content
goals of data mining, 1038
tions, 699 analysis, 1024
knowledge discovery and, 1039
methods for simple selection, 686 Cautious waiting algorithm, for
in mandatory access control, 848
overview of, 635–636 deadlock prevention, 787
overview of, 268
tables comparing index types, 642 Centralized catalogs, 913
in pattern discovery phase of Web
types of ordered indexes, 632 Centralized DBMSs, 44, 49
usage analysis, 1027
Clusters, on hard disks, 591 Centralized (one shot) schema
spatial, 963
Coalescing, of time periods, 956 design approach, 315
Classification attributes, in manda-
tory access control, 848
Codd, Ted, 59
1138 Index
Code injection, SQL injection
of databases, 9 attacks, 856
Compatibility, object-oriented data-
high-level, 200–202 Collaborative social searches, 1029
bases and, 19
initial conceptual design for Collection literals, 382
Complete horizontal fragmentation,
COMPANY database example, Collection (multivalued) construc-
in distributed databases, 895
210–211 tors, 359
Complete schedule, transactions,
Rational Rose modeling using Collection objects, built-in to
UML notation, 339–340 ODMG object model, 383
Complete vertical fragmentation, in
refining conceptual design for Collection operators, OQL, 403–405
distributed databases, 896
COMPANY database example, Collections
Completeness (totalness) constraint,
220–221 creating UDTs, 373
synchronizing with actual data- extracting single elements from,
Complex attributes, in ER model,
base, 341 403
Conceptual (logical) level, goodness persistent, 363, 367
Complex data relationships, in data-
of relation schemas and, 501 transient, 367
bases, 20
Conceptual representation of data, Collisions, hashing and, 608–609
Complex structures
in DBMS, 12 Colocation rules, spatial, 964
attribute versioning and, 953
Conceptual schema Color, automatic analysis of images,
objects and, 355
database design and, 201 967
UDT (user-defined types) and,
in three-schema architecture, 34 Column-based storage, of relations,
Conceptual schema design, 313–321 669–670
Complex types
approaches to, 314–315 Columns, in SQL, 89. See also
for objects and literals, 358–360
high-level data model used for, Attributes
specifying structures in XML
313–314 Commercial tools, for data mining,
schema using, 430
identifying correspondences and 1060–1062
Component modules, DBMS, 40–42
conflicts among schemas, Commercial value, of Web searches,
Component schema, in federated
database architecture, 891
schema (view) integration, Commit point, of transactions, 754
Component values, of tuples, 67
316–317, 319–321 Committed projection, of transac-
Components diagrams, UML, 330
strategies, 315–316 tion schedule, 757
Composite attributes
Conceptualization, 272 Committed state, of transactions,
in ER model, 205–207
Concurrency control 752
mapping from EER schema to
DBMS component modules, 42 Committed transactions
ODB schema, 397
distributed control based on dis- commit point and, 754
XML schema language, 430
tinguished copy of data item, issues with distributed commit,
Composite indexes, 714
Composite keys, 661
distributed control based on vot- recovery process and, 812
Composite (molecular) objects, 270
ing, 912 types of transaction, 750
Computational interpretation, of
protocols, 777 COMMIT_TRANSACTION operation,
rules in deductive databases,
reasons for aborting transactions, 752
751 Communication autonomy
Computer aided software engineer-
serializability used for, 765–768 in distributed databases, 881
ing (CASE), 1083
software, 13 in federated databases, 886
Computer failure (system crash),
transaction issues handled by, Communication costs, in query exe-
recovery needed due to, 750
747–750 cution, 711
Concatenate operator (.), in PHP,
transaction management in Communication facilities, DBMS,
distributed databases, 909–910 43–44
Concatenate operator (||), in SQL,
Concurrency control techniques Communication links, failure in
basic timestamp ordering, distributed databases, 910
Concept hierarchies, in Web content
789–790 Communication software, 44
analysis, 1024
bibliographic references, Communication variables, SQL, 454
Conceptual data models, 30
804–805 Comparison operators
Conceptual database design phase,
binary locks, 778–780 applying to domains of ordered
conversion of locks, 782 values, 148
Conceptual design
comparing RDB design with
deadlock detection, 787–788
Index 1139
granularity level in locking,
specifying with CREATE TABLE 795–796
Conjunctive selection, cost functions
command, 90, 92 insertion, deletion, and phantom
for SELECT , 714
Constructing databases records, 800–801
Connecting fields, for relationships
defined, 5 interactive transactions and, 801
between file records, 616
University student database latches, 802
Connection records, in SQL/CLI,
example, 7 locking used in indexes, 798–800
Constructor operations multiple granularity level locking,
Connections
factory objects providing, 388 796–798
opening database, 451
objects, 362 multiversion concurrency control,
PHP connecting to databases,
Constructs, PHP, 485–486 791–793
Content-based retrieval, in queries, overview of, 777–778
SQL command for connecting to
965 serializability guaranteed by two-
database, 453
Content-encryption algorithms, 863 phase locking, 782–784
Conservative two-phase locking, 784
Continuous allocation, file blocks shared/exclusive (read/write)
Consistency property, transaction
on disk, 597 locks, 780–782
properties, 754–755
Control measures, database security, starvation, 788
Constant nodes
837–838 strict timestamp ordering,
notation for query trees and
Conversational searches (CS), 790–791
query graphs, 703
1029–1030 summary and exercises, 802–804
in query graphs, 179
Core specification, SQL, 88 Thomas’s write rule, 791
Constant values, in Prolog
Correlated nested queries, in SQL, two-phase locking, 778
languages, 971
119–120 validation (optimistic) concur-
Constrained write assumption, 768
Cost-based query optimization rency control, 794–795
Constraint specification language,
74 catalog information used in, variations on two-phase locking,
Constraints
example, 719–721 Concurrent use, of database system,
on binary relationships, 216–218
JOIN and, 715–718 744
on binary relationships and terna-
overview of, 711–712 Condition box, in Query-By-
ry relationships, 232
SELECT and, 713–715 Example, 1093
database design and, 310
systematically estimating costs of Condition-defined subclasses, 252,
domain constraints, 68
query trees, 681 264
on extents corresponding to type
Costs, in choosing a DBMS, 323 Condition markers, in sequence
hierarchies, 366
COUNT function, SQL diagrams, 332
in federated databases, 885
aggregate functions in SQL, Conditions, as component of
inclusion dependencies and, 571
124–125 triggers, 133
integrity, referential integrity, and
grouping and, 166–167 Conditions (formulas). See
foreign keys, 73–74
implementing, 698 Formulas
key constraints and NULL value
Covert channels Conditions, in ECA model
constraints, 68–70
flow control and, 861–862 defined, 933–934
notation of max/min values,
in mandatory access control, 850 in STARBURST example, 940
Crawlers Confidence, of association rules, 1040
other types of, 74–75
overview of, 999 Confidentiality, loss of, 836
relational model and, 67–68
Web crawlers, 1028 Conflict equivalence, of transaction
on specialization and generaliza-
CREATE ASSERTION command, schedules, 762
tion, 251–254
131–132 Conflict serializable
state constraints vs. transition
CREATE command, 89 testing conflict serializability of
constraints, 75
CREATE INDEX command, 110–111 schedules, 763–765
Constraints, in SQL
CREATE SCHEMA command, 89 transaction schedules, 763
CHECK clauses for specifying on
CREATE TABLE command Conflict set, rule consideration and,
tuples, 97
CHECK clauses for specifying 942
naming, 96–97
constraints on tuples, 97 Conflicts, in transaction schedules,
specifying as assertions, 131–132
clauses for keys and referential 756–757
specifying attribute constraints
integrity constraints in, 95 Conjunctive conditions, SELECT
and default values, 94–95
specifying key and referential
SQL (Structured Query
1140 Index
CREATE TRIGGER command,
negative associations, 1049–1050 132–133, 936
Data content, database design and,
neural networks in, 1058 CREATE VIEW command, 90,
overview of, 1035–1036 134–135
Data cubes (hypercubes),
as part of knowledge discovery Credentials, access control via,
process, 1036–1037 854–855
Data definition
Partition algorithm, 1047 CRM (Customer Relationship
in QBE, 1098
pattern discovery in, 1057 Management), 26
in SQL, 89
regression in, 1057–1058 CROSS JOIN operation. See
Data definition language. See DDL
Sampling algorithm, 1042 CARTESIAN PRODUCT
(data definition language)
spatial, 963–964 operation
Data dependencies, relational model
specialized database applications, CROSS PRODUCT operation.
constraints, 68
Data dictionaries (or data repository)
summary and exercises, 1063–1065 operation
See CARTESIAN PRODUCT
DBMS tools, 43
types of knowledge discovered CS (Conversational searches),
organizations using, 306
during, 1038–1039 1029–1030
Data-driven design, 310
Data model mapping Current directory, 820
Data elements, storing XML docu-
automated tools for database Current relation state, 63
ment as, 431
design, 344 Cursors
Data encryption. See Encryption
database design and, 202 for looping over tuples in a query
Data Encryption Standard (DES),
as design phase, 311 result, 450
logical database design, 326 options for declaring, 457
Data fragmentation. See
Data models retrieving multiple tuples using,
Fragmentation
categories of, 30–31 455–457
Data independence, in three-schema
classifying DBMSs by, 49–52 Customer Relationship
architecture, 35–36
converting object models to/from Management (CRM), 26
Data items
logical models, 341 Cycles, converting graph with cycles
dealing with multiple copies of,
data abstraction in, 12, 30 into hierarchical structure, 441
for data warehouses, 1070 Cylinders, on hard disks, 589
granularity of, 746, 795
ER model. See ER (Entity- DAC (discretionary access control),
updates, 810–811
Relationship) model 850–851
Data labels, combining with user
in federated databases, 885 Dangling tuples, problems in rela-
labels, 869–870
functional, 214 tional design, 563–565
Data manipulation language. See
hierarchical for XML. See Data
DML (data manipulation
Hierarchical data models, for data quality as issue in database
language)
XML security, 867
Data marts, 1070
inherent rules of, 21 definition of, 4
Data mining
mapping EER to relational. See insulation between programs and,
applications of, 1060
EER-to-Relational mapping 11–13
Apriori algorithm, 1041–1042
mapping ER-to-Relational. See multiple views of, 13
association rules among hierar-
ER-to-Relational mapping normalization of, 517
chies, 1047–1048
network. See Network data mod- sensitivity of, 840–841
association rules and, 1039–1041
bibliographic references,
els
types of data in information
object. See Object data models retrieval, 996
Rational Rose, 338–342 Data abstraction
classification and, 1051–1054
semantic, 267–268 data models and, 30
clustering and, 1054–1056
Data models, enhanced, 931–932 in EER (Enhanced Entity-
commercial tools for, 1060–1062
active databases. See Active data- Relationship) model, 267–268
complications in mining associa-
base systems insulation between programs and
tion rules, 1050–1051
bibliographic references, 989–991 data, 12–13
vs. data warehousing, 1036
deductive database systems. See relational databases and, 23–24
FP-growth algorithms, 1045–1047
Deductive database systems Data allocation. See Allocation
FP-tree (frequent-pattern tree)
multimedia databases. See Data blade, Informix, 931
algorithm, 1043–1045
Multimedia databases Data blocks. See Blocks of data
genetic algorithms (GAs), 1059
goals of, 1037–1038
spatial databases. See Spatial
Index 1141
temporal databases. See Temporal
system implementation and tun- databases
types of databases, 3
ing, 327–328 Data normalization, 18
views compared with, 1079–1080
transaction design, 322–323 Data organization, transparency of,
Database administrators. See DBAs
UML as design specification 880
(database administrators)
standard, 328 Data provenance, 306
Database applications. See
UML diagram types, 329–334 Data records, in University database
Applications, database
UML for database application example, 6
Database architectures. See
design, 329 Data replication. See Replication
Architecture, database
University student database Data requirements, database design
Database back-ends, 25
example, 334–337 and, 200
Database-based approach, to Web
Database designers Data servers, in two-tier client/
content analysis, 1025
database actors on the scene, 15 server architecture, 47
Database cache, DBMS, 746
design and testing of applications, Data sources
Database design
conceptual design choices, 222,
accessing with Java programs, 469
Database fingerprinting, 857 databases as, 415
Database implementation. See Data striping, RAID, 618
in database application life cycle,
Implementation Data structure, database design and,
Database interfaces. See Interfaces 310
denormalization as design deci-
Database items, in transaction pro- Data sublanguage, DML as, 38
sion related to query speed,
cessing, 745–747 Data Surveyor, 1060
Database management systems. See Data transfer costs, for distributed
factors influencing physical data-
DBMSs (database management query processing, 902–904
base design, 727–729
systems) Data types
indexing decisions, 730–731
Database programming language. associated with record fields, 595
issues in active database systems,
See Programming languages atomic (user-defined), 386–388
Database recovery techniques class hierarchies. See Type (class)
practical. See Database design
ARIES recovery algorithm, hierarchies
methodology
821–825 common SQL, 92–94
relational. See Relational database
bibliographic references, 832 complex types, 358–360, 430
design
caching (buffering) disk blocks, constructors. See Type construc-
specialization and generalization
809–810 tors
choices, 263–264
catastrophic failure and, 826–827 domains and, 61
tuning, 735–736
checkpoints and fuzzy check- entity types. See Entity types
verification of, 345
points, 812–813 n-ary relationship types, 291–292
Database design methodology, 298
deferred update and immediate names and functions, 365
automated tools for, 342–346
update techniques, 808–809 PHP, 485–486
bibliographic references, 348–350
immediate update techniques, reference types, 373–374
choice of DBMS, 323–325
817–820 spatial types, 959–960
conceptual schema design,
in multidatabase systems, temporal types, 945
825–826 type-compatible relations, 697
data model mapping (logical
NO-UNDO/REDO recovery type generator, 358–359
database design), 326
based on deferred update, UNION types, 258–260
database application system life
815–817 in University database example, 7
cycle, 308–309
overview of, 807–808 value sets specified via, 209
implementation process and,
recovery in distributed databases, Data warehouses
909–910 bibliographic references, 1082
information system (IS) life cycle,
rollbacks, 813–815 building, 1075–1078
shadow paging, 820–821 characteristics of, 1069
organizational context for data-
steal/no-steal and force/no-force data mining compared with, 1036
base systems and, 304–307
techniques, 811–812 data modeling for, 1070
overview of, 303–304
summary and exercises, 827–832 difficulties with implementing,
physical database design, 326–327
system logs and, 808 1080–1081
Rational Rose for. See Rational
write-ahead logging, 810–812 functions of, 1078–1079
Rose
requirements collection and
Database schemas. See also Schema
1142 Index
sharing data and multiuser trans- relational. See Relational database
ontologies and, 272
Database state (snapshot), 32–33
actions, 13–14 design
Database storage reorganization,
storing/extracting XML docu- three-schema architecture. See
DBMS utilities, 43
ments from, 431–432, 442 Three-schema architecture
Database system environment
summary and exercises, 27–28 Database security
database system utilities, 42–43
unauthorized access restricted in, access control policies for e-
DBMS component modules,
18–19 commerce and Web, 854–855
University student database access control, user accounts, and
tools, application environments,
example, 6–9 audits, 839–840
and communication facilities,
when not to use DBMS, 26–27 bibliographic references, 874–875
workers behind the scene, 16–17 challenges in, 867–868
Databases, introduction to
Datalog language comparing mandatory access
actors on the scene, 14–16
clausal form and Horn clauses, control with discretionary
advantages of DBMS approach,
17 974–975 access control, 850–851
evaluating nonrecursive queries, control measures, 837–838
backup and recovery in, 20
981–983 covert channels, 861–862
bibliographic references, 28
notation, 970–973 DBAs (database administrators)
characteristics of database
programs and safety, 978–980 and, 838–839
approach, 9–10
as variation of Prolog language, DES and AES standards, 863
as collection of named data items,
970 digital certificates, 865–866
DATE data type, in SQL, 93, 945 digital signatures, 865
comparing with IR systems,
DB/DC system, DBMS tools, 44 discretionary privileges, 842–844
DBAs (database administrators) encryption, 862–863
complex data relationships in, 20
database actors on the scene, 15 flow control, 860–861
concurrent use of, 744
interface for, 40 granting/revoking privileges,
creation/conversion costs,
role in database security, 838–839 844–846
DBMSs (database management sys- information security vs. informa-
defined, 4
tems) tion privacy, 841–842
design, 9
accessible with PEAR DB, 492 label-based security and row-level
early applications using hierarchi-
advantages of, 17 access control, 852–853
cal and network systems, 23
backup and recovery in, 20 limits on propagation of privi-
extending application capabilities,
buffers in transaction processing, leges, 846–847
745–747 mandatory access control,
inferencing and actions using
cache, 683, 746, 809 847–850
rules, 21–22
Catalog, 10–11 Oracle Label Security, 868–870
information retrieval (IR) and, 26
centralized architecture, 44 overview of, 835
insulation between programs and
choosing for database design, privacy issues, 866–867
data, and data abstraction,
323–325 public (asymmetric) key algo-
classification of, 49–52 rithms, 863–865
integrity constraints in, 20–21
client/server architecture, 44–46 role-based access control,
interchanging data of Web using
component modules, 40–42 851–852
XML, 24
conceptual representation of data sensitivity of data and, 840–841
multiple user interfaces in, 20
in, 12 SQL injection attacks, 855–858
multiple views of data, 13
definition of, 5 statistical, 859–860
object-oriented, 24
interfaces, 38–40 summary and exercises, 870–874
other benefits and implications of
languages, 36–38 symmetric key algorithms, 863
using database approach, 22
lock manager subsystem in, 779 threats, 836–837
overview of, 3–6
modules, 29 types of security, 836
persistent storage of program
query processing and optimiza- XML access control, 853–854
objects, 19
tion module, 20 Database security and authorization
personal, 305
security and authorization sub- subsystem, DBMSs, 837
query processing in, 19–20
system, 19, 837 Database server layer, in three-tier
redundancy controlled in, 17–18
single-user vs. multiuser, 744–745 client/server architecture, 893
relational databases providing
data abstraction and applica-
SQL and, 87
Index 1143
Deferred update techniques system utilities, 42–43
system designers, 16
transparency in, 879–881
following no-steal approach, 811 tools, application environments,
types of, 883–885
NO-UNDO/REDO recovery, and communication facilities,
DDL (data definition language)
DBMS languages and, 37
overview of, 807–809 two-tier client/server architecture,
processing schema definitions, 40
Defining attribute, of specialization, 46–47
Rational Rose for DDL genera-
tion, 338
Defining databases DCT (Discrete Cosine Transform),
when not to use, 26–27
SQL as, 88
database state and, 33 966
Deactivate rule, in active database
overview of, 5 DDBMSs (Distributed DBMSs)
systems, 938
University student database architecture of, 889–891
Deadlocks
example, 6–7 classifying DBMSs by site distri-
detecting, 787–788
Defining predicate, of subclass, 252 bution, 49–50
in distributed databases, 910
Degree of homogeneity, of DDBMS defined, 878
preventing, 785–787
software, 884 degree of homogeneity of soft-
Debit-credit transactions, 769
Degree of local autonomy, of ware, 884
Decision-support systems (DSS),
DDBMS software, 884 DDBs (distributed databases)
Degree of relationship advantages of, 882
Decision tree induction algorithm,
in ER (Entity-Relationship) architecture of, 889–891
model, 213 autonomy of, 881
Decision trees, classification with,
greater than two, 228–232 bibliographic references, 924–927
in relational model, 62 catalog management, 913
Declarative assertions, 131
SELECT operator and, 149 cloud computing and, 914–915
Declarative expressions, in relational
DELETE command, SQL, 109, 936 concurrency control, 910–912
calculus, 174
Delete operation data fragmentation in, 894–896
Declarative languages
concurrency control techniques, data replication and allocation in,
DBMS languages, 38
deductive database systems and,
on files, 600 data transfer costs for distributed
relational data model operations, query processing, 902–904
SQL as, 88
77–78 defined, 878
Decomposition. See Properties of
Deletion anomalies, avoiding redun- example of fragmentation, alloca-
relational decompositions
dant information in tuples, 509 tion, and replication, 898–901
Decrement operator, SQL, 105
Deletion markers, file organization federated database management
Decryption algorithms, in public
and, 602 systems, 885–887
key schemes, 864
Denial of Service (DOS) attacks, functions of, 883
Deductive axioms, in deductive
855, 857 multiprocessor systems compared
databases, 975
Denormalization with, 879
Deductive database systems
defined, 18, 518 in Oracle, 915–919
clausal form and Horn clauses,
query speed and, 731–732 overview of, 877–878
Dense indexes, 633, 636 parallel vs. distributed architec-
Datalog notation, 973
Density-based clustering, 964 ture, 887–888
Datalog programs and safety of,
Dependency. See also Functional peer-to-peer database systems,
dependencies 915
evaluating nonrecursive Datalog
modeling in pattern discovery query processing, 901–902
queries, 981–983
phase of Web usage analysis, query processing using semijoin
interpretation of rules, 21, 975–977
1027 operation, 904
overview of, 970
predicate dependency graph, 982 query update and decomposition,
Prolog notation, 970–972
Dependency preservation property 905–907
relational operators, 980–981
decomposition into third normal recovery, 912–913
Deductive knowledge, discovered
form (3NF), 560–563 reliability and availability of, 881
during data mining, 1038
normal forms and, 518 summary and exercises, 919–924
Deductive rules. See Rules, in deduc-
overview of, 552–553 three-tier client/server architec-
tive databases
Deployment diagrams, UML, 330 ture, 892–894
Default values, of attributes in SQL,
Deployment, operation, and main-
14 Index
Derived attributes
Distribution transparency, 880, 894 in ER model, 206
Directories
DIT (Directory Information Tree), in functionality of data ware-
current and shadow, 820
online directories, 919–921
DIVISION operation, in relational Derived tables, SQL views, 89
houses, 1079
Directory Information Tree (DIT),
algebra, 162–163 DES (Data Encryption Standard),
DKNF (domain-key normal form), 863
Directory services, in distributed
574–575 DES keyword, for descending order
databases, 919–921
DML (data manipulation language) of query results, 107
Directory Services Markup
DBMS languages, 37 Descendant nodes, of tree struc-
Language (DSML), 855
precompilers and, 42 tures, 646
Dirty bits, in DBMS cache, 810
SQL as, 88 Description records, in SQL/CLI,
Dirty Page Table, in ARIES recovery
Document-centric XML documents, 464–468
algorithm, 822
Dirty reads, transaction support in
Document header, HTML, 419 Design autonomy
Descriptor elements, SQL, 89
SQL, 770
Document Object Model (DOM), in distributed databases, 881
Discrete Cosine Transform (DCT),
Document Type Definitions Design, database. See Database
in federated databases, 886–887
Discrete Fourier Transform (DFT),
(DTDs), 423, 425 design
Documentation, in XML schema Design phase, of information system
Discretionary access control (DAC),
language, 429 (IS) life cycle, 307
Documents Design transparency, in distributed
Discretionary privileges, 842–844
hypertext documents, 415 databases, 881
Discriminator key, in UML class
information retrieval from, 1014 Design verification, 345
diagrams, 228
in multimedia databases, 932, Desktop search engines, 996
Disjointness (disjointedness) con-
965–966 Destination page, as hyperlink
straint, 253, 264
Semantic Web and, 272 component, 1020
Disjoints, 895
SMART retrieval system, 998 Destructor operations, on objects,
Disjunctive selection conditions, 688
Documents, XML 362
Disk blocks (pages)
extracting from databases, Detached consideration, of rules in
on hard disks, 589
431–432, 442 active databases, 939
parameters, 1087–1089
publishing, 431 DFT (Discrete Fourier Transform),
Disk controllers, 591
types of, 422 966
Disk devices
well-formed and valid, 422–425 Diagnostic area size, transaction
hard drives, 591
DOM (Document Object Model), support in SQL, 770
hardware structures of, 588–592
placing file records on disk, 594
Diagrams
Domain-key normal form (DKNF), automated tools for database
as random access storage devices,
574–575 design, 343–344
Domain of knowledge, in ontolo- Class diagrams. See Class dia-
recovery needed due to failure of,
gies, 268 grams
Domain (relational) calculus, 183 ER diagrams. See ER diagrams
Disk packs, 589
Domain variables, 183 Schema diagram, 32
Disk speed, as disk parameter, 1088
Domains UML. See UML (Unified
Disk storage, cost components of
of attributes in UML class Modeling Language)
query execution, 711
diagrams, 227 Dictionary constructor, 359
Distance function, in image data-
cardinality of, 63 Digital certificates, 865–866
base queries, 966
constraints and, 68 Digital libraries, searchable Web
DISTINCT keyword, with SELECT
relation schema and, 62 documents in, 1018
command, 103
in relational model, 61 Digital signatures, 854, 865
Distributed architecture, vs. parallel,
DOS (Denial of Service) attacks, Digital terrain analysis, for spatial
855, 857 databases, 959
Distributed computing systems, 877
Dot notation Digits, in text preprocessing in
Distributed databases. See DDBs
in ODMG object model, 382 information retrieval, 1011
(distributed databases)
operations, 362 Dimension tables, in multidimen-
Distributed DBMSs. See DDBMSs
(Distributed DBMSs)
for path expressions in SQL, 376
Index 1145
Double-quoted strings, in PHP text
EER-to-Relational mapping processing, 485–486
interchanging data on Web using
mapping shared subclasses (mul- Double-sided disks, 589
XML, 27–28
tiple inheritance), 297 Downward closure property
E-mail servers, 45
mapping specialization or gener- Apriori algorithm using,
Early (static) binding, in ODMS,
alization, 294–297 1041–1042
mapping union types (cate- association rules and, 1041
ECA (Event-Condition-Action)
gories), 297–299 Drill-down display
model, 933
EIS (executive information systems), in data warehouses, 1078
Economies of scale, as benefit of
1068 working with data cubes,
database approach, 22
Element operator, in OQL, 403 1070–1072
ECR (Entity-Category-Relationship)
Elements, in SQL schema, 89 Driver manager class, JDBC, 469
model, 258
Elements, XML documents Drop command, in active database
Edges
complex vs. simple, 421–422 systems, 938
detecting in automatic analysis of
notation for specifying, 424 DROP SCHEMA command, 138
images, 967
overview of, 420 DROP TABLE command, 138
notation for query trees and
storing XML document as data DROP VIEW command, 135
query graphs, 703
element, 431 DSML (Directory Services Markup
of query graphs, 179
XML schema language, 429 Language), 855
EER (Enhanced Entity-
Embedded SQL DSS (decision-support systems),
Relationship) model
advantages/disadvantages, 1068–1069
aggregation and association,
476–477 DTDs (Document Type
approaches to database program- Definitions), 423, 425
bibliographic references, 284
ming, 449 Duplicate elimination, PROJECT
classification and instantiation,
communicating between program operation and, 150
and DBMS, 454 Durability property, of transactions,
constraints on specialization and
connecting to databases, 453 755
generalization, 251–254
defined, 448 Duration events (facts), in temporal
data abstraction, knowledge rep-
overview of, 451–452 databases, 946
resentation, and ontological
programming example, 454–455 Dynamic arrays, PHP, 483
concepts, 267–268
retrieving multiple tuples using Dynamic database application, 30
design choices for
cursors, 455–457 Dynamic database programming
specialization/generalization,
retrieving single tuples with, approaches
452–453 Dynamic SQL, 448, 458–459
formal definitions of concepts,
SQLJ, 448, 459–464 overview of, 464
as static database programming SQL/CLI (Call Level Interface),
generalization, 250–251, 269
approach, 464 464–468
hierarchies and lattices for spe-
Empty elements, XML schema lan- Dynamic files, 601
cialization and generalization,
guage, 429 Dynamic hashing, 612, 614, 731
Encapsulation Dynamic (late) binding, in ODMS,
identification, 269
defined, 369 368
mapping to ODB schema,
ODB features included in SQL, Dynamic multilevel indexes,
modeling union types, 258–260
in OO systems, 356 Dynamic operators, spatial, 961
ontologies and the Semantic Web
overview of, 361–363 Dynamic SQL
and, 272–273
UDTs and, 374–375 defined, 448
overview of, 245–246
Encryption specifying queries at runtime,
refining conceptual schemas,
DES and AES standards, 863 458–459
overview of, 862–863 Dynamic Web pages
specialization, 248–250, 269
public (asymmetric) key defined, 481
subclasses, superclasses, and
algorithms, 863–865 vs. static, 420
inheritance, 246–248
RSA encryption algorithm, 865 XML for, 416
summary and exercises, 273–284
symmetric key algorithms, 863 E-commerce
UML as alternative notation to,
End transaction, transaction types, access control policies for,
UNIVERSITY example of EER
1146 Index
END_TRANSACTION operation,
mapping binary 1:N relationship 751–752
ER diagrams
types, 290 Enhanced Entity-Relationship
class diagrams compared with,
mapping binary M:N relationship model. See EER (Enhanced
types, 290–291 Entity-Relationship) model
defined, 199
mapping multivalued attributes, Enterprise Resource Planning. See
notation of, 221–226, 1083–1085
291 ERP (Enterprise Resource
ER (Entity-Relationship) model
mapping N-ary relationship Planning)
attributes of relationship types,
types, 291–292 Enterprise search systems, 996
mapping regular entity types, Enterprise-wide data warehouses,
bibliographic references, 243
conceptual design choices, 222,
mapping weak entity types, Entity-Category-Relationship (ECR)
288–289 model, 258
constraints on binary relationship
summary of mapping constructs, Entity integrity
types, 216–218
292–294 constraint in relational data
correspondence to relational
ERP (Enterprise Resource Planning) model, 73
model, 293
database back-ends and, 25 rules for multilevel relations, 850
as data model type, 31
federated databases and, 886 Entity-Relationship model. See ER
degree of relationship, 213
SANs (Storage Area Networks) (Entity-Relationship) model
degree of relationship greater
and, 621 Entity sets
than two, 228–232
Errors/exceptions overlapping, 253
entities and attributes, 203–207
in Java, 459–461 overview of, 207–208
entity types and entity sets,
in ODMG object model, 383 Entity types
recovery needed due to, 750 attributes of, 203–207
ER diagram notation, 221–226,
reliability and availability and, classes compared with, 227
881 in data modeling, 31
as high-level conceptual model,
ETL (extraction, transformation, generalized, 264
and loading) tools, 1069 key attributes of, 208–209
initial conceptual design for
Event-based processing, in XML, mapping ER-to-Relational data
COMPANY database example,
423 models, 287–289
Event-Condition-Action (ECA) notation for, 1083–1084
key attributes of entity types,
model, 933 overview of, 207–208
laboratory exercises, 241–243
Events
relations, 288
as component of triggers, 133 subtypes or subclasses of,
naming conventions for schema
specifying, 943 246–247
constructs, 222
Events, in ECA model supertypes or superclasses of, 247
overview of, 199–200
defined, 933–934 symbols for, 1084
refining conceptual design for
in STARBURST example, 940 type inheritance in EER model,
COMPANY database example,
Example elements, QBE, 1091 248
EXCEPT operation weak entity types, 219–220
relationship types, sets, and
in relational algebra, 152–155 Entry points
instances, 212–213
as SQL set operations, 104 to objects, 363
relationships as attributes, 214
Exception objects, in knowledge in ODMG object model, 377
role names and recursive relation-
representation, 268 in OQL, 399–400
ships, 215
Exceptions. See Errors/exceptions Environment records, in SQL/CLI,
sample database application,
Execution autonomy 464–468
in distributed databases, 881 Environments
summary and exercises, 232–241
in federated databases, 886–887 database system environment,
UML class diagram notation,
Execution transparency, in distrib- 40–44
uted databases, 881 SQL, 90
value sets (domains) of attributes,
Executive information systems EQUIJOIN operation, in relational
(EIS), 1068 algebra, 159–161
weak entity types, 219–220
Existence dependency, in binary Equivalence of schedules, 768–770
ER-to-Relational mapping
relationships, 217 Equivalence of sets, of functional
algorithm for, 286–287
mapping binary 1:1 relationship
Existential quantifiers
Index 1147
in tuple relational calculus,
fixed-length records and variable- 177–178
FCIP (Fiber Channel over IP), 624
length records, 595–597 EXISTS function, SQL, 120–122
FCoE (Fiber Channel over
hashing techniques, 606 Expanding or growing (first) phase,
Ethernet), 624
headers (descriptors), 598 in two-phase locking, 782
FDBMS (federated database man-
internal hashing, 606–609 Expert database systems, 932
agement systems), 50
linear hashing, 614–616 Export schema, in federated data-
FDBSs (federated database systems)
of mixed records, 616–617 base architecture, 891
architecture of, 890–891
operations on, 599–601 Expressions
defined, 885
of ordered records (sorted files), in-line expressions in relational
overview of, 885–887
603–606 algebra, 151
Feasibility analysis, 307
organization of, 601 safe/unsafe expressions in tuple
Features, in vector space model for
placing file records on disk, 594 relational algebra, 182–183
IR, 1003
simple searches, 685 in tuple relational calculus, 176–177
Federated database management
of unordered records (heap files), Extends keyword, extending inheri-
systems (FDBMS), 50
601–602 tance, 383
Federated database systems. See
FDBSs (federated database
Filtering
Extensible hashing, 612–614
in agent-based approach to Web Extensible Stylesheet Language
systems)
content analysis, 1024 Transformations (XSLT), 415,
Federated schema, in federated data-
classification process in manda- 436
base architecture, 891
tory access control, 848 Extensible Stylesheet Language
Federated warehouses, 1078
protecting against SQL injection, (XSL), 415, 436
Feedback loops, between phases of
database design, 310
Extension. See Database state
Finances, applying data mining to, (snapshot)
Fiber Channel over Ethernet
1060 Extensions, SQL, 88
(FCoE), 624
Find operation, on files, 599–600 Extents
Fiber Channel over IP (FCIP), 624
FindAll operation, on files, 600 constraints corresponding to type
Field models, spatial data, 960
FindNext operation, on files, 600 hierarchies, 366
Fields
FindOrdered operation, on files, 600 defined, 369
connecting fields for relationships
Fingerprinting, database, 857 object persistence and, 363
between file records, 616
First-come-first-served queues, deal- in ODMG object model, 388–390
hash field, 606, 608
ing with starvation, 788 External hashing, 609–611
indexing fields (or attributes). See
First normal form (1NF), 65, External schema
Indexing fields (or attributes)
519–523 in federated database architecture,
logical field references for rela-
Fixed-head disks, 591 891
tionships between file records,
Fixed-length records, 595–597 in three-schema architecture, 34
Flash memory, 585 Extraction, transformation, and
ordering and key fields, 603
Flat data models, 436–440 loading (ETL) tools, 1069
of records, 594–595
Flat files, in relational model, 60 F-score, measures of relevance in IR,
search field, 648
Flat relational model, 65 1017
Fifth normal form (5NF), 534–535
Flexibility, as benefit of database Faceted searches, 1028–1029
File of commands, in SQL program-
approach, 22 Facets, 1028–1029
ming, 449
Flow analysis, for spatial databases, Fact constellation, in multidimen-
File servers, in client/server archi-
tecture, 45
Flow control Fact-defined predicates (relations),
sional data models, 1074
Files (of records)
covert channels, 861–862 978
allocation of file blocks on disk,
overview of, 860–861 Fact tables, in multidimensional
security control measures, 838 data model, 1073
B-trees and data structures in
Flow policies, 860 Factory objects, in ODMG object
organization of, 617
FLWR expressions, XQua, 434 model, 388–390
data organization and, 587
Folding technique, in hashing, 608 Facts, in deductive databases, 970
database approach compared with
Force/no-force techniques Failed state, transactions, 752
file processing, 9–10
in database recovery, 811–812 Fan-out, of multilevel index, 643
dynamic file expansion, 611–612
UNDO/NO-REDO recovery algo- Faults, reliability and availability
dynamic hashing, 614
extensible hashing, 612–614
rithm using, 818–819
1148 Index
FOREIGN KEY clause, of CREATE
Geographic Information Systems. TABLE command, 96
JDBC for Java programming,
See GIS (Geographic Foreign keys
Information Systems) ER-to-Relational mapping of
overview of, 461–464
GIF image format, 966 binary 1:1 relationship types,
PHP and, 491
GIS (Geographic Information 289
SQL/CLI with C as host language,
Systems) inclusion dependencies and, 571
spatial databases and, 958 in RDBs, 396
Functional data models, 214
types of databases, 3 relational data model and, 73–74
Functional dependencies
Global conceptual schema (GCS), Formatting disks, 589
based on arithmetic functions
315, 889 Forms
and procedures, 572–574
Global query optimization, 901 collecting data from/inserting
equivalence of sets of, 549
Global recovery manager, 825, 908 record into, 493–494
existence dependency and, 217
Global transaction manager, 907 PHP, 490–491
full functional dependency in
Granting privileges Forms-based interfaces, DBMS, 38
2NF, 523
example, 845–846 Forms specification languages,
inclusion dependencies, 571
GRANT OPTION , 844 38–39
inference rules for, 545–549, 568
overview of, 843 Formulas
JD (join dependencies), 534–535
Granularity level, in locking in domain calculus, 183
minimal sets of, 549–551
multiple granularity level locking, in tuple relational calculus,
MVD (multivalued dependency),
overview of, 795–796 Forward engineering, Rational Rose
overview of, 513–516
Granularity, of points in temporal and, 338
relational model constraints, 68
databases, 945 Fourth normal form (4NF)
template dependencies, 572
Graphical user interfaces (GUIs), 20, formal definition of, 533–534
transitive dependencies in 3NF,
multivalued dependency and,
Graphs. See also Diagrams 531–533
types of constraints, 74
converting graph data into XML restating definition of, 568–570
Functional requirements, in data-
trees, 441 FP-growth algorithms, in data min-
base design, 200–201
creating hierarchical XML views ing, 1045–1047
Functions. See also Operations
over flat or graph-based data, FP-tree (frequent-pattern tree) algo-
as attributes and operations, 365
436–440 rithm, in data mining,
identifying functional behavior
hierarchies (acyclic graphs), 50 1043–1045
for transactions, 322
predicate dependency graph, 982 Fragmentation
PHP, 488–490
query graphs, 179–180, 679, in distributed databases, 894–896
protecting against SQL injection,
701–703 example of, 898–901
wait-for graph, 787 transparency of, 880
QBE (Query-By-Example), 1095
Grid files Fragmentation schema, of data-
SQL/PSM (SQL/Persistent Stored
for organizing file data, 662–663 bases, 896
Modules), 473–475
for spatial indexing, 962 Free-form search requests, 995
Fuzzy checkpoints
Ground axioms, in deductive data- FROM clause
in ARIES recovery algorithm,
bases, 975 of SELECT command, 107
Group by clause, in OQL, 405–406 in SQL retrieval queries, 129–130
in database recovery, 812–813
GROUP BY clause, in SQL Full functional dependency, in 2NF,
Garbage collection, when transac-
aggregation and, 698 523
tion commits, 821
overview of, 126–129 Fully inverted files, 669
GAs (genetic algorithms), 1059
in retrieval queries, 129–130 Fully replicated catalogs, 913
GCS (global conceptual schema),
of SELECT command, 107 Function-based indexes, 666–667
Grouping Function call injection attack,
Generalization. See
aggregation and, 124–125, 856–857
Specialization/generalization
166–168 Function calls, database program-
Generalized model, for active data-
GROUP BY and HAVING clauses ming with
base systems, 933–937
for, 126–129 advantages/disadvantages, 477
GENERALIZED PROJECTION , in
Grouping attributes, 126 approaches to database program-
relational algebra, 165–166
Generic IR pipeline, 1000–1001
Grouping operator, in QBE (Query-
Index 1149
Growing (first) phase, in two-phase
long text strings in HTML files, locking, 782
Heuristics, in query optimization
484 Guided participation, in social
converting query trees into query
unstructured data and, 418–420 searches, 1029
execution plans, 709–710
Web publishing language, 24 GUIs (graphical user interfaces), 20,
heuristic algebraic optimization
algorithm, 708–709
Hubs, of Web pages or Web sites,
1020 Handle, C pointer variable and,
39 notation for query trees and
Hue, saturation, and value (HSV), 465–466
query graphs, 701–703
967 Hard drives, 591. See also Disk
optimization of query trees,
Hybrid hash-join, 696 devices
Hybrid XML documents, 422 Hardware
overview of, 700–701
Hyperlinks addresses, 590
transformation rules for relational
browsing and, 999 costs in choosing a DBMS, 323
algebra operations, 706–708
destination page and anchor text structures of disk devices,
Hierarchical data models
components, 1020 588–592
classifying DBMSs and, 49
for linking Web documents, 24 Hash field, 606
overview of, 52
Hypertext documents, on Web, 415 Hash field space, 608
types of data models, 31
HyperText Markup Language. See Hash file, 606
Hierarchical data models, for XML
HTML (HyperText Markup Hash function (randomizing func-
converting graph data into XML
Language) tion), 606
tree, 441
Hypertext Preprocessor, 482 Hash keys, 606, 686
creating hierarchical XML views
Hyphens, text preprocessing in Hash tables, 606
over flat or graph-based data,
information retrieval, 1011 Hash values, of a record, 612
Hypothesis tuples, in template Hashing
overview of, 420–422
dependencies, 572 cost functions for SELECT opera-
Hierarchies
I/O performance, in database tions, 713
association rules among,
tuning, 733 implementing set operations,
Idempotent operations, UNDO and 697–698
in object data models, 50
REDO , 809 partitioned, 661–662
specialization hierarchies,
Identification Hashing indexes
as abstraction process, 269 for decision making in database
type hierarchies, 364–367
goals of data mining, 1038 design, 730–731
High-level data models, 30
of multimedia sources, 965 overview of, 663
High-level (nonprocedural) DMLs, 37
Identifiers, 269 Hashing techniques, files
High-level query languages, 361
Identifying (or owner) entity type, dynamic file expansion, 611–612
Histograms, catalog information
219 dynamic hashing, 614
used in cost functions, 713
Identifying relationship, of weak extensible hashing, 612–614
HITS ranking algorithm, 1021–1022
entities, 219 external hashing, 609–611
Homogeneous DDBMSs, 49
Identity Management, in security, internal hashing, 606–609
Horizontal fragmentation, 880, 895
852 linear hashing, 614–616
Horizontal partitioning, in database
IE (information extraction), 1012 overview of, 606
tuning, 736
Image data, in GIS systems, 960 Having clause, in OQL, 406
Horizontal propagation, of privi-
Images, in multimedia databases HAVING clause, in SQL
leges, 846
analysis of, 967–968 aggregate functions used in, 125
Horn, Alfred, 973
formats, 965–966 overview of, 127–129
Horn clauses, in deductive database
object recognition, 967 in retrieval queries, 129–130
systems, 974–975
overview of, 932, 965 of SELECT command, 107
Host languages
semantic tagging, 969 Health care, applying data mining
C as host language in SQL/CLI,
storage/retrieval, 25 to, 1060
Immediate consideration, rule con- Heterogeneous databases
in database programming, 452
sideration in active databases, DDBMSs, 50
DML and, 38
938 in Oracle, 918
HSV (hue, saturation, and value),
Immediate update techniques, Heuristic components, of design
808–809 tools, 344
HTML (HyperText Markup
Language)
overview of, 807, 809
1150 Index
UNDO/NO-REDO recovery
Information privacy, vs. information algorithm, 818–819
inverted indexing for information
security, 841–842 UNDO/REDO recovery algorithm,
retrieval, 1012–1014
Information repository 819
issues with, 668–669
DBMS tools, 43 Immutable property, of OIDs, 357
locks for concurrency control in,
organizations using, 306 Impedance mismatch problem, in
Information Retrieval. See IR traditional databases, 19
methods for complex selection,
(Information Retrieval) Implementation
Information system (IS) in database application life cycle,
methods for simple selection, 686
vs. information privacy, 841–842 308
multilevel, 643–646
life cycle of, 307–308 database design and, 309–311
on multiple keys, 660–661
Informational searches, 996 of database operations, 12
ordered on multiple attributes,
INFORMATION_SCHEMA , SQL, 90 of database system, 327–328
Inherent rules, of data models, 21 encapsulation and, 361
partitioned hashing, 661–662
Inheritance goodness of relation schemas and,
physical database design and,
comparing RDB design with 502
ODB design, 396 issues in active database systems,
physical vs. logical, 668
extending, 383 937–940
primary, 605, 633–635
multiple, 256–257, 368 of object operations, 356
rebuilding to improve perfor-
ODB features included in SQL, tuning and, 311
mance, 735
search, insertion, deletion with
Implementation data models, 31
ODL and, 395 Implementation phase, of informa-
B+-trees, 655–660
in ODMG object model, 383 tion system (IS) life cycle, 307
search trees, 647–649
in OO systems, 356 In-line expressions, in relational
secondary, 636–642
selective, 368 algebra, 151
simple searches, 685
shared subclasses, 297 Inclusion dependencies, 571–572
single-level, 632–633
single, 256–257 Incorrect summary problem, in
spatial, 961–963
specifying in SQL, 375–376 concurrency control, 748–749
summary and exercises, 670–674
table inheritance in SQL, 376 Increment operator, SQL, 105
tables comparing index types, 642
type hierarchies and, 364–367 Incremental updates, 136
text-based indexing of audio data,
type inheritance in EER model, Indexed allocation, of file blocks on
variations on B-trees and
Initial state, populating (loading) Indexed (ordered) collection expres-
disk, 597
B+-trees, 660
databases and, 33 sions, in OQL, 405
Indexing fields (or attributes)
Inline views, SQL, 137 Indexed Sequential Access Method
records and, 631
Inmon, W. H., 1068 (ISAM), 631, 644–645
secondary indexes, 636
Inner joins Indexed sequential file, 605, 644
single-level indexes, 632
vs. outer joins, 160–161 Indexes
Inductive knowledge, 1038
in SQL, 123–124 as access paths in physical data
Inference
Input/output, identifying for trans- models, 31
control measures, 837–838
actions, 322 B-trees, 649–652
in databases, 21–22
Input validation filtering, 858 B+-trees, 652–655
in knowledge representation, 268
INSERT command, SQL bibliographic references, 674–675
statistical databases and, 859–860
active rules and, 936 bitmap, 663–666
Inference (deduction mechanism)
overview of, 107–109 clustering, 635–636
engine
Insert operation column-based storage of relations
deductive database systems and,
concurrency control techniques, and, 669–670
800–801 cost functions for SELECT opera-
nonrecursive Datalog queries and,
on files, 600 tions, 713
relational data model operations, database storage and, 583
in Prolog/Datalog, 975
76–77 database tuning and, 734–735
Inference rules
Insertion anomalies, reducing DBMS queries and, 19
Armstrong’s, 548
redundant information in dynamic multilevel, 646–647
for functional and multivalued
tuples, 507–508 function-based, 666–667
dependencies, 568
for functional dependencies,
Inside-out strategy, for schema
Index 1151
Instances
Isolation level, transaction support current set in database state, 32
INTERSECTION operation
in SQL, 770 database schemas, 32–33
algorithms for, 697–698
Isolation property, transactions, 14, relational database state, 70
in relational algebra, 152–155
754–755 of specialization, 249
INTERVAL data type, SQL
Items, stored in records, 594 Instantiation, as inverse of classifica-
overview of, 93
as temporal data type, 945
Itemsets
Apriori algorithm finding fre- Instead triggers, in active database
tion, 268
Intranets, searches over, 996
quent (large), 1041–1042 systems, 938
Invalid state, of relational databases,
71 association rules and, 1040–1041 Integrity constraints
FP-growth algorithms for finding active databases enforcing, 943
Inverted indexing, for information
frequent, 1045–1047 in databases, 20–21
retrieval, 1012–1014
FP-tree algorithms for finding fre- entity integrity constraint, 73
IR (Information Retrieval)
quent, 1044–1045 in mandatory access control, 850
bibliographic references,
partition algorithm for local fre- in relational data model, 73–74
quent, 1047 relational database schema and, 70
Boolean model for, 1002–1003
sampling algorithm and, 1043 Integrity loss, as security threat, 836
comparing databases to, 26,
Iteration markers, in sequence dia- Intellectual property rights, 867
grams, 332 Intension entity type, describing for
comparing Web search and analy-
Iterator objects, in ODMG object entity set, 208
sis to, 1018–1019
model, 383 Interaction diagrams, UML, 331
generic IR pipeline, 1000–1001
Iterator variables, in OQL, 399–400 Interactive query interface
history of, 998–999
inverted indexing, 1012–1014
Iterators
SQL programming, 448
looping in SQL queries, 98 user interaction with databases
measures of search relevance,
looping over tuples in a query via, 40
result, 450 Interactive transactions, concur-
mode of interaction in,
retrieving multiple tuples in rency control and, 801
SQLJ, 461–464 Interblock gaps
overview of, 26, 993–997
probabilistic model for, 1005–1006
Java
disk parameter for, 1088
embedding SQL commands in, structures of disk devices, 589
query types in, 1007–1009
459–461 Interfaces
recall and precision metrics in,
JDBC programming, 469–473 for database operations, 12
SQLJ and, 452 DBA, 40
semantic model for, 1006–1007
Java Database Connectivity. See DBMS, 38–40
summary and exercises,
JDBC (Java Database design tools and, 344
Connectivity) GUIs (graphical user interfaces),
text preprocessing in, 1009–1012
JD (join dependencies), 534–535 20, 39
trends in, 1028–1030
JDBC class libraries, 469 for high-level query languages, 38
vector space model for,
JDBC driver, 469 for interactive queries, 40
JDBC (Java Database Connectivity) multiple user, 20
IS-A-COMPONENT-OF , 270
client/server architecture for in ODMG object model, 382–385
IS-A-MEMBER-OF , 268
DBMSs, 47 of operations, 356, 361
IS-A (or I S-AN ) relationships
for Java programming, 469–473 Interinstance integrity, 850
class/subclass relationships in
library of functions, 448 Interleaved concurrency
EER model, 247
Job mix, in database design, 728 on disks, 593–594
in EER model, 264
Join attributes, 159, 689 multiprogramming and, 745
IS-A-PART-OF , 270
Join conditions Internal hashing, 606–609
IS-A-SUBCLASS-OF , 269
in domain calculus, 184 Internal schema, in three-schema
IS-AN-INSTANCE-OF , 268
SELECT command and, 100 architecture, 34
IS-ASSOCIATED-WITH , 270
temporal intersection join, 952 International Standards
IS (information system)
Join dependencies (JD), 534–535 Organization (ISO), 88
vs. information privacy, 841–842
Join indexing, in multidimensional Internet SCSI (ISCSI), 623–624
life cycle of, 307–308
data models, 1075 Interpolating variable, within
ISAM (Indexed Sequential Access
JOIN operations strings, 485
Method), 631, 644–645
ISCSI (Internet SCSI), 623–624
cost functions for, 715–718
1152 Index
EQUIJOIN and NATURAL JOIN
LIS (local internal schema), 889 variations, 159–161
overview of, 245
List constructor, 359 hybrid hash-join, 696
specialization and generalization,
Literals (values), 378–382 implementing, 689–690
atomic formulas as, 973 join selection factors, 693–694
Label-based security
atomic literals, 378 multiple relation queries and
administrator defining policy for,
collection literals, 382 JOIN ordering, 718–719
complex types for, 358–360 nested-loop joins, 690–693
Oracle Label Security, 868–870
in OO systems, 358 overview of, 157–158
Label Security administrator, 853
structured literals, 378 partition-hash joins, 694–696
Labels, semistructured data and, 417
Loading/converting data, in data- Join operations, in QBE, 1094–1095
LANs (local area networks), 44, 879
base application life cycle, 308 Join selection factors, 693–694
Large databases, 304
Loading databases, initial state and, Join selectivity ratio, 160, 715
Latches, for short term locks, 802
Late (dynamic) binding, in ODMS,
Loading utility, for loading data files JPEG image format, 966
Joined tables (relations), 123–124
to database, 42–43 K-means clustering algorithm,
Latency. See Rotational delay (rd)
Local area networks (LANs), 44, 879 1055–1056
Lattices, for specialization, 255–256
Local conceptual schema (LCS), 889 KDD (Knowledge Discovery in
LCS (local conceptual schema), 889
Local internal schema (LIS), 889 Databases), 1036
LDAP (Lightweight Directory Access
Local query optimization, 902 Key attribute, 209
Protocol), 919–921
Local schema, in federated database Key constraints
Leaf classes, 265
architecture, 890 on entity attributes, 208–209
Leaf-deep trees, 718
Localization, in distributed query integrity constraints in databases,
Leaf nodes, of tree structures, 646
Learning approaches
processing, 901
Location analysis, for spatial data- overview of, 68–70
21 classification and, 1051
bases, 959 specifying in SQL, 95–96
clustering and, 1054
Location transparency, 880 Key field, sorted files and, 603
neural networks and, 1058
Lock compatibility table, 792 Keys
Legacy data models, 51
Lock manager subsystem, in DBMS, candidate and primary in rela-
Legacy database systems, 49, 60
779 tional databases, 518–519
Legal relation states (legal exten-
Lock table, 779 indexes on multiple, 660–661
sions), 514
Locking. See also Two-phase locking methods for simple selection, 686
Levels of isolation, of transaction,
for concurrency control, 777 in ODMG object model, 388–390
granularity level in, 795–796 specifying in XML schema, 430
Libraries of functions. See Function
index locking and predicate lock- Keyword queries
calls, database programming
ing, 801 overview of, 39
with
multiple granularity level, searching with, 995
Lifespan temporal attributes,
796–798 types of queries in IR systems,
used in indexes, 798–800 1007
Lightweight Directory Access
Protocol (LDAP), 919–921
Locks
Kleinberg, Jon, 1021
binary, 778–780 Knowledge-based systems, 932, 1007
LIKE comparison operator, in string
certify locks, 792–793 Knowledge Discovery in Databases
pattern matching, 105
conversion of, 782 (KDD), 1036
Linear hashing, 614–616
shared/exclusive (read/write), Knowledge discovery process
Linear regression, 1058
780–782 data mining in, 1036–1037
Linear searches
in two-phase locking, 778 goals of, 1037–1038
with brute force algorithm,
Log buffers, 753–754 types of knowledge discovered,
Log records, 753 1038–1039
cost functions for SELECT opera-
Log sequence number (LSN), 822 KR (knowledge representation)
tions, 713
Logic databases, 932. See also aggregation and association,
of file blocks on disk, 597
Deductive database systems 269–271
of files, 602
Logic programming, 970 classification and instantiation,
Lines, on maps, 960
Logical (conceptual) level, goodness 268
Link structure, of Web pages,
of relation schemas and, 501 compared with semantic data
Linked allocation, of file blocks on
Logical data independence, in three-
Index 1153
Logical definitions, of domains, 61
Measurement operations, for spatial Logical design, 9, 202
Maintenance
databases, 958 Logical field references, for relation-
database, 6
Mechanical arm, on hard disks, 591 ships between file records,
of derived data, 943
Memory hierarchies, storage devices 617
maintenance costs in choosing
and, 584–586 Logical indexes, vs. physical indexes,
DBMS, 323
Memory usage, cost components of 668
Maintenance personnel, 17
query execution, 711 Logical operators. See AND, OR,
Mandatory access control. See MAC
Menu-based interfaces, 38 NOT connectives
(mandatory access control)
Merge phase, of sort-merge strategy, Logical ordering, secondary indexes
Manipulating databases
overview of, 5
Messages, passing to objects, 356 Logical theory, in ontologies, 272
and, 642
University student database
Meta-classes, in knowledge repre- Login sessions, 839
example, 9
sentation, 268 Logs/logging
Manufacturing, applying data min-
Meta-data auditing and, 839–840
ing to, 1060
in DBMS catalog, 33 database recovery and, 808
Map data, as spatial data, 959
DBMSs managing, 306 tracking transaction operations,
Mapping
defined, 5 753–754
data model mapping. See Data
describing structure of primary during undo process, 821
model mapping
database, 10–11 Long-haul networks, 879
from EER model to relational
Metadata repository, in data ware- Long text strings, in HTML files,
model. See EER-to-Relational
housing, 1078 484
mapping
Metasearch engines, 1018 Loss of integrity, as security threat,
from EER schema to ODB
Methods. See also Operations 836
schema, 397–398
of object classes, 50 Lossless (nonadditive) join property
from ER model to relational
of object operations, 356 decomposition into 3NF rela-
model. See ER-to-Relational
Metric operators, as spatial operator, tions, 560–563
mapping
between levels of three-schema
decomposition into 4NF rela-
Metrics, for evaluating relevance in tions, 570
architecture, 35
IR, 1015–1017 normal forms and, 518
Query mapping, 901
MGL (multiple granularity locking), overview of, 553–556
SELECT command, 97
797–798 successive, 557
tuples, 64
Micro life cycle, 307 testing binary decompositions for,
Market-basket data, association
Middle tier, in three-tier architec- 557
rules and, 1040
ture, 48 Lossy design, 554
Marketing, applying data mining to,
Middle-tier Web servers, PHP, 482 Lost updates, in concurrency con-
Middleware software trol, 748–749
Mass storage devices, 585
federated databases and, 886 Low-level data models, 30
Massively parallel processing
heterogeneous DDBMSs and, 50 Low-level (procedural) DMLs,
(MMP), 1079
MIN function 37–38
Master files, 605
aggregate functions in SQL, LSN (log sequence number), 822
Materialized evaluation, converting
124–125 MAC (mandatory access control)
query trees into query execu-
grouping and, 166 classification attributes, tuple
tion plans, 710
implementing aggregate opera- classification, and multilevel
Materialized views
tions, 698 relations, 848–850
active rules for maintaining con-
Minimal model, for interpretation comparing with discretionary
sistency of, 943
of rules in deductive databases, access control, 850–851
data warehouses compared with,
overview of, 847
Minimal sets, of functional depen- security classes in, 847–848
Mathematical relations, 59, 63
dencies, 549–551 Macro life cycle, 307
Mathematical set theory, 104
Minimum bounding rectangle Magnetic tape
MAX function
(MBR), in R-Trees, 962 for archiving and backup, 586
aggregate functions in SQL,
Minimum cardinality constraint, as storage devices, 592–593
grouping and, 166
Main memory, 585
implementing, 698
Miniworld, 4
1154 Index
MVD (multivalued dependency) Mixed fragmentation, in distributed
Mirroring (shadowing), RAID, 619
B+-trees, 652–655
4NF and, 531–533 databases, 896
dynamic, 646–647
formal definition of, 533 Mixed strategy
overview of, 643–646
inference rules for, 568 for schema design, 316
search, insertion, deletion,
relational model constraints, 68 for view integration process, 319
search trees compared with,
N-ary
relationship types, 291–292 MMP (massively parallel process-
Mixed transactions, 322
strategies for view integration ing), 1079
variations on B-trees and
process, 319 Model mapping. See Data model
B+-trees, 660
N-tier architectures, for Web appli- mapping
Multilevel relations, in mandatory
cations, 47–49 Model-theoretic interpretation, of
access control, 848
Named iterator, SQLJ, 461 rules in deductive databases,
Multimedia databases
Named queries, in OQL, 402–403 976
analysis of audio data sources,
Namespaces, XML, 428–429 Models, data. See Data models
Naming conventions Models, for interpretation of rules
analysis of images, 967–968
for constraints, in SQL, 96–97 in deductive databases, 976
object recognition, 968–969
for relations, 62 Models, spatial, 959–960
overview of, 965–967
for schema constructs, 222 Modification anomalies, avoiding
semantic tagging of images, 969
Naming mechanism, object persis- redundant information in
types of databases, 3
tence and, 363 tuples, 509
Multiple granularity locking (MGL),
Naming transparency, 880 Modifier operations, objects, 362
NAS (network-attached storage), Modify operations, on files, 600.
Multiple hashing, in collision reso-
622–623 See also Update operations
lution, 609
Native XML format Modules
Multiple inheritance
DBMSs, 49 client and server, 29
in ODBs (object databases), 368
overview of, 425 DBMS, 16
ODL (object definition language)
storing, 431 DBMS component, 40–42
and, 395
NATURAL JOIN operations, MOLAP (multidimensional OLAP),
subclasses and, 256
Multiple relations
Natural language interfaces, 39 Monitoring and maintenance phase,
options for mapping specializa-
Natural language queries, 1009 in database application life
tion or generalization, 295
Navigational searches, 996 cycle, 308
queries and JOIN ordering,
Nearest neighbor, in spatial queries, Morphological analysis, in semantic
Multiplicities, in UML class dia-
Negation symbol, in QBE, 1096 Movable-head disks, 591
model for IR, 1006
grams, 227
Negative associations, 1049–1050 MPEG image format, 966
Multiprocessor systems, 879
Negative literals, in Datalog lan- Multidatabase systems
Multiprogramming operating
guage, 973 recovery techniques for, 825–826
systems, 744–745
Nested-loop joins types of distributed databases,
Multiset (bag), of tuples, 103–105,
cost functions for, 716 885
factors impacting performance of, Multidimensional associations,
Multiuser DBMS systems, 49
Multiuser transactions
implementing, 689 Multidimensional data models
in databases, 13–14
Nested queries decision-support technologies,
processing system, 744–745
correlated, 119–120 1069
Multivalued attributes
innermost, 119 dimension tables and fact tables,
declaring, 397
overview of, 117–119 1073
in ER model, 206
Nested relations indexing, 1074–1075
mapping ER-to-Relational data
INF and, 521 roll-up and drill-down displays,
models, 291
SQL and, 111 1072
Multivalued dependency. See MVD
Network-attached storage (NAS), schemas, 1073–1074
(multivalued dependency)
622–623 Multidimensional OLAP (MOLAP),
Multiversion concurrency control,
Network data models 1079
Multiway joins, 124, 689
classifying DBMSs and, 49
Index 15
Network transparency, 880
overview of, 50 Neural networks, 1058
Normalization
spatial data, 960 NO-UNDO/REDO recovery tech-
algorithms. See algorithms, nor-
types of data models, 31 nique
malization
Object databases. See ODBs (object based on deferred update, 815–817
automated tools for database
databases) overview of, 807, 809
design, 344
Object definition language. See ODL No waiting algorithm, for deadlock
functional dependencies and, 545
(object definition language) prevention, 787
relational database design based
Object diagrams, UML, 330 Nodes, of tree structures, 646
on, 60
Object Identifiers. See OIDs (object Non-identifying relationships, in
of relational schema design, 516
identifiers) Rational Rose, 340
of relations, 517–518
Object identifiers, in SQL, 111 Nonadditive (lossless) join property
NOT EXISTS functions, SQL,
Object lifeline, in sequence dia- decomposition into 3NF rela-
grams, 332 tions, 560–563
NOT logical connective. See AND ,
Object-orientation (OO), 355–357 decomposition into 4NF rela-
OR , NOT connectives
Object-oriented analysis (OOA), tions, 570
NOT NULL , specifying attribute
1083 normal forms and, 518
defaults in SQL, 94
Object-oriented database manage- overview of, 553–556
Notation
ment systems (OODBMSs), 49 successive, 557
diagrammatic, 516
Object-oriented databases. See testing binary decompositions for,
in ER diagrams, 221–223,
OODBs (object-oriented data- 557
bases) Nonprime attributes, 519
for Prolog/Datalog languages,
Object-oriented programming Nonprocedural languages, relational
languages. See OOPLs (object- calculus as, 174
for query graphs, 179–180,
oriented programming Nonrecoverable schedules, transac-
languages) tions, 758
for query trees, 163–165, 701–703
Object recognition, in images, Nonrecursive queries, evaluating in
in relational data model, 66–67
968–969 Datalog, 981–983
in UML class diagrams, 226–228
Object-relational database manage- Nonrelevant sets, in probabilistic
Notification application, for active
ment systems (ORDBMS), 354 model for IR, 1005
databases, 942
Object-relational (extended rela- Nonrepeatable reads, transaction
NULL values
tional) systems, 51, 111 support in SQL, 771
access control integrity, 850
Object-relational model Nonserial schedules, 761
comparisons involving, 116–117
creating tables based on UDTs, 374 Nontime-varying attributes, 953
constraints, 68–70
encapsulation of operations, Nonvolatile storage, in databases,
in ER model, 206
examples illustrating, 116
ODB extensions to SQL, 369–370 Normal forms
grouping tuples with, 128
OIDs using reference types, based on primary keys, 516–517
problems in relational design,
373–374 Boyce-Codd normal form
specifying inheritance and over- (BCNF), 529–531, 559–560
reducing in tuples, 509–510
loading of functions, 375–376 domain-key normal form
specifying attribute defaults in
specifying relationships via refer- (DKNF), 531–533, 574–575
SQL, 94
ence, 376 fifth normal form (5NF), 534–535
in tuples, 65–66
UDT (user-defined types) and first normal form (1NF), 65,
Numeric arrays, PHP, 487
complex structures, 370–373 519–523
Numeric data types, in SQL, 92
Object Data Management Group.
Objects
fourth normal form (4NF),
atomic (user-defined) objects, 531–534, 568–570
See ODMG (Object Data
386–388 insufficiency of, 552
Management Group)
complex types for, 358 normalization of relations, 517
Object data management systems.
in ODMG object model, 377–378 practical use of, 518
See ODMS (object data man-
operations, 362–363 second normal form (2NF), 523,
agement systems)
persistence of, 19, 363–364 526–527
Object data models
state and behavior components temporal normal form, 952
classifying DBMSs and, 49
of, 355 tests, 517
converting to/from logical
models, 341
visible/hidden attributes of, 361
1156 Index
ODBC (Open Database
OO (object-orientation), 355–357 Connectivity)
ODL (object definition language)
OOA (object-oriented analysis), client-side API for calling
and, 390–395
1083 DBMSs, 47
overview of, 376–377
OODBMSs (object-oriented data- data mining tools using, 1060
ODMS (object data management
base management systems), 49 library of functions, 448
systems). See also ODBs (object
OODBs (object-oriented databases) ODBs (object databases)
databases)
attribute versioning for incorpo- bibliographic references, 412–413
complex types for objects and lit-
rating time in, 953–954 complex types for objects and lit-
erals, 358
complexity of data and, 24 erals, 358–360
early (static) binding and late
persistent storage and, 19 conceptual design, 395–396
(dynamic) binding, 368
OOPLs (object-oriented program- encapsulation of operations,
high-level query languages used
ming languages) 361–363
by, 361
bindings to, 376 extensions to SQL, 369–370
list of concepts in, 369
class declarations of, 364 list of concepts in, 369
OIDs, 357, 377–378
instance variables in, 356 mapping EER schema to ODB
overview of, 353
ODBs closely coupled with, 363 schema, 397–398
standard for, 376
OO concepts, 355–356 multiple and selective inheritance,
Offline, storing data, 587
Open addresses, collision resolution, 368
OIDs (object identifiers)
comparing RDB design with
Open Database Connectivity. See OO (object-orientation) concepts
OID (object identifiers), 357–358
ODB design, 395–396
ODBC (Open Database and features, 355–357
ODB features included in SQL,
Connectivity) overview of, 353–355
Open operation, on files, 599 persistence of objects, 363–364
in ODMG object model, 377–378
Operating costs, in choosing a polymorphism (operator over-
reference types, 373–374
DBMS, 323–324 loading), 367–368
unique identity and, 357–358, 369
Operating systems. See OSs (operat- selective inheritance, 368
Okapi relevance system, in proba-
ing systems) summary and exercises, 408–411
bilistic model for IR, 1006
Operations. See also Functions; type hierarchies and inheritance,
OLAP (online analytical processing)
Methods 364–367
data mining tools, 1061
comparing RDB design with ODL (object definition language)
data warehousing and, 1067–1068
ODB design, 396 binding ODL constructs to C++,
overview of, 3
in data models, 30 407–408
relational and multidimensional,
database, 12 inheritance and, 395
in database application life cycle, in ODMG standard, 376
OLTP (online transaction process-
ing)
supporting semantic constructs of
database design and, 201 ODMG object model, 390
classifying DBMSs by purpose, 50
encapsulation of, 361–363, 369 type constructors in, 359–360
database support for, 1068
on files, 599–601 University student database
sharing data and multiuser trans-
objects, 362–363 example, 391–395
actions, 13
in ODMG object model, 387 ODMG (Object Data Management
transaction processing and, 79
pipelining, 700 Group)
Online analytical processing. See
query processing and optimizing, C++ language binding in, 407
OLAP (online analytical pro-
cessing)
OQL (object query language) in
transaction, 751–752 ODMG standard, 398
Online data storage, 587
transformation rules for relation- standards, 354, 376
Online directories, 919–921
al algebra operations, 706–708 ODMG object model
Online transaction processing. See
in UML class diagrams, 227 atomic (user-defined) types,
OLTP (online transaction pro-
Operations, in relational data model 386–388
cessing)
Delete operation, 77–78 built-in interfaces and classes,
Ontologies
Insert operation, 76–77 383–385
concepts, 267–268
overview of, 75–76 extents, keys, and factory objects,
defined, 272
Update ( Modify ) operation, 78–79 388–390
OWL (Web Ontology Language),
Operators inheritance in, 383
Semantic Web and, 272–273
arithmetic operators in SQL,
Index 1157
collection operators in OQL,
Parser, checking query syntax with, 403–405
Order preserving functions, hashing
and, 609
comparison operators in SQL, 98
Partial categories, 260 concatenate operator in PHP, 485
Ordered (indexed)
Partial dependencies, 523 grouping operator in QBE,
collection expressions in OQL, 405
Partial keys, 219 1095–1098
cost functions for SELECT opera-
Partial order, of transaction sched- logical connectives. See AND , OR ,
tions, 713
ule, 757 NOT connectives
query results in SQL, 106–107
Partial specialization, 253–254, 264 overloading. See Polymorphism
Ordered (sorted files), in records,
Partially committed state, transac- (operator overloading)
tions, 752 relational, 980–981, 983
Ordering field, file organization and,
Partially replicated catalogs, 913 SELECT operator ( σ), 147–149
Participation constraints, on binary spatial, 960–961
Ordering key, sorted files and, 603
relationships, 217 Operators, database workers behind
Organization context, for database
Partition algorithm, for local fre- the scene, 17
systems, 304–307
quent itemsets, 1047 Optical jukebox memories, 586
OSs (operating systems)
Partition-hash joins Optimization, in data mining, 1038
DBMS access and disk read/write,
40 methods for implementing joins, Optimizing queries. See Query pro-
multiprogramming, 744–745
overview of, 694–696 Optional fields, in file records, 595
cessing and optimizing
support for transaction process-
Partitioned hashing, 661–662 OQL (object query language)
ing in distributed databases,
Passwords, DBAs assigning, 839 collection operators and, 403–405
Path expressions extracting single elements from
OUTER JOIN operations
dot notation for build path singleton collections, 403
implementing, 699–700
expressions in SQL, 376 group by clause in, 405–406
vs. inner joins, 160–161
in OQL, 400 in ODMG standard, 376, 398
overview of, 169–170
specifying with XPath, 432–434 ordered (indexed) collection
in SQL, 123–124
Outer queries, 117
Patterns
analysis phase of Web usage overview of, 398–399
expressions, 405
OUTER UNION operation, in rela-
analysis, 1027 query results and path expres-
tional algebra, 170–171
data mining for discovering, 1057 sions, 400–402
Outliers, spatial, 965
substring pattern matching in simple OQL queries, database
Overflow (transaction) files, 605
SQL, 105–106 entry points, and iterator vari-
Overlapping
within time series, 1039 ables, 399–400
entity sets, 253
PEAR (PHP Extension and specifying views as named
specialization and, 264
Application Repository), 491 queries, 402–403
OWL (Web Ontology Language),
Peer-to-peer database systems, 915 OR logical connective. See AND , OR ,
Performance NOT connectives
Owner accounts, granting/revoking
advantages of distributed data- Oracle
privileges, 843–844
bases for, 882 Cartridge, 931
Package diagrams, UML, 330
DBMS utilities for monitoring, 43 distributed databases, 915–919
PageRank algorithm, 1021
Persistence query optimization in, 721–722
Parallel architecture, for servers,
collections, 367 Oracle Internet Directory, 919–921
data, 586 Oracle Label Security
Parallel database management
objects, 363–364, 378 architecture of, 869
systems, vs. distributed archi-
Persistent storage, of program combining data labels and user
tecture, 887–888
objects in databases, 19 labels, 869–870
Parallel processing
Persistent stored modules (PSM), overview of, 868
on disks, 593–594
474–476 virtual private database technolo-
handling multiple processes, 745
Personal databases, 305 gy, 868–869
Parameterized statements (bind
Personalization, of information in ORDBMS (object-relational data-
variables), protecting against
Web searches, 1019 base management systems), 354
SQL injection, 858
Personnel costs, in choosing a ORDER BY clause, SQL
Parameters
DBMS, 323–324 ordering query results, 106–107
disk blocks (pages), 1087–1089
SQL/PSM (SQL/Persistent Stored
PGP (Pretty Good Privacy), 854
1158 Index
Phantoms, transaction support in
Predicate locking, 801 SQL, 771
Pipelining, combining operations
Predicates PHP
using, 700
as arity or degree of p, 973 arrays, 486–488
Pivoting (rotation)
built-in, 972–973 bibliographic references, 497
functionality of data warehouses,
fact-defined and rule-defined, 978 collecting data from forms and
interpretation of, 976 inserting records, 493–494
working with data cubes,
in Prolog languages, 970–972 connecting to databases, 491–493
relational schemas and, 66 features, 484–485
PL/SQL
Prediction, as goal of data mining, functions, 488–490
designing database programming
1037 overview of, 481–482
language from scratch, 449
Preprocessors retrieval queries, 494–495
impedance mismatch and, 450
embedded SQL and, 452 server variables and forms,
writing database applications
in SQL programming, 449 490–491
with, 447
in Web usage analysis, 1025–1027 simple example of, 482–484
Plaintext, 864
Presentation layer (client), in three- summary and exercises, 496–497
Point events (facts), in temporal
tier client/server architecture, variables, data types, and con-
databases, 946
Pointers, blocks of data and, 597
Pretty Good Privacy (PGP), 854 PHP Extension and Application
structs, 485–486
Points
Primary file organization Repository (PEAR), 491
on maps, 959–960
B-trees as, 651 Phrase queries, types of queries in
in temporal databases, 945
data organization and, 587 IR systems, 1008
Policies
Primary indexes Physical clustering, of records on
access control for e-commerce
cost functions for SELECT opera- disks, 617
and Web, 854–855
tions, 713 Physical data independence, in
flow policies, 860
methods for simple selection, 686 three-schema architecture, 36
for label-based security, 853
for ordered records (sorted files), Physical data models, 30
security policies, 836
Polygons, on maps, 960
Physical database design. See also
overview of, 633–635 Database design
Polyinstantiation, in mandatory
searching nondense multilevel bibliographic references, 740
access control, 849–850
primary index, 646 data organization in, 587
Polymorphism (operator overload-
tables comparing index types, 642 denormalization as design deci-
ing)
types of ordered indexes, 632 sion related to query speed,
defined, 369
PRIMARY KEY clause, CREATE 731–732
in OO systems, 357
TABLE command, 95 in ER (Entity-Relationship)
overview of, 367–368
Primary keys model, 202
specifying in SQL, 375–376
defined, 519 factors influencing, 727–729
populating (loading) databases, 33
normal forms based on, 516–517 indexing decisions, 730–731
Populations, in statistical database
primary indexes and, 633 overview of, 9, 326–327
security, 859
relational model constraints, 69 summary and exercises, 739–740
Positional iterator, SQLJ, 461–462
Primary site, concurrency control tuning and, 735–736
Positive literals, in Datalog language,
techniques for distributed data- Physical database file structures, 583
bases, 910–911 Physical database phase, in database
Precedence graph (serialization
Primary storage, 584 design, 311
graph), 763–765
Prime attributes, 519, 526 Physical indexes
Precision metrics
Printer servers, in client/server vs. logical, 668
finding relevant information and,
architecture, 45 ordering primary and clustering
measures of relevance in IR,
Privacy
information privacy vs. informa- Physical problems/catastrophes,
indexes, 642
tion security, 841–842 recovery needed due to, 751
Precision, vs. security, 841
issues in database security, Physical relationships, between file
Precompilers
866–867 records, 617
DML commands and, 42
protecting in statistical databases, Pile file (heap), 602
embedded SQL and, 452
in SQL programming, 449
Pipelined evaluation, converting
Predicate-defined (condition-
Private keys, in public (asymmetric)
Index 1159
Privileges
transforming, 180 discretionary, 842–844
dependency-preserving and non-
using in queries, 180–182 granting/revoking, 111, 844–846
additive join decomposition
Queries. See also OQL (object query limits on propagation of, 846–847
into 3NF schemas, 560–563
language); SQL (Structured unauthorized escalation and
dependency-preserving decompo-
Query Language) abuse, 855, 858
sition into 3NF schemas,
content-based retrieval, 965 views for specifying, 844
database tuning and, 736–738 Proactive updates, valid time rela-
insufficiency of normal forms
defined, 6 tions and, 949
and, 552
design decisions related to query Probabilistic model, for information
nonadditive join decomposition
speed, 731–732 retrieval, 1005–1006
into BCNF schemas, 559–560
evaluating nonrecursive Datalog Procedural DMLs, 37–38
nonadditive (lossless) join,
queries, 981–983 Process-driven design, 310
information retrieval, 1007–1009 PROCESS RULES , in active data-
overview of, 544, 551
interactive interface for, 40 base systems, 938
successive nonadditive join
IR systems, 1007–1009 Processes
decompositions, 557
keyword-based, 39 in database design, 322
testing binary decompositions for
modes of interaction in IR sys- multiprogramming and, 744
nonadditive join property,
tems, 999 Processors, parallel, 1079
physical database design and, Program-data independence, 11–12,
Protocols
concurrency control, 777
processing in databases, 19–20 Program-operation independence, 12
deadlock prevention, 785–787
in Prolog languages, 973 Program variables, 599
for ensuring serializability of
retrieval queries from database Programming languages
transaction schedules, 767–768
tables, 494–495 advantages/disadvantages of, 477
Proximity queries, 1008
spatial, 958, 961 approaches to database program-
PSM (Persistent stored modules),
statistical, 859 ming, 449
TSQL2, 954–956 DBMS, 36–38
Public (asymmetric) key algorithms,
Query blocks, 681 impedance mismatch and, 450
Query-By-Example. See QBE object-orientation creating com-
Public keys, in public (asymmetric)
(Query-By-Example) patibility between, 369
key algorithm, 864
Query compilers, 41 Web databases. See PHP
Publishing XML documents, 431
Query decomposition, 905–907 XML, 432–436
Punctuation marks, text preprocess-
Query execution plans Programs, insulation between pro-
ing in information retrieval,
converting query trees into, grams and data, 11–13
709–710 PROJECT operations
Pure time conditions, 955
creating, 679 algorithms for, 696–697
QBE (Query-By-Example)
Query graphs Query processing and optimizing,
basic retrieval in, 1091–1095
creating, 679 696–697
domain calculus and, 183, 185
notation for, 179–180, 701–703 in relational algebra, 149–150
grouping, aggregation, and data-
Query languages Projection attributes, SELECT com-
base modification in,
DML as, 38 mand and, 98
for federated databases, 886 Projective operators, types of spatial
overview of, 1091
SQL. See also SQL (Structured operators, 961
QMF (Query Management Facility),
Query Language) Prolog language. See also Datalog
TSQL2. See also SQL (Structured language
Quadtrees, 963
Query Language) logic programming and, 970
Qualified aggregations, in UML class
Query Management Facility (QMF), notation, 970–973
diagrams, 228
185 Proof-theoretic interpretation, of
Qualified associations, in UML class
Query mapping, 901 rules in deductive databases,
diagrams, 228
Query modification, 135 975
Qualifier conditions, XPath, 432
Query optimizer, 41, 679 Properties, of association rules, 1041
Quality control, data warehousing
Query processing and optimizing Properties of relational decomposi-
and, 1080
aggregate functions, 698–699 tions
Quantifiers
collection operators in OQL,
bibliographic references, 725
1160 Index
converting query trees into query
RDBs (relational databases) execution plans, 709–710
distributed query processing
designing. See relational database cost components of query execu-
using semijoin operation, 904
design tion, 711–712
overview of, 901–902
overview of, 395–396 cost functions for JOIN , 715–718
query update and decomposition,
schemas. See relational database cost functions for SELECT ,
schemas 713–715
Query results
RDF (Resource Description DBMS module for, 20
cursors for looping over tuples in,
Framework), 436 disjunctive selection conditions,
Reachability, of objects, 363 688
ordering, 106–107
Read command, hard disks, 591 external sorting, 682–685
path expressions and, 400–402
Read-only transaction, 745 heuristic algebraic optimization
retrieval queries from database
READ operation, transactions, 751 algorithm, 708–709
tables, 494–495
Read (or Get) operation, on files, 600 heuristic optimization of query
Query (transaction) server, in two-
Read phase, of optimistic concur- trees, 703–706
tier client/server architecture,
47 rency control, 794 heuristics used in query optimiza-
Read-set, of transaction, 747 tion, 700–701
Query trees
Read timestamp, 789 hybrid hash-join, 696
converting into query execution
Read-write conflicts, in transaction implementing JOIN operations,
Read/write heads, on hard disks, 591 implementing SELECT opera-
notation for, 163–165, 701–703
Read/write, OSs controlling disk tions, 685
optimization of, 703–706
read/write, 40 join selection factors, 693–694
R-Trees, for spatial indexing, 962
Read-write transactions, 745–747 multiple relation queries and
RAID (Redundant Array of
read_item(X), 746 JOIN ordering, 718–719
Inexpensive Disks)
Real-time database technology, 3 nested-loop joins, 690–693
levels, 620–621
Reasoning mechanisms, in knowl- notation for query trees and
overview of, 617–619
edge representation, 268 query graphs, 701–703
performance improvements,
Recall metrics, in IR, 1015–1017, operations, 700
1019 OUTER JOIN operations, 699–700
reliability improvements, 619
Recall/precision curve, in IR, 1017 overview of, 679–681
RAM (Random Access Memory),
Record-at-a-time DMLs, 38 partition-hash joins, 694–696
Record-based data models, 31 PROJECT operations, 696–697
Random access storage devices, 592
Record pointers, 609 query optimization in Oracle,
Randomizing function (hash func-
Records. See also Files (of records) 721–722
tion), 606
anchor record (block anchor), 633 search methods for complex
Range queries, 686, 961
blocking, 597 selection, 686–687
Range relations, of tuple variables,
catalog information used in query search methods for simple selec-
cost estimation, 712 tion, 685–686
Rational Rose
fixed-length and variable-length, selectivity and cost estimates in
data modeler, 338
595–597 query optimization, 710–711
database design with, 337
inserting, 493–494 selectivity of conditions and,
tools and options for data model-
mixed, 616–617 687–688
ing, 338–342
ordered (sorted files), 603–606 semantic query optimization,
RBAC (role-based access control),
phantom records, concurrency 722–723
control techniques, 800–801 set operations, 697–698
RBG (red, blue, green) colors, 967
placing file records on disk, 594 summary and exercises, 723–725
RDBMS (relational database man-
spanned/unspanned, 597–598 transformation rules for relation-
agement systems)
in SQL/CLI, 464–468 al algebra operations, 706–708
creating indexes, 731
types of, 594–595 translating SQL queries into rela-
ORDBMS (object-relational data-
unordered (heap files), 601–602 tional algebra, 681–682
base management systems),
Recoverability, transaction sched- Query processing and optimizing, in
ules based o, 757–759 distributed databases
providing application flexibility,
Recovery. See also Backup and data transfer costs for distributed
two-tier client/server architec-
recovery; Database recovery
Index 1161
transaction management in dis-
integrity, referential integrity, and tributed databases, 912–913
Relational algebra
foreign keys, 73–74 types of failures and, 750–751
aggregate functions and grouping,
in list of data model types, 31 Recursive closure operations, in
mapping from EER model to. See relational algebra, 168–169
bibliographic references, 194–195
EER-to-Relational mapping Recursive relationships, 168, 215
CARTESIAN PRODUCT opera-
mapping from ER model to. See Recursive rules, in Prolog languages,
tion, 155–157
ER-to-Relational mapping 972
complete set of relational algebra
notation, 66–67 Red, blue, green (RBG) colors, 967
operations, 161, 164
other types of constraints, 74–75 REDO phase, of ARIES recovery
DIVISION operation, 162–163
overview of, 50, 59–60 algorithm, 823
EQUIJOIN and NATURAL JOIN
practical language for. See SQL Redo transaction, 753
operations, 159–161
(Structured Query Language) REDO , write-ahead logging and,
examples of queries in, 171–174
schemas, 70–73 810–811
generalized projection, 165–166
SQL compared with, 97 Redundancy, controlling in data-
JOIN operation, 157–158
summary and exercises, 79–85 bases, 17–18
notation for query trees, 163–165
transactions and, 79 Redundant Array of Inexpensive
OUTER JOIN operations,
update operations, 75–76, 78–79 Disks (RAID). See RAID
Relational database design (Redundant Array of
OUTER UNION operation,
algorithms for, 557, 566–567 Inexpensive Disks)
attribute semantics in, 503–507 REF keyword, specifying relation-
overview of, 145–146
bibliographic references, 302, 579 ships via reference, 376
PROJECT operation, 149–150
bottom-up approach to, 544 Reference types, OIDs using,
recursive closure operations,
Boyce-Codd normal form 373–374
(BCNF), 529–531 References
RENAME operation, 151–152
dependency preservation proper- foreign key, 73
SELECT operation, 147–149
ties of decompositions, representing object relationships,
sequences of operations, 151
summary and exercises, 185–194
dependency-preserving and non- specifying relationships via
transformation rules for opera-
additive join decomposition reference, 376
tions, 706–708
into 3NF schemas, 560–563 Referencing relations, 73
translating SQL queries into,
dependency-preserving decompo- Referential integrity constraints
sition into 3NF schemas, inclusion dependencies and, 571
UNION , INTERSECTION , and
558–559 integrity constraints in databases,
MINUS operations, 152–155
Relational calculus
disallowing possibility for spuri-
ous tuples, 510–513 relational data model and, 73–74
21 domain (relational) calculus,
domain-key normal form specifying in SQL, 95–96
(DKNF), 574–575 Reflexive associations, in UML class
overview of, 146–147
equivalence of sets of functional diagrams, 227
tuple relational calculus. See Tuple
dependencies, 549 Regression function, 1058
relational calculus
first normal form (1NF), 519–523 Regression, in data mining,
Relational completeness, of rela-
formal analysis of relational 1057–1058
tional query languages, 174
schemas, 513 Regression rule, 1057
Relational data model
formal definition of fourth nor- Regular entity types, 219, 287–288
bibliographic references, 85
mal form, 533–534, 568–570 Relation extension, 62
characteristics of relations, 63–66
functional dependencies based on Relation intension, 62
classifying DBMSs and, 49
arithmetic functions and pro- Relation nodes
concepts, 60–61
cedures, 572–574 notation for, 703
constraints, 67–70
functional dependency and, in query graphs, 179
correspondence to ER model, 293
513–516 Relation schemas
Delete operation, 77–78
general definition of second nor- domains and, 61
domains, attributes, tuples, and
mal form, 526–527 goodness of, 501–502
relations, 61–63
general definition of third normal in relational databases, 501
formal languages for. See
form, 528 Relation (table) level, assigning priv-
Relational algebra; Relational
calculus
goodness of relational schemas,
1162 Index
Relationships inference rules for functional and
inclusion dependencies, 571–572
Relational database management
in data modeling, 31 multivalued dependencies, 568
systems. See RDBMS (relational
in ODMG object model, 386 inference rules for functional
database management systems)
references to, 360 dependencies, 545–549
Relational database schemas
representing in OO systems, 356 informal guidelines for relational
algorithms for schema design,
specifying by reference, 376 schemas, 503, 513
symbols for, 1084 join dependencies and fifth nor-
bibliographic references, 542
University student database mal form, 534–535
clear semantics for attributes in,
example, 7 key definitions, 518–519
Relationships, in EER model mapping from EER model to
components of, 70–73
class/subclass relationships, 247 relational model. See EER-to-
disallowing possibility for spuri-
specific relationship types and, Relational mapping
ous tuples, 510–513
249–250 mapping from ER model to rela-
formal analysis of, 513
Relationships, in ER model tional model. See ER-to-
functional dependency and,
attributes of relationship types, Relational mapping
informal guidelines, 503, 513
minimal sets of functional
constraints on binary relationship dependencies, 549–551
overview of, 501–502
types, 216–218 multivalued dependency and
reducing NULL values in tuples,
degree of relationship greater fourth normal form, 531–533
than two, 228–232 nonadditive join decomposition
reducing redundant information
degree of relationship type, into 4NF relations, 570
in tuples, 507–509
213–214 nonadditive join decomposition
relation schemas in, 501
overview of, 212 into BCNF schemas, 559–560
summary and exercises, 535–542
relationship types, sets, and nonadditive (lossless) join prop-
Relational database state, 70
instances, 212–213 erties of decompositions,
Relational design by analysis, 543
relationships as attributes, 214 553–556
Relational design by synthesis, 544
role names and recursive relation- normal forms based on primary
Relational expressions, 983
ships, 215 keys, 516–517
Relational OLAP (ROLAP), 1079
Relevant sets, in probabilistic model normalization of relations,
Relational operators
for IR, 1005 517–518
in deductive database systems,
Reliability, in distributed databases, NULL values and dangling tuples
881, 882 and, 563–565
relational expressions and, 983
Remote commands, for SQL injec- overview of, 285
Relations (relation states). See also
tion attacks, 857 practical use of normal forms,
Tables
RENAME operation, in relational 518
alternative definition of, 64–65
algebra, 151–152 reducing NULL values in tuples,
column-based storage of, 669–670
Reorganize operation, on files, 600 509–510
defined, 61
Repeating field or groups, in file reducing redundant information
interpretation (meaning) of, 66
records, 595 in tuples, 507–509
legality of, 514
Repeating history, in ARIES recov- relational decomposition and
normalization of, 517–518
ery algorithm, 821 insufficiency of normal forms,
ordering tuples in, 63
Replication 552
ordering values within tuples, 64
active rules for maintaining con- second normal form (2NF), 523
overview of, 62–63
sistency of replicated tables, 943 successive nonadditive join
values and NULLS in tuples,
in distributed databases, 897 decompositions, 557
example of fragmentation, alloca- summary and exercises, 299–301,
Relations, temporal
tion, and replication, 898–901 575–578
bitemporal time, 950–952
transparency of, 880 template dependencies, 572
transaction time, 949–950
Representational (or implementa- testing binary decompositions for
valid time, 947–949
tion) data models, 31 nonadditive join property, 557
Relationship relation (lookup table)
Requirements collection and analy- third normal form (3NF),
mapping of binary 1:1 relation-
sis phase 523–525
ship types, 289
in database design, 200, 311–313 top-down and bottom-up
mapping of binary 1:N relation-
ship types, 290
database design starting with, 9
Index 1163
testing conflict serializability of, Resource Description Framework
Reset operations, on files, 599
Root tag, XML documents, 423
763–765 (RDF), 436
Roots, of tree structures, 646
Rotation. See Pivoting (rotation)
Schema
Response time, physical database
conceptual design, 313–321 design and, 326
Rotation invariant feature transform
entity type describing for entity Restrict option, of delete operation,
(RIFT), 968
Rotational delay (rd)
sets, 208
instances and database state and, Result equivalence, of transaction
77 as disk parameter, 1087
32–33 schedules, 762
on hard disks, 591
ontologies and, 272 Result relations, 75
Row-level access control, 852–853
relational. See Relational database Result tables, in QBE, 1095
Row-level triggers, 937
schemas Retrieval operations
Rows. See Tuples (rows)
relational data model and, 70–73 database design and, 728
Rows, in SQL, 89
three-schema architecture. See from database tables, 494–495
RSA encryption algorithm, 865
Three-schema architecture on files, 599
Rule consideration, in active
Schema construct, 32, 222 modes of interaction in IR
databases
Schema diagram, 32 systems, 999
deferred consideration, 942
Schema evolution, 33 objects, 362
overview of, 938–939
Schema matching, types of Web QBE (Query-By-Example),
Rule-defined predicates (views),
information integration, 1023 1091–1095
Schema, SQL types of relational data model
Rule sets, in active database systems,
change statements, 137–139 operations, 75
names, 89 Retrieval transactions, 322
Rules, in deductive databases
overview of, 89–90 Retroactive update, valid time rela-
interpretation of, 975–977
Schema (view) integration, 316–317, tions and, 949
overview of, 21, 932
319–321 Return values, of PHP functions,
in Prolog/Datalog notation,
Schemaless XML documents, 422 490
Scientific applications, 25 Reverse engineering, Rational Rose
safe, 979–980
Scope, variable, 490 and, 338
Runtime database processor
Scripting languages, PHP as, 482 Revoking privileges, 844, 845–846
DBMS component modules, 42
SCSI (Small Computer System Rewrite blocks, file organization
query execution and, 679
Interface), 591 and, 602
Runtime, specifying SQL queries at,
SDL (storage definition language), Rewrite time, as disk parameter,
Safe expressions, in tuple relational
Search engines RIFT (rotation invariant feature
calculus, 182–183
overview of, 998–999 transform), 968
Safe rules, in deductive databases,
vertical and metasearch, 1018 Rigorous two-phase locking, 785
Search fields, 648 Rivest, Ron, 865
Sampling algorithm, in data mining,
Search trees, 647–649 ROLAP (relational OLAP), 1079
SANs (Storage Area Networks),
Searches
Role-based access control (RBAC),
conversational, 1029–1030 851–852
faceted, 1028–1029 Role hierarchy, in role-based access
Saturation, hue, saturation, and
information retrieval. See IR control, 851
value (HSV), 967
(Information Retrieval) Role names, and recursive relation-
SAX (Simple API for XML), 423
measures of relevance, 1014–1015 ships, 215
Scale-invariant feature transform
methods for complex selection, Roll-up display
(SIFT), 968
686–687 functionality of data warehouses,
Scan operations, files, 600
methods for simple selection, 1078
Scanner, for SQL, 679
685–686 working with data cubes,
Schedules (histories), of transactions
navigational, informational, and 1070–1072
characterizing based on recover-
transactional, 996 ROLLBACK (or ABORT ) operation,
ability, 757–759
social searches, 1029 752
characterizing based on serializ-
Web. See Web search and analysis Rollbacks, in database recovery,
ability, 759–760
Second normal form (2NF) 813–815, 950
equivalence of, 768–770
overview of, 755–757
general definition of, 526–527
1164 Index
Secondary file organization, 587
describing knowledge discovered Secondary indexes
Selective inheritance, in ODBs
by data mining, 1039 advantages of, 668
(object databases), 368
discovery of, 1057 cost functions for SELECT, 714
Selectivity and cost estimates, in
in pattern discovery phase of Web methods for simple selection, 686
query optimization
usage analysis, 1027 overview of, 636–642
catalog information used in cost
Serial schedules, 761 tables comparing index types, 642
functions, 712–713
Serializability, of transaction types of ordered indexes, 632–633
cost components of query execu-
schedules Secondary keys, 636
tion, 711–712
characterizing schedules based Secondary storage, 584, 711
cost functions for JOIN , 715–718
on, 759–760 Secret key algorithms, 863
cost functions for SELECT ,
serial, nonserial, and conflict- Sectors, of hard disk, 589
serializable schedules, 761–763 Security
multiple relation queries and
testing conflict serializability of vs. precision, 841
JOIN ordering, 718–719
schedules, 763–765 Web security, 1028
overview of, 710–711
used for concurrency control, Security and authorization subsys-
Selectivity, of conditions, 687–688
765–768 tem, DBMS, 19
Self-describing data, 10–11, 416
view serializability, 768–769 Security, database. See Database
Semantic constraints
Serialization (precedence) graph, security
relational model constraints, 68
763–765 Seek time (s)
template dependencies and, 572
types of constraints, 74
Servers
as disk parameter, 1087
client program calling database on hard disks, 591
Semantic data models
server, 451 Segmentation, automatic analysis of
abstraction concepts in, 268
database servers, 42 images, 967
aggregation and association,
DBMS module for, 29 SELECT command, SQL
parallel architecture for, 1079 aggregate functions used in, 125
classification and instantiation, 268
PHP variables, 490–491 basic form of, 97–98
compared with knowledge repre-
server level in two-tier client/ FROM clause, 107
sentation, 267–268
server architecture, 47 DISTINCT keyword with, 103
ER (Entity-Relationship) model,
specialized servers in client/server information retrieval with, 97
architecture, 45–46 projection attributes and selec-
identification, 269
Set-at-a-time DMLs, 38 tion conditions, 98, 100
for information retrieval,
Set constructor, 359 in SQL retrieval queries, 129–130
SET DIFFERENCE operation SELECT-FROM-WHERE structure,
specialization and generalization,
algorithms for, 697–698 of SQL queries, 98–100
in relational algebra, 152–155 SELECT operations
Semantic query optimization,
Set null (set default) option, in cost functions for, 713–715
delete operations, 77–78 disjunctive selection conditions,
Semantic relationships, in semantic
Set operations 688
model for IR, 1006
algorithms for, 697–698 on files, 599
Semantic Web, 272–273
query processing and optimizing, implementing, 685
Semantics
697–698 in relational algebra, 147–149
approach to IR, 1000
SQL, 104 search methods for complex
of attributes, 503–507, 514
Set types, in network data model, 51 selection, 686–687
equivalence of transaction sched-
ules and, 769–770
Sets
search methods for simple selec-
equivalence of, 549 tion, 685–686
heterogeneity of in federated
explicit sets of values in SQL, 122 selectivity of conditions, 687–688
databases, 886–887
SQL table as multiset of tuples, 97 SELECT operator ( σ), 147
integrity constraints and, 21
tables as, 103–105 Select-project-join queries, 179
tagging images, 969
Shadow directory, 820 Selection cardinality, 712
Semijoin operation, 904
Shadow paging, 820–821 Selection conditions
Semistructured data, 416–417
Shamir, Adi, 865 in domain calculus, 184
Separators, XPath, 432
Shape, automatic analysis of images, SELECT command and, 98, 100
Sequence diagrams, UML, 329, 331
Sequential order, in accessing data
SELECT operation and, 147
blocks, 592
Shape descriptors, 965
Index 1165
Shared subclasses (multiple inheri-
Specialized servers, in client/server tance), 256, 297
Social searches, 1029
architecture, 45 Shared variables, embedded SQL
Software costs, choosing a DBMS,
Specific attributes (local attributes), and, 452
of subclass, 249 Sharing data and multiuser transac-
Software developers, 16
Specific relationship types, sub- tions, 13–14
Software engineers
classes and, 249–250 Sharing databases, 6
database actors on the scene, 16
Specification, conceptualization and, Shrinking (second) phase, in two-
design and testing of applications,
Speech input and output, queries SIFT (scale-invariant feature
phase locking, 782
Sort-merge joins
and, 39 transform), 968
cost functions for, 717
SQL-99, 942–943 Simple API for XML (SAX), 423
methods for implementing joins,
SQL/CLI (Call Level Interface) Simple (atomic) attributes, in ER
database programming with, model, 205–207
Sort-merge strategy, 683
464–468 Simple Object Access Protocol
Sorting
library of functions, 448 (SOAP), 436
external, 682–685
SQL injection attacks Simultaneous update, 949
functionality of data warehouses,
code injection, 856 Single inheritance, subclasses and,
function call injection, 856–857 256–257
implementing aggregate opera-
protecting against, 858 Single-level indexes
tions, 699
risks associated with, 857–858 clustering indexes, 635–636
ordered records (sorted files),
SQL manipulation, 856 overview of, 632–633
types of, 855 primary indexes, 633–635
Space utilization, physical database
SQL programming techniques secondary indexes, 636–642
design and, 326
approaches to database program- tables comparing index types, 642
Spamming, Web spamming, 1028
ming, 449–450 Single-loop joins
Spanned/unspanned organization,
bibliographic references, 479 cost functions for, 716
of records, 597
database programming tech- methods for implementing joins,
Sparse indexes, 633
niques and issues, 448–449 689
Spatial analysis, 959
dynamic SQL, 448, 458–459 Single-quoted strings, PHP text
Spatial applications, 25
embedded SQL. See Embedded processing, 485–486
Spatial databases
SQL Single-relation options, for mapping
applications of spatial data,
function calls. See Function calls, specialization or generalization,
database programming with 295
data indexing, 961–963
impedance mismatch, 450 Single-sided disks, 589
data mining, 963–964
overview of, 447–448 Single time points, in temporal
data types and models, 959–960
sequence of interactions in, 451 databases, 946
dynamic operators, 961
SQL/PSM (SQL/Persistent Stored Single-user systems, 49
operators, 960–961
Modules). See SQL/PSM (SQL/ Single-user transaction processing
overview of, 957–959
Persistent Stored Modules) system, 744–745
Spatial joins/overlays, 961
summary and exercises, 477–478 Single-valued attributes, in ER
Spatial outliers, 965
SQL/PSM (SQL/Persistent Stored model, 206
Special purpose DBMSs, 50
Modules) Singular value decompositions
Specialization/generalization
overview of, 473 (SVD), 967
constraints on, 251–254
specifying persistent stored Slice and dice, functionality of data
definitions, 264
modules, 475–476 warehouses, 1078
design choices for, 263–264
stored procedures and functions, Small Computer System Interface
EER-to-Relational mapping,
473–475 (SCSI), 591
SQL (Structured Query Language). SMART document retrieval system,
generalization, 250–251
See also Embedded SQL 998
hierarchies and lattices, 254–257
* (asterisk) for retrieving all SMP (symmetric multiprocessor),
in knowledge representation, 269
attribute values of selected 1079
notation for, 1084–1085
tuples, 102–103 Snowflake schema, for multidimen-
refining conceptual schemas,
aliases, 101–102 sional data models, 1073–1074
specialization, 248–250
bibliographic references, 114
16 Index
clauses in simple SQL queries,
Statechart diagrams, UML, 329, 333 107
CREATE VIEW command,
Statement-level active rules, in common data types, 92–94
STARBURST example, 940–942 CREATE TABLE command, 90–92
DROP command, 138
Statement-level triggers data definition in, 89
EXISTS and NOT EXISTS func-
overview of, 937 dealing with ambiguous attribute
tions, 120–122
in STARBURST example, 940 names, 100–101
explicit sets and renaming of
Statement records, in SQL/CLI, DELETE command, 109
attributes, 122
464–468 embedding SQL commands in
GROUP BY clause, 126–129
Static (early) binding, in ODMS, Java, 459–461
HAVING clause, 127–129
inline views, 137
external sorting, 682–685
Static files, 601 INSERT command, 107–109
nested queries, 117–119
Static hashing, 610 list of features in, 110–111
outer and inner joins, 123–124
Static Web pages, 420 manipulation by SQL injection
overview of, 115
Statistical analysis, in pattern dis- attacks, 856
schema change statements, 137
covery phase of Web usage missing or unspecified WHERE
summary and exercises, 139–143
analysis, 1026 clauses, 102
UNIQUE function, 122
Statistical approach, to IR, naming constraints, 96–97
view implementation and update,
1000–1002 object-relational features in, 354
Statistical database security, 859–860 ordering query results, 106–107
views (virtual tables) in, 133–134
Statistical databases, 837–838, 874 overview of, 87–89
SQL (Structured Query Language),
Statistical queries, 859 QBE compared with, 1098
ODB extensions to
Steal/no-steal techniques schema and catalog concepts in,
dot notation for build path
in database recovery, 811–812 89–90
expressions, 376
UNDO/REDO recovery algorithm, SELECT-FROM-WHERE structure
encapsulation of operations,
Stem, of words, 1010 servers, 47
of queries, 98–100
inheritance and polymorphism,
Stemming, text preprocessing in specifying attribute constraints
information retrieval, 1010 and default values, 94–95
OIDs (object identifiers) using
Stopwords specifying key and referential
reference types, 373–374
in keyword queries, 1007 integrity constraints, 95–96
overview of, 369–370
removal, 1009–1010 substring pattern matching and
specifying relationships via refer-
text/document sources, 966 arithmetic operators, 105–106
ence, 376
tables based on UDTs, 374
Storage
allocation of file blocks on disk, tables as sets in, 103–105
summary and exercises, 111–114
UDTs and complex structures for
objects, 370–373
temporal data types, 945
bibliographic references, 630 transaction support, 770–772
SQLJ
buffer management and, 593–594 translating SQL queries into rela-
embedding SQL command in
column-based storage of rela- tional algebra, 681–682
Java, 459–461
tions, 669–670 UDT (user-defined types) in, 111
retrieving multiple tuples using
cost components of query execu- UPDATE command, 109–110
iterators, 461–464
tion, 711 SQL (Structured Query Language),
SQLODE communication variable,
covert channels, 861 advanced features
database storage, 586–587 aggregate functions, 124–126
SQLSTATE communication variable,
database storage reorganization, ALTER command, 138–139
bibliographic references, 143
database tuning and, 733 clauses in retrieval queries,
database approach and, 22
file headers (descriptors) and, 598 129–130
database design specification, 328
file systems and. See Files (of comparisons involving NULL and
SQL, 88
records) three-valued logic, 116–117
Star schema, 1073
files, fixed-length records, and correlated nested queries,
Starvation, concurrency control
variable-length records, 119–120
and, 788
595–597 CREATE ASSERTION command,
State
hardware structures of disk 131–132
in ODMG object model, 382
relational database state, 70–72
devices, 588–592
Index 1167
measuring capacity, 585
recovery needed due to system memory hierarchies and, 584–586
specific attributes (local attrib-
error, 750 NAS (network-attached storage),
utes) of, 249
security issues at system level, 836 622–623
specific relationship types and,
System designers, 16 overview of, 583–584
System environment parallelization of access. See RAID
union types or categories,
DBMS module, 40–42 (Redundant Array of
tools, application environments, Inexpensive Disks)
Subset of Cartesian product, 63
and communication facilities, placing file records on disk, 594
Subsets, of attributes, 68–69
43–44 record blocking and, 597
Substring pattern matching, in SQL,
utilities for, 42–43 records and record types, 594–595
System independent mapping, in SANs (Storage Area Networks),
Subtrees, 646
choosing a DBMS, 326 621–622
Subtypes, 247, 365–366
System logs. See also Logs/logging secondary storage devices, 587
SUM function
auditing and, 839–840 spanned/unspanned records,
aggregate functions in SQL,
database recovery and, 808 597–598
tracking transaction operations, summary and exercises, 624–630
grouping and, 166, 168
753–754 Storage Area Networks (SANs),
implementing aggregate opera-
Systems analyst, 16 621–622
tions, 698
Table inheritance, in SQL, 376 Storage definition language (SDL),
Superclass/subclass relationships
in EER model, 264
Tables
ALTER TABLE command, 138–139 Storage medium, physical, 584
overview of, 247
assigning privileges at table level, Stored attributes, in ER model, 206
union types or categories,
842–843 Stored data manager module,
base tables (relations) vs. virtual DBMS, 40, 42
Superclasses
relations, 90 Stored procedures, 21, 473–475
base class and, 265
basing on UDTs, 374 Stream-based processing, 700
in EER model, 246–248, 264
DROP TABLE command, 138 Streaming XML documents, 423
generalization and, 250
in relational model, 60, 61 Strict hierarchies, 255
options for mapping specializa-
retrieval queries from database Strict schedules, 759
tion or generalization, 294
tables, 494–495 Strict timestamp ordering, 790–791
specialization and, 248
in SQL, 89 Strict two-phase locking, 784–785
Superkeys
SQL table as multiset of tuples, Strings
defined, 518
97, 103–105 pattern matching, 105
relational model constraints, 69
virtual. See Views PHP text processing, 485
Supertypes, 247, 365
Superuser accounts, 838
Tags
Strong entity types, 219, 287
HTML, 418–419 Struct (tuple) constructors, 358–359
Supervised learning
semistructured data and, 417 Structural constraints, of relation-
classification and, 1051
Tape jukeboxes, 586 ships, 218
neural networks and, 1058
Tape, magnetic, 592–593 Structural diagrams, UML, 329
Support, for association rules, 1040
Tape reel, 592 Structured data
Surrogate keys, 298
Taxonomies, 272 extracting, 1022
Survivability, challenges in database
Technical metadata, in data ware- overview of, 416
security, 867
housing, 1078 vs. unstructured, 993–994
SVD (singular value decomposi-
Templates Structured domains, in UML class
tions), 967
dependencies, 572 diagrams, 227
Symmetric key algorithms, 863
in Query-By-Example, 1091 Structured literals, 378
Symmetric multiprocessor (SMP),
Temporal aggregation, 957 Subclasses
Temporal databases in EER model, 246–248, 264
Synonyms, thesaurus as collection
attribute versioning for incorpo- generalizing into superclasses, 250
of, 1010
rating time in OODBs, as leaf classes in UML, 265
Syntactic analysis, in semantic
953–954 options for mapping specializa-
model for IR, 1006
bitemporal time relations, tion or generalization, 294
System
950–952 predicate-defined and user-
accounts, 838
catalog, 42
options for storing tuples in tem-
1168 Index
querying constructs using TSQL2
Timing channels, covert, 861 language, 954–956
text preprocessing in information
TO. See Timestamp ordering (TO) time representation, calendars
retrieval, 1010–1011
Tool developers, 17 and time dimensions, 945–947
Third normal form (3NF)
Tools, DBMS, 43–44 time series data, 957
dependency-preserving and non-
Top-down methodology transaction time relations,
additive join decomposition
for conceptual refinement, 257 949–950
into, 558–563
for database design, 502 valid time relations, 947–949
dependency-preserving decompo-
for schema design, 315–316 Temporal intersection join, 952
sition into, 558–559
Topical relevance, in IR, 1015 Temporal normal form, 952
general definition of, 528
Topological operators, 960 Temporal variables, 948
overview of, 523–525
Topological relationships, among Temporary updates (dirty reads),
Thomas’s write rule, 791
spatial objects, 959 concurrency control and,
Threats, to database security,
Topologies, network, 879 748–749
Total categories, 260 Term frequency-inverse document
Three-phase commit (3PC) proto-
Total participation, binary relation- frequency. See TF-IDF (term
col, 908
ships and, 217 frequency-inverse document
three-schema architecture
Total specialization constraint, 253 frequency)
data independence and, 35–36
Tracks, on hard disks, 589 Terminated state, transactions, 752
levels of, 34–35
Trade-off analysis, 345 Terms (keywords)
overview of, 33
Training costs, in choosing a DBMS, modes of interaction in IR
Three-tier architectures
323–324 systems, 999
client/server architecture,
Transaction-id, 753 sets of terms in Boolean model
Transaction processing systems for IR, 1002
PHP, 482
ACID properties, 754–755 Ternary relationships
for Web applications, 47–49
bibliographic references, 775 choosing between binary and ter-
Three-valued logic, 116–117
characterizing schedules based on nary relationships, 228–231
Time constraints, on queries and
recoverability, 757–759 constraints on, 232
transactions, 729
characterizing schedules based on in ER (Entity-Relationship)
TIME data type, 945
serializability, 759–760 model, 213–214
Time dimensions, in temporal data-
commit point of transactions, Tertiary storage, 584, 586
bases, 945–947
Time periods, in temporal data-
Testing
concurrency control, 747–750 conflict serializability of sched-
bases, 946
database design and, 306 ules, 763–765
Time representation, in temporal
equivalence of schedules, 769–770 in database application life cycle,
databases, 945–947
overview of, 743–744 308
Time series
recovery, 750–751 Texels (texture elements), 967
management systems, 957
schedules (histories) of transac- Text
patterns in, 1039, 1057
tions, 756–757 preprocessing in information
as specialized database applica-
serial, nonserial, and conflict- retrieval, 1009–1012
tions, 25
serializable schedules, 761–763 sources in multimedia databases,
in temporal databases, 946, 957
serializability used for concurren- 966
Time-varying attributes, 953
cy control, 765–768 storing XML document as, 431
Timeouts, for dealing with dead-
single-user vs. multiuser, 744–745 Texture, automatic analysis of
locks, 788
SQL support for transactions, images, 967
TIMESTAMP data type, SQL, 93, 945
770–772 TF-IDF (term frequency-inverse
Timestamp ordering (TO)
summary and exercises, 772–774 document frequency)
basic, 789–790
system log, 753–754 applying to inverted indexing, 1013
for concurrency control, 777
testing conflict serializability of in vector space model for IR,
multiversion technique based on,
schedules, 763–765 1003–1004
transaction states and operations, Thematic analysis, for spatial data-
strict timestamp ordering,
751–752 bases, 959
transactions, database items, Theorem proving, in deductive
Thomas’s write rule, 791
read/write operations, and databases, 976
Timestamps
overview of, 789
DBMS buffers, 745–747
Index 1169
Transaction processing systems, in
tuple variables and range rela- distributed databases
Tree data models. See Hierarchical
tions, 175–176 catalog management, 913
data models
universal quantifier used in concurrency control, 909–912
Tree structures. See also B+-trees;
queries, 180–182 operating system support, 909
B-trees
Tuple versioning approach, to overview of, 907–908
decision making in database
implementing temporal data- recovery, 912–913
design, 730
bases, 947–953 two-phase and three-phase com-
FP-tree (frequent-pattern tree)
bitemporal time relations, mit protocols, 908–909
algorithm, 1043–1045
950–952 Transaction Table, in ARIES recov-
leaf-deep trees, 718
implementation considerations, ery algorithm, 822
overview of, 646–647
952–953 Transaction time, in temporal data-
R-trees, 962
transaction time relations and, bases, 946
search trees, 647–649
949–950 Transaction time relations, in tem-
specialization hierarchy, 255
valid time relations and, poral databases, 949–950
TV-trees (telescoping vector
947–949 Transaction timestamp, 786
trees), 967
Tuples (rows) Transactional databases, distinguish-
Triggers
classification in mandatory access ing data warehouses from,
active rules specified by, 933
control, 848 1069
associating with database tables,
21 combining using JOIN operation, Transactional searches, 996
157–158 Transactions
before, after, and instead triggers,
comparison of values in, 118 ACID properties, 754–755
component values of, 67 canned, 15
CREATE TABLE command,
dangling tuples in relational commit point of, 754
design, 563–565 committed and aborted, 750
CREATE TRIGGER command,
defined, 61 defined, 6
disallowing spurious, 510–513 designing, 322–323
creating in SQL, 111
eliminating duplicates, 150 interactive, 801
overview of, 932
hypothesis tuples, 572 multiuser, 13–14
row-level and statement-level,
n-tuple for relations, 62 recovery needed due to transac-
ordering in relations, 64 tion error, 750
specifying constraints, 74
ordering values within, 64–65 relational data model and, 79
in SQL-99, 942–943
reducing NULL values in, schedules (histories) of, 756–757
Truth values, of atoms, 184
509–510 SQL transaction control com-
TSQL2 language, 954–956
reducing redundant information mands, 111
Tuning databases
in, 507–509 states and operations, 751–752
design, 735–736
retrieving all attribute values of throughput in physical database
guidelines for, 738–739
selected, 102–103 design, 327
implementation and, 311
retrieving multiple tuples in types of, 745
indexes, 734–735
SQLJ, 461–464 Transfer rate (tr), disk blocks, 1088
overview of, 733–734
retrieving multiple tuples using Transformation approach, to image
queries, 736–738
cursors, 455–457 database queries, 966
system implementation and
SQL table as multiset of, 97 Transience
tuning, 327–328
storing in temporal relations, collections, 367
Tuple-based constraints, 97
952–953 data, 586
Tuple relational calculus
unspecified WHERE clause and, object lifetime and, 378
examples of queries in, 178–179
102 objects, 355, 363
existential and universal quanti-
valid time relations and, 948 Transition constraints, 75
fiers, 177–178
values and NULLS in, 65–66 Transition tables, in STARBURST
expressions and formulas,
versioning for incorporating time example, 940
in relational databases, 953 Transitive closure, of relations, 168
notation for query graphs,
Tuples variables Transitive dependencies, in 3NF,
aliases and, 101 523–524
overview of, 174–175
looping with iterators, 98 Transparency
safe expressions, 182–183
SQL based on, 88
range relations and, 175–176
1170 Index
Two-phase commit (2PC) protocol
Universal relation assumption, 552 recovery in multidatabase sys-
Unary relational operations
Universal relation schema, 552 tems, 825–826
CARTESIAN PRODUCT opera-
Universal relations, 544 transaction management in dis-
tion, 155–157
Universe of discourse (UoD), 4 tributed databases, 908
overview of, 146
University student database example Two-phase locking
PROJECT operation, 149–150
data records in, 6–9 basic locks, 784
SELECT operation, 147–149
EER schema applied to, 260–263 binary locks, 778–780
UNION , INTERSECTION , and
Unordered (heap files) records, conversion of locks, 782
MINUS operations, 152–155
601–602 overview of, 777–778
Unbalanced trees, 646
Unrepeatable read problem, 750 serializability guaranteed by,
Unconstrained write assumption,
Unstructured data 782–784
HTML and, 418–420 shared/exclusive (read/write)
UNDO/NO-REDO recovery
information retrieval dealing locks, 780–782
immediate update techniques,
with, 993–994 variations on two-phase locking,
Unsupervised learning 784–785
overview of, 807, 809
clustering and, 1054 Two-tier client/server architecture,
Undo operations, transactions, 753
neural networks and, 1058 46–47
UNDO phase, of ARIES recovery
UoD (universe of discourse), 4 Two-way joins, 689
algorithm, 823
Update anomalies, avoiding redun- Type (class) hierarchies
UNDO/REDO recovery
dant information in tuples, constraints on extents corres-
immediate update techniques,
UPDATE command, SQL inheritance and, 369
ponding to, 366–367
overview of, 807, 809
active rules and, 936 in OO systems, 356
UNDO , write-ahead logging and,
overview of, 109–110 simple model for inheritance,
Update operations 364–366
Unidirectional associations, in UML
bitemporal databases and, 950 Type-compatible relations, 697
class diagrams, 227
database design and, 728 Type constructors
Unified Modeling Language. See
factors influencing physical data- atom constructor, 358
UML (Unified Modeling
base design, 729 collection constructor, 359
Language)
operations on files, 599 defined, 369
UNION operation
query processing in distributed ODB features included in SQL,
algorithms for, 697–698
databases, 905–907 370
in relational algebra, 152–155
in relational data model, 78–79 ODL and, 359–360
SQL set operations, 104
types of relational data model struct (tuple) constructor,
Union types (categories)
operations, 75 358–359
EER-to-Relational mapping,
Update transactions, 322 Type generator, 358–359
Usage projections, data warehousing UDT (user-defined types)
modeling, 258–260
and, 1080 creating, 370–373
UNIQUE function, SQL, 122
Use case diagrams, UML, 329–331 in SQL, 111
Unique identity, in ODMS, 357
User accounts, database security tables based on, 374
UNIQUE KEY clause, CREATE
and, 839–840 UML (Unified Modeling Language)
TABLE command, 96
User-defined subclasses, 252, 264 class diagrams, 226–228
Unique keys, in relational models, 70
User-defined time, 947 for database application design,
Uniqueness constraints
User-defined types. See UDT (user- 329
on entity attributes, 208–209
defined types) as design specification standard,
factors influencing physical data-
User-friendly interfaces, 38 328
base design, 729
User interfaces diagram types, 329–334
integrity constraints in databases,
21 GUIs (graphical user interfaces), notation for ER diagrams, 224
20, 39, 1061 object modeling with, 200
overview of, 68–70
multiple users, 20 representing specialization/gener-
specifying in SQL, 95–96
User labels, combining with data alization in, 265–266
Universal quantifiers
labels, 869–870 University student database
transforming, 180
in tuple relational calculus,
classifying DBMSs by number of,
Index 1171
database actors on the scene,
Virtual tables. See Views (virtual 15–16
scope, 490
tables), SQL measures of relevance in IR, 1015
shared, 452
Visible/hidden attributes, of objects, multiuser transactions, 13–14
types of users in information
Vocabularies retrieval, 995–996
VDL (view definition language), 37
in inverted indexing, 1012 Utilities, DBMS system, 42–43
Vector space model, for information
searching, 1013–1014 Valid event data, 957
retrieval, 1003–1005
Volatile storage, 586 Valid state
Vertical fragmentation, in distrib-
Voting method, distributed concur- database states, 33
uted databases, 881, 895
rency control based on, 912 relational databases, 71
Vertical partitioning, database tun-
VPDs (virtual private databases), Valid time databases, 946
ing and, 735
868–869 Valid time, in temporal databases,
Vertical propagation, of privileges,
Wait-die transaction timestamp, 786 946
Wait-for graph, 787 Valid time relations, in temporal
Vertical search engines, 1018
WAL (write-ahead logging), databases, 947–949
Very large databases, 586
810–812 valid XML documents, 422–425
Victim selection algorithm, for
WANs (wide area networks), 879 Validation
deadlock prevention, 788
Weak entity types, 219–220, in database application life cycle,
Video applications, 25
Video clips, in multimedia data-
bases, 932, 965
Web
access control policies for, Validation (optimistic) concurrency
of queries, 679
Video segments, in multimedia
854–855 control, 777, 794–795
databases, 966
hypertext documents and, 415 Validation phase, of optimistic con-
Video sources, in multimedia data-
interchanging data on, 24 currency control, 794
bases, 966
Web analysis, 1019, 1027 Value, hue, saturation, and, 967
View definition language (VDL), 37
Web applications, architectures for, Value references, in RDBs, 396
View equivalence, of transaction
47–49 Value sets (domains), of attributes,
schedules, 768–769
Web-based user interfaces, 38 209–210
View integration approach, in con-
Web browsers, 38 Values
ceptual schema design, 315
Web clients, 38 stored in records, 594
View materialization, 135
Web content analysis in tuples, 65–66
View serializability, of transaction
agent-based approach to, Values (literals)
schedules, 768–769
1024–1025 atomic formulas as, 973
Views
concept hierarchies in, 1024 atomic literals, 378
data warehouses compared with,
database-based approach to, 1025 collection literals, 382
ontologies and, 1023–1024 complex types for, 358–360
database designers creating, 15
overview of, 1022 in OO systems, 358
granting/revoking privileges, 844
segmenting Web pages and structured literals, 378
multiple views of data supported
detecting noise, 1024 Variable-length records, 595–597
in databases, 12
structured data extraction, 1022 Variables
specifying as named queries in
types of Web analysis, 1019 bind variables (parameterized
OQL, 402–403
Web information integration, statements), 858
Views (virtual tables), SQL
1022–1023 communication variables in SQL,
vs. base tables, 134
Web crawlers, 1028 454
CREATE VIEW command,
Web databases, programming. See domain, 183
PHP instance, 356
implementation and update,
Web forms, collecting data iterator variables, in OQL,
from/inserting record into, 399–400
inline views, 137
493–494 limited, 980
overview of, 89, 133–134
Web interface, for database applica- PHP, 485–486
Virtual data, in views, 12
tions, 449 PHP server, 490–491
Virtual data warehouses, 1070
Web Ontology Language (OWL), 969 PHP variable names, 484–485
Virtual private databases (VPDs),
Web pages program, 599
Virtual relations, specifying with
analyzing link structure of,
1172 Index
XML (eXtended Markup Language) ranking, 1000
content analysis, 1024
preprocessing phase of,
data model, 51 Web query interface integration,
1025–1026
interchanging data on Web using, 1023
types of Web analysis, 1019
24
Well-formed XML, 422–425
Web search and analysis
XML (Extensible Markup Language) analyzing link structure of Web
WHERE clause
bibliographic references, 443 pages, 1020–1021
DELETE command, 109
converting graphs into trees, 441 comparing with information
explicit sets of values in, 122
hierarchical (tree) data model, retrieval, 1018–1019
missing or unspecified, 102
420–422 HITS ranking algorithm,
in SQL retrieval queries, 129–130
hierarchical XML views over flat 1021–1022
UPDATE command, 109–110
or graph-based data, 436–440 overview of, 1018
Wide area networks (WANs), 879
languages, 432 PageRank algorithm, 1021
Wildcard (*)
languages related to, 436 practical uses of Web analysis,
types of queries in IR systems,
overview of, 415–416 1027–1028
1008–1009
storing/extracting XML docu- searching the Web, 1020
using with XPath, 433
ments from databases, Web content analysis, 1022–1025
WITH CHECK OPTION , view
431–432, 442 Web searches combining brows-
updates and, 137
structured, semistructured, and ing and retrieval, 1000
WordNet thesaurus, 1011
unstructured data, 416–420 Web usage analysis, 1025–1027
Wound-wait transaction timestamp,
summary and exercises, 442–443 Web security, 1028
786
well-formed and valid docu- Web servers
Wrappers, structured data extrac-
ments, 422–425 middle tier in three-tier architec-
tion and, 1022
XML schema language, 425–430 ture, 48
Write-ahead logging (WAL),
XPath, 432–434 specialized servers in client/server
810–812
XQuery, 434–435 architecture, 45
Write command, hard disks and,
XML schema language, 425–430 Web Services Description Language
591
example schema file, 426–428 (WSDL), 436
Write phase, of optimistic concur-
list of concepts in, 428–429 Web spamming, 1028
rency control, 794
overview of, 425 Web structure analysis
Write-set, of transactions, 747
XPath, 432–434 analyzing link structure of Web
Write timestamp, 789
XQuery, 434–435 pages, 1020–1022
Write-write conflicts, in transaction
XSL (Extensible Stylesheet types of Web analysis, 1019
schedules, 757
Language), 415, 436 Web usage analysis
write_item(X), 746
XSLT (Extensible Stylesheet pattern analysis phase of, 1027
WSDL (Web Services Description
Language Transformations), pattern discovery phase of,
Language), 436
415, 436 1026–1027
XML access control, 853–854
XML declaration, 423