Elmasri R., Navathe S.B. Fundamentals of Database Systems
Подождите немного. Документ загружается.
Youssefi, K. and Wong, E. [1979] “Query Processing in a
Relational Database Management System,” in VLDB
[1979].
Zadeh, L. [1983] “The Role of Fuzzy Logic in the
Management of Uncertainty in Expert Systems,” in
Fuzzy Sets and Systems, 11, North-Holland, 1983.
Zaniolo, C. [1976] “Analysis and Design of Relational
Schemata for Database Systems,” Ph.D. dissertation,
University of California, Los Angeles, 1976.
Zaniolo, C. [1988] “Design and Implementation of a Logic
Based Language for Data Intensive Applications,”
ICLP/SLP 1988, pp. 1666–1687.
Zaniolo, C. [1990] “Deductive Databases: Theory meets
Practice,” in EDBT,1990, pp. 1–15.
Zaniolo, C. et al. [1986] “Object-Oriented Database
Systems and Knowledge Systems,” in EDS [1984].
Zaniolo, C. et al. [1997] Advanced Database Systems,
Morgan Kaufmann, 1997.
Zantinge, D., and Adriaans, P. [1996] Managing Client
Server, Addison-Wesley, 1996.
Zave, P. [1997] “Classification of Research Efforts in
Requirements Engineering,” ACM Computing
Surveys, 29:4, December 1997.
Zeiler, Michael. [1999] Modeling Our World—The ESRI
Guide to Geodatabase Design, 1999.
Zhang, T., Ramakrishnan, R., and Livny, M. [1996] “Birch:
An Efficient Data Clustering Method for Very Large
Databases,” in SIGMOD [1996].
Zhao, R., and Grosky, W. [2002] “Bridging the Semantic
Gap in Image Retrieval,” in Distributed Multimedia
Databases: Techniques and Applications (Shih, T. K.,
ed.), Idea Publishing, 2002.
Zhou, X., and Pu, P. [2002] “Visual and Multimedia
Information Management,” Proc. Sixth Working Conf.
on Visual Database Systems, Zhou, X., and Pu, P. (eds.),
Brisbane Australia, IFIP Conference Proceedings 216,
Kluwer, 2002.
Zicari, R. [1991] “A Framework for Schema Updates in an
Object-Oriented Database System,” in ICDE [1991].
Zloof, M. [1975] “Query by Example,” NCC, AFIPS, 44,
1975.
Zloof, M. [1982] “Office By Example: A Business Language
That Unifies Data, Word Processing, and Electronic
Mail,” IBM Systems Journal, 21:3, 1982.
Zobel, J., Moffat, A., and Sacks-Davis, R. [1992] “An
Efficient Indexing Technique for Full-Text Database
Systems,” in VLDB [1992].
Zvieli, A. [1986] “A Fuzzy Relational Calculus,” in EDS
[1986].
1132 Bibliography
1133
Index
* (asterisk), for retrieving all attrib-
ute values of selected tuples,
102–103
* (wildcard symbol)
types of queries in IR systems,
1008–1009
using with XPath, 433
. (concatenate operator), in PHP,
485
|| (concatenate operator), in SQL,
105
1NF (first normal form), 65,
519–523
2NF (Second normal form)
general definition of, 526–527
overview of, 523
2PC (two-phase commit) protocol
recovery in multidatabase sys-
tems, 825–826
transaction management in dis-
tributed databases, 908
3NF (third normal form). See Third
normal form (3NF)
3PC (three-phase commit) protocol,
908
4NF (fourth normal form). See
Fourth normal form (4NF)
5NF (fifth normal form), 534–535
Aborted transactions
recovery process and, 812
types of transactions, 750
Abstraction
aggregation and, 269
association and, 270
concepts in semantic data models,
268
identification and, 269
Access control
database security, 839–840
MAC (mandatory access control),
847–850
mandatory vs. discretionary,
850–851
policies for e-commerce and Web,
854–855
RBAC (role-based access control),
851–852
restricting unauthorized access,
18–19
row-level access control, 852–853
security control measures, 837
user authorization and, 841
in XML, 853–854
Access matrix model, for discre-
tionary privileges, 843
Access methods, file organization
and, 601
Access mode, SQL transactions, 770
Access paths
classifying DBMSs by, 50
in physical data models, 31
Access structures, 631. See also
Indexes
Accounts
assigning privileges at account
level, 842–843
DBAs assigning account numbers,
839
ACID (atomicity, consistency, isola-
tion, durability) properties, of
transactions, 754–755
Action component, of triggers, 133
Actions, in ECA model
defined, 933–934
in STARBURST example, 940
Activate command, in active data-
base systems, 938
Activation, in sequence diagrams,
332
Active database systems
creating triggers in SQL, 111
design and implementation issues
with, 937–940
generalized model for, 933–937
inferencing and actions using
rules, 21
overview of, 932
potential applications of, 942–943
statement-level active rules in
STARBURST example, 940–942
technology of, 3
triggers and, 132, 942–943
Active rules
overview of, 931
triggers specifying, 933
Active state, transactions, 752
Active transaction, in recovery
process, 812
Activity diagrams, UML, 334
Actuators, on hard disks, 591
Acyclic graphs (hierarchies), in
object data models, 50
Ad-hoc querying, 1075
Adleman, Len, 865
Administration, of data warehous-
ing, 1080–1081
Advanced Encryption Standard
(AES), 863
AES (Advanced Encryption
Standard), 863
AFIM (after image), in data item
updates, 810–811
After triggers, 938
Agent-based approach, to Web
content analysis, 1024–1025
Aggregate functions
collection operators in OQL,
403–405
grouping and, 166–168
implementing aggregate opera-
tions, 698–699
query processing and optimizing,
698–699
in relational algebra, 146
in SQL, 124–126
in tuple relational calculus,
182–183
Aggregation
as abstraction concept, 269–271
in QBE (Query-By-Example),
1095–1098
temporal, 957
in UML class diagrams, 227
Algebra
transformation rules for relational
algebra operations, 706–708
translating SQL queries into rela-
tional algebra, 681–682
Algorithms
Apriori, 1041–1042
ARIES recovery, 821–825
deadlock prevention, 786–787
decision tree induction,
1052–1054
for ER-to-Relational mapping,
286–287
FP-growth, 1045–1047
FP-tree (frequent-pattern tree),
1043–1045
genetic algorithms (GAs), 1059
heuristic algebraic optimization,
708–709
HITS ranking, 1021–1022
k-means clustering, 1055–1056
PageRank algorithm, 1021
partition, 1047
public (asymmetric) key, 863–865
recovery, 818–819
sampling algorithm, 1042
for set operations, 697–698
symmetric key algorithms, 863
Algorithms, file related
binary search on ordering key of
disk file, 603
hashing, 608
search procedure for linear hash-
ing, 616
Algorithms, indexing
B+-tree searches, 655–656
searching nondense multilevel
primary index, 646
Algorithms, normalization
closure of X under F, 548
dependency preservation and
nonadditive join decomposi-
tion into 3NF, 560–563
dependency preservation into
3NF, 558–559
for finding a key of a relation, 551
for minimal sets of functional
dependencies, 550
nonadditive join decomposition
into 4NF, 570
nonadditive join decomposition
into BCNF, 559–560
problems with, 565–566
relational synthesis into 3NF with
dependency preservation and
nonadditive join property,
560–562
summary of, 567
testing for nonadditive join prop-
erty, 554–555
Aliases, in SQL, 101–102
Allen’s algebra, 955
Allocation
in distributed databases, 897
example of fragmentation, alloca-
tion, and replication, 898–901
Allocation schema, of databases, 896
ALTER command, 138–139
ALTER TABLE command, 90, 92,
138–139
American National Standards
Institute (ANSI), 88
Analysis phase, of ARIES recovery
algorithm, 823
Analytical components, of design
tools, 344
Anchor record (block anchor), 633
Anchor text
browsing and, 999
hyperlink component, 1020
AND, OR, NOT connectives
for complex conditions in QBE,
1094
in formulas, 176
AND and OR operators in Prolog
languages, 972
in three-valued logic, 116–117
Annotations, XML schema lan-
guage, 429
Anomalies, avoiding redundant
information in tuples, 507–509
ANSI (American National Standards
Institute), 88
Antimonotonicity property
Apriori algorithm using,
1041–1042
association rules, 1041
API (application programming
interface)
client-side API for calling
DBMSs, 47
for data mining, 1061
for database programming, 449
Append-only databases, 953
Application-based constraints, 68
Application conversion, in database
application life cycle, 308
Application development
advantages of distributed data-
bases for, 882
database approach reducing
development time, 22
DBMS tools for, 44
Application layer (business logic), in
three-tier client/server architec-
ture, 892–893
Application programmers, 16
Application programs, 449
Application servers
DBMS component modules, 42
federated databases and, 886
middle tier in three-tier architec-
ture, 48
Applications, database
in active database systems,
942–943
application program accessing
databases, 6
as canned transactions, 449
designing, 199, 310
environment, 43–44
ER modeling for, 245
extending capabilities of, 24–26
flexibility provided by relational
databases, 23–24
life cycle of, 308–309
object-oriented, 24
software programs implementing,
477
spatial data and, 964–965
testing, 199
traditional, 3
using hierarchical and network
systems, 23
Apriori algorithm, 1041–1042
Architecture, database
centralized architecture, 44
client/server architecture, 44–46
three-tier and n-iter architectures
for Web applications, 47–49
two-tier client/server architecture,
46–47
Architecture, distributed database
federated database schema,
890–891
parallel vs. distributed architec-
ture, 887–888
pure distributed databases,
889–890
three-tier client/server architec-
ture, 892–894
Architecture, of Oracle Label
Security, 869
Archives, magnetic tape for, 593
Arguments, in Prolog languages, 970
ARIES recovery algorithm, 821–825
Arithmetic
functions and procedures,
572–574
operators in SQL, 105–106
Armstrong’s inference rules, 548
Arrays
constructor, 359
creating UDTs, 373
dynamic, 483
PHP, 486–488
1134 Index
Arrays of texels, 967
Arrow notation, as alternative to dot
notation, 382
AS qualifier, for renaming attributes,
122
ASC keyword, for ascending order
of query results, 107
Assertions
relational schemas and, 66
specifying constraints as, 74,
131–132
Association rules
among hierarchies, 1047–1048
Apriori algorithm, 1041–1042
complications in, 1050–1051
example of, 1037
form of, 1040
FP-growth algorithms, 1045–1047
FP-tree (frequent-pattern tree)
algorithm, 1043–1045
multidimensional associations,
1048–1049
negative associations, 1049–1050
overview of, 1039–1041
Partition algorithm, 1047
in pattern discovery phase of Web
usage analysis, 1026
Sampling algorithm, 1042
Associations, 269–271
autonomy in federated databases,
887
ER relationships compared with,
227
spatial, 963
Associative arrays, PHP, 487
Asterisk (*), for retrieving all attrib-
ute values of selected tuples,
102–103
Asymmetric (public) key algo-
rithms, 863–865
Atom constructors, 358
Atomic domains, in relational
model, 61
Atomic formulas, in Datalog lan-
guage, 973
Atomic literals, 378
Atomic objects
object lifetime and, 378
in ODMG object model, 386–388
Atomic values
1NF and, 519
in tuples, 65
Atomicity property, of transactions,
14, 754–755
Atoms, calculus
in domain calculus formulas, 183
overview of, 176
truth values of, 184
Attribute data, GIS systems, 960
Attribute-defined specialization, of
superclass, 252
Attribute-defined subclasses, 264
Attribute preservation condition, of
a decomposition, 552
Attribute versioning, for incorporat-
ing time in OODBs, 953–954
Attributes
clear semantics for, 503–507
in data modeling, 31
dealing with ambiguous names in
SQL, 100–101
HTML tags, 419
in ODMG object model, 386
prime and nonprime, 519, 526
relationships and, 214, 218
renaming, 122
retrieving all values of selected
tuples, 102–103
semantics of, 503–507, 514
specifying attribute constraints in
SQL, 94–95
subsets of, 68–69
of superclass, 252
symbols for, 1084
time conditions and, 956
time-varying and nontime-
varying, 953
in UML class diagrams, 227
XML documents, 420
Attributes, in ER model
complex, 206–207
composite vs. simple, 205–206
constraints on, 208–209
NULL values, 206
overview of, 203–205
single-valued vs. multivalued, 206
stored vs. derived, 206
value sets (domains) of, 209–210
Attributes, in relational model
defined, 61
relation schema and, 62
Attributes (indexing fields)
deciding whether to index, 730
ordered index on multiple, 661
records and, 631
secondary indexes, 636
single-level indexes, 632
Audio clips, in multimedia data-
bases, 932, 965
Audio data sources, in multimedia
databases, 966, 969
Audits, of database security, 839–840
Authentication
SQL injection attack bypassing,
857
weakness of, 855
Authority, hubs and, 1020
Authorization
identifiers, 89, 842
privileges, 874
subsystem in DBMSs, 19
Automated tools, for database
design, 342–346
Automatic analysis, of multimedia
sources, 965
Autonomy
degree of local autonomy for
DDMBS software, 884
in distributed databases, 881
in federated databases, 886–887
transparency as complement to,
882
Availability
of data, 840–841
in distributed databases, 881–882
loss of, as security threat, 836
of up-to-date information, 22
AVERAGE function
grouping and, 166–168
implementing, 698
Average precision, measures of rele-
vance in I, 1017
AVG function, in SQL, 124–125
Axes, of XPath expressions, 433
Axioms, in deductive databases, 975
B-link tree, 800
B-trees
file organization and, 617
overview of, 649–652
variations on, 660
B+-trees
algorithms for searches with,
655–656
cost functions of selection, 714
decision making in database
design, 730
methods for simple selection, 686
overview of, 652–655
search, insertion, deletion with,
655–660
variations on, 660
Bachman diagrams, 1084–1085
Back-ends, database, 25
Backflushing data, in data ware-
houses, 1076
Backup and recovery. See also
Database recovery techniques
in databases, 20
Index 1135
DBMS component modules, 42
magnetic tape for, 592
recovering from catastrophic
failure, 826–827
Backup sites, for distributed data-
base, 910–911
Backup utility, 43
Bag constructor, 359
Bag (multiset), of tuples, 103–105,
150
Base classes, 265
Base tables
specifying, 90
views and, 133
BCNF (Boyce-Codd normal form)
nonadditive join decomposition
into, 559–560
overview of, 529–531
Before triggers, in active database
systems, 938
Begin transaction, transaction types,
745
BEGIN_TRANSACTION operation,
751
Behavioral diagrams, UML, 329
Behaviors
of database applications, 30
in ODMG object model, 382
Bell-LaPadula model, 847
Best Match 25 (BM25), 1006
BFIM (before image), in data item
updates, 810–811
Bfr. See Blocking factor (bfr)
Bidirectional associations, in UML
class diagrams, 227
Binary associations, in UML class
diagrams, 227
Binary balanced strategy, for view
integration process, 319
Binary decompositions, 553–556
Binary ladder integration strategy,
for view integration process,
319
Binary large objects (BLOBs), 595
Binary relational operations
DIVISION operation, 162–163
EQUIJOIN and NATURAL JOIN
operations, 159–161
JOIN operation, 157–158
overview of, 146
Binary relationships
choosing between binary and
ternary relationships, 228–231
comparing RDB design with
ODB design, 396
constraints on, 216–218, 232
degree of relationship, 213
mapping EER schema to ODB
schema, 397
mapping ER-to-Relational data
models, 289–291
Binary representation, of hashing
function, 612
Binary searches
cost functions for, 713
files, 603
methods for simple selection, 686
Binary trees, 718
Bind variables (parameterized state-
ments), protecting against SQL
injection, 858
Bindings
early and late binding in ODMS,
368
impedance mismatch and, 450
to OOPLs, 376, 407
Bit-level data striping, RAID and,
620
Bit-string data types, in SQL, 92–93
Bitemporal databases, 946, 950
Bitemporal time relations, 950–952
Bitmap indexes
for B+-tree leaf nodes, 666
in multidimensional data models,
1074
overview of, 663–666
Bits, of data, 588
Blind writes, 768
BLOBs (binary large objects), 595
Block-level striping, RAID, 620
Block size, as disk parameter, 1088
Block transfer time (btt)
as disk parameter, 1088
for hard disks, 591
Blocking factor (bfr)
for files, 597
multilevel indexes and, 643
in query cost estimation, 712
Blocking records, 597
Blocks of data
allocation on disk, 598
buffer management and, 593–594
pointers and, 597
in query cost estimation, 712
sequential order for accessing, 592
BM25 (Best Match 25), 1006
Body, HTML, 419
Boolean conditions, in tuple rela-
tional calculus, 176–177
Boolean data types
attributes, 295
in SQL, 93
Boolean model, for information
retrieval, 1002–1003
Boolean queries, in information
retrieval systems, 1007–1008
Bottom-tier database server, PHP,
482
Bottom-up approach
in relational database design, 502,
544
for schema design, 316
Bottom-up conceptual synthesis,
257
Boyce-Codd normal form (BCNF)
nonadditive join decomposition
into, 559–560
overview of, 529–531
Browsing. See also Web browsers
interfaces, 38
modes of interaction in IR sys-
tems, 999
Buckets, of disk blocks, 609
Buffer management
DBMS component modules, 40
storage and, 593–594
Buffers
address of, 590
DBMS buffer space, 683
in DBMSs, 19
performance of nested-loop joins
and, 690
Bulk transfer rate (btr)
as disk parameter, 1088
for hard disks, 592
Business metadata, in data ware-
housing, 1078
Business rules
applications for active databases,
943
integrity constraints in databases,
21
relational model constraints, 68
Bytes, of data, 588
C language
embedded SQL and, 451–452
as host language in SQL/CLI,
464–468
PHP interpreter written in, 482
C++ language binding, in ODMG,
407–408
Cache memory, 585
Caching
database cache, 746
in database recovery, 809–810
in DBMSs, 19
Calendars
cultural differences in, 945
1136 Index
temporal databases and, 945–947
time series data and, 957
Call statement, SQL, 475
Candidate keys
database design and, 729
defined, 519
functional dependency and, 514
relational model constraints, 69
Canned transactions, 15
Cardinality
of domains, 63
selection cardinality, 712
Cardinality ratio
for binary relationship, 216–217
notation for, 1084–1085
Cartesian product, 63
CARTESIAN PRODUCT operation
algorithms for, 697–698
in relational algebra, 155–157
Cartridge, Oracle, 931
Cascade option, in delete operation,
77
Cascadeless (avoid cascading roll-
back), of transactions, 759
Cascading rollback (or cascading
abort)
in database recovery, 813–815
timestamp ordering and, 790
of transactions, 758
CASE (computer aided software
engineering), 1083
Case, text preprocessing in informa-
tion retrieval, 1011
Catalogs
catalog information used in cost
functions, 712–713
DBMS, 10–11
SQL, 90
transaction management in
distributed databases, 913
Catastrophic failure, database recov-
ery techniques for, 826–827
Categories, in EER
defined, 265
modeling, 258–260
Categorization, in agent-based
approach to Web content
analysis, 1024
Cautious waiting algorithm, for
deadlock prevention, 787
Centralized catalogs, 913
Centralized DBMSs, 44, 49
Centralized (one shot) schema
design approach, 315
Certification locking technique, 794
Certify locks, 792–793
Chaining, for collision resolution,
608–609
Character-string data types, in SQL,
92
CHECK clauses
restricting attribute or domain
values with, 94–95
specifying constraints on tuples, 97
Checkpoints
in ARIES recovery algorithm, 822
in database recovery, 812–813
Chicken feet notation, 1085
Child nodes, of tree structures, 646
Chronon, in temporal databases, 945
Ciphertext, 862, 864. See also
Encryption
Class diagrams
ER diagrams compared with, 200
notation of, 226–228
UML and, 329–330
Class hierarchies. See Type (class)
hierarchies
Class properties, in knowledge
representation, 268
Class/subclass relationships, 247,
571–572
Classes
built-in to ODMG object model,
383–385
compared with entities, 227
in EER model, 264
names, in UML class diagrams,
227
in object data models, 50
security classes in mandatory
access control, 847
type definitions and operation
definitions, 361–362
Classification
classification trees in data mining,
1037
concept hierarchies and, 1024
data mining and, 1051–1054
faceted classification scheme,
1028–1029
goals of data mining, 1038
knowledge discovery and, 1039
in mandatory access control, 848
overview of, 268
in pattern discovery phase of Web
usage analysis, 1027
spatial, 963
Classification attributes, in manda-
tory access control, 848
Clausal form
in Datalog, 973
in deductive database systems,
974–975
Clauses, in simple SQL queries, 107
Clearance, in mandatory access con-
trol, 848
Client computers
accessing specialized servers, 45
DBMS access and, 42
Client module, DBMS, 29
Client (presentation) layer, three-tier
client/server architecture, 892
Client programs, 42, 451
Client/server architecture
for DBMSs, 44–46
three-tier client/server architec-
ture, 892–894
two-tier client/server architecture,
46–47
Client tier, PHP, 482
Clients
client level in two-tier client/serv-
er architecture, 47
client program calling database
server, 451
in client/server architecture, 46
Close operation, files, 600
The closed world assumption, 66
Closure of X under F, 548
Cloud computing, 914–915
Clustered file, 606, 636
Clustering
concept hierarchies and, 1024
data mining and, 1054–1055
k-means clustering algorithm,
1055–1056
knowledge discovery and, 1039
in pattern discovery phase of Web
usage analysis, 1026–1027
spatial, 964
Clustering field, 635
Clustering indexes
cost functions for SELECT opera-
tions, 713–714
decision making in database
design, 730
implementing aggregate opera-
tions, 699
methods for simple selection, 686
overview of, 635–636
tables comparing index types, 642
types of ordered indexes, 632
Clusters, on hard disks, 591
Coalescing, of time periods, 956
Codd, Ted, 59
Code generator, for query execution,
679
Index 1137
Code injection, SQL injection
attacks, 856
Collaborative social searches, 1029
Collection literals, 382
Collection (multivalued) construc-
tors, 359
Collection objects, built-in to
ODMG object model, 383
Collection operators, OQL, 403–405
Collections
creating UDTs, 373
extracting single elements from,
403
persistent, 363, 367
transient, 367
Collisions, hashing and, 608–609
Colocation rules, spatial, 964
Color, automatic analysis of images,
967
Column-based storage, of relations,
669–670
Columns, in SQL, 89. See also
Attributes
Commercial tools, for data mining,
1060–1062
Commercial value, of Web searches,
1019
Commit point, of transactions, 754
Committed projection, of transac-
tion schedule, 757
Committed state, of transactions,
752
Committed transactions
commit point and, 754
issues with distributed commit,
910
recovery process and, 812
types of transaction, 750
COMMIT_TRANSACTION operation,
752
Communication autonomy
in distributed databases, 881
in federated databases, 886
Communication costs, in query exe-
cution, 711
Communication facilities, DBMS,
43–44
Communication links, failure in
distributed databases, 910
Communication software, 44
Communication variables, SQL, 454
Comparison operators
applying to domains of ordered
values, 148
SQL, 98
Compatibility, object-oriented data-
bases and, 19
Complete horizontal fragmentation,
in distributed databases, 895
Complete schedule, transactions,
757
Complete vertical fragmentation, in
distributed databases, 896
Completeness (totalness) constraint,
253
Complex attributes, in ER model,
206–207
Complex data relationships, in data-
bases, 20
Complex structures
attribute versioning and, 953
objects and, 355
UDT (user-defined types) and,
370–373
Complex types
for objects and literals, 358–360
specifying structures in XML
schema using, 430
Component modules, DBMS, 40–42
Component schema, in federated
database architecture, 891
Component values, of tuples, 67
Components diagrams, UML, 330
Composite attributes
in ER model, 205–207
mapping from EER schema to
ODB schema, 397
XML schema language, 430
Composite indexes, 714
Composite keys, 661
Composite (molecular) objects, 270
Computational interpretation, of
rules in deductive databases,
977
Computer aided software engineer-
ing (CASE), 1083
Computer failure (system crash),
recovery needed due to, 750
Concatenate operator (.), in PHP,
485
Concatenate operator (||), in SQL,
105
Concept hierarchies, in Web content
analysis, 1024
Conceptual data models, 30
Conceptual database design phase,
311
Conceptual design
comparing RDB design with
ODB design, 395–396
of databases, 9
high-level, 200–202
initial conceptual design for
COMPANY database example,
210–211
Rational Rose modeling using
UML notation, 339–340
refining conceptual design for
COMPANY database example,
220–221
synchronizing with actual data-
base, 341
Conceptual (logical) level, goodness
of relation schemas and, 501
Conceptual representation of data,
in DBMS, 12
Conceptual schema
database design and, 201
in three-schema architecture, 34
Conceptual schema design, 313–321
approaches to, 314–315
high-level data model used for,
313–314
identifying correspondences and
conflicts among schemas,
317–319
schema (view) integration,
316–317, 319–321
strategies, 315–316
Conceptualization, 272
Concurrency control
DBMS component modules, 42
distributed control based on dis-
tinguished copy of data item,
910–912
distributed control based on vot-
ing, 912
protocols, 777
reasons for aborting transactions,
751
serializability used for, 765–768
software, 13
transaction issues handled by,
747–750
transaction management in
distributed databases, 909–910
Concurrency control techniques
basic timestamp ordering,
789–790
bibliographic references,
804–805
binary locks, 778–780
conversion of locks, 782
deadlock detection, 787–788
deadlock prevention, 785–787
1138 Index
granularity level in locking,
795–796
insertion, deletion, and phantom
records, 800–801
interactive transactions and, 801
latches, 802
locking used in indexes, 798–800
multiple granularity level locking,
796–798
multiversion concurrency control,
791–793
overview of, 777–778
serializability guaranteed by two-
phase locking, 782–784
shared/exclusive (read/write)
locks, 780–782
starvation, 788
strict timestamp ordering,
790–791
summary and exercises, 802–804
Thomas’s write rule, 791
two-phase locking, 778
validation (optimistic) concur-
rency control, 794–795
variations on two-phase locking,
784–785
Concurrent use, of database system,
744
Condition box, in Query-By-
Example, 1093
Condition-defined subclasses, 252,
264
Condition markers, in sequence
diagrams, 332
Conditions, as component of
triggers, 133
Conditions (formulas). See
Formulas
Conditions, in ECA model
defined, 933–934
in STARBURST example, 940
Confidence, of association rules, 1040
Confidentiality, loss of, 836
Conflict equivalence, of transaction
schedules, 762
Conflict serializable
testing conflict serializability of
schedules, 763–765
transaction schedules, 763
Conflict set, rule consideration and,
942
Conflicts, in transaction schedules,
756–757
Conjunctive conditions, SELECT
operations and, 686–687
Conjunctive selection, cost functions
for
SELECT, 714
Connecting fields, for relationships
between file records, 616
Connection records, in SQL/CLI,
464–468
Connections
opening database, 451
PHP connecting to databases,
491–493
SQL command for connecting to
database, 453
Conservative two-phase locking, 784
Consistency property, transaction
properties, 754–755
Constant nodes
notation for query trees and
query graphs, 703
in query graphs, 179
Constant values, in Prolog
languages, 971
Constrained write assumption, 768
Constraint specification language,
74
Constraints
on binary relationships, 216–218
on binary relationships and terna-
ry relationships, 232
database design and, 310
domain constraints, 68
on extents corresponding to type
hierarchies, 366
in federated databases, 885
inclusion dependencies and, 571
integrity, referential integrity, and
foreign keys, 73–74
key constraints and NULL value
constraints, 68–70
notation of max/min values,
1084–1085
other types of, 74–75
relational model and, 67–68
on specialization and generaliza-
tion, 251–254
state constraints vs. transition
constraints, 75
Constraints, in SQL
CHECK clauses for specifying on
tuples, 97
naming, 96–97
specifying as assertions, 131–132
specifying attribute constraints
and default values, 94–95
specifying key and referential
integrity constraints, 95–96
specifying with
CREATE TABLE
command, 90, 92
Constructing databases
defined, 5
University student database
example, 7
Constructor operations
factory objects providing, 388
objects, 362
Constructs, PHP, 485–486
Content-based retrieval, in queries,
965
Content-encryption algorithms, 863
Continuous allocation, file blocks
on disk, 597
Control measures, database security,
837–838
Conversational searches (CS),
1029–1030
Core specification, SQL, 88
Correlated nested queries, in SQL,
119–120
Cost-based query optimization
catalog information used in,
712–713
example, 719–721
JOIN and, 715–718
overview of, 711–712
SELECT and, 713–715
systematically estimating costs of
query trees, 681
Costs, in choosing a DBMS, 323
COUNT function, SQL
aggregate functions in SQL,
124–125
grouping and, 166–167
implementing, 698
Covert channels
flow control and, 861–862
in mandatory access control, 850
Crawlers
overview of, 999
Web crawlers, 1028
CREATE ASSERTION command,
131–132
CREATE command, 89
CREATE INDEX command, 110–111
CREATE SCHEMA command, 89
CREATE TABLE command
CHECK clauses for specifying
constraints on tuples, 97
clauses for keys and referential
integrity constraints in, 95
SQL (Structured Query
Language), 90–92
Index 1139
CREATE TRIGGER command,
132–133, 936
CREATE VIEW command, 90,
134–135
Credentials, access control via,
854–855
CRM (Customer Relationship
Management), 26
CROSS JOIN operation. See
CARTESIAN PRODUCT
operation
CROSS PRODUCT operation.
See
CARTESIAN PRODUCT
operation
CS (Conversational searches),
1029–1030
Current directory, 820
Current relation state, 63
Cursors
for looping over tuples in a query
result, 450
options for declaring, 457
retrieving multiple tuples using,
455–457
Customer Relationship
Management (CRM), 26
Cycles, converting graph with cycles
into hierarchical structure, 441
Cylinders, on hard disks, 589
DAC (discretionary access control),
850–851
Dangling tuples, problems in rela-
tional design, 563–565
Data
data quality as issue in database
security, 867
definition of, 4
insulation between programs and,
11–13
multiple views of, 13
normalization of, 517
sensitivity of, 840–841
types of data in information
retrieval, 996
Data abstraction
data models and, 30
in EER (Enhanced Entity-
Relationship) model, 267–268
insulation between programs and
data, 12–13
relational databases and, 23–24
Data allocation. See Allocation
Data blade, Informix, 931
Data blocks. See Blocks of data
Data buffers, in database cache, 746
Data-centric XML documents, 422
Data content, database design and,
310
Data cubes (hypercubes),
1070–1072
Data definition
in QBE, 1098
in SQL, 89
Data definition language. See DDL
(data definition language)
Data dependencies, relational model
constraints, 68
Data dictionaries (or data repository)
DBMS tools, 43
organizations using, 306
Data-driven design, 310
Data elements, storing XML docu-
ment as, 431
Data encryption. See Encryption
Data Encryption Standard (DES),
863
Data fragmentation. See
Fragmentation
Data independence, in three-schema
architecture, 35–36
Data items
dealing with multiple copies of,
909
granularity of, 746, 795
updates, 810–811
Data labels, combining with user
labels, 869–870
Data manipulation language. See
DML (data manipulation
language)
Data marts, 1070
Data mining
applications of, 1060
Apriori algorithm, 1041–1042
association rules among hierar-
chies, 1047–1048
association rules and, 1039–1041
bibliographic references,
1065–1066
classification and, 1051–1054
clustering and, 1054–1056
commercial tools for, 1060–1062
complications in mining associa-
tion rules, 1050–1051
vs. data warehousing, 1036
FP-growth algorithms, 1045–1047
FP-tree (frequent-pattern tree)
algorithm, 1043–1045
genetic algorithms (GAs), 1059
goals of, 1037–1038
multidimensional associations,
1048–1049
negative associations, 1049–1050
neural networks in, 1058
overview of, 1035–1036
as part of knowledge discovery
process, 1036–1037
Partition algorithm, 1047
pattern discovery in, 1057
regression in, 1057–1058
Sampling algorithm, 1042
spatial, 963–964
specialized database applications,
25
summary and exercises, 1063–1065
types of knowledge discovered
during, 1038–1039
Data model mapping
automated tools for database
design, 344
database design and, 202
as design phase, 311
logical database design, 326
Data models
categories of, 30–31
classifying DBMSs by, 49–52
converting object models to/from
logical models, 341
data abstraction in, 12, 30
for data warehouses, 1070
ER model. See ER (Entity-
Relationship) model
in federated databases, 885
functional, 214
hierarchical for XML. See
Hierarchical data models, for
XML
inherent rules of, 21
mapping EER to relational. See
EER-to-Relational mapping
mapping ER-to-Relational. See
ER-to-Relational mapping
network. See Network data mod-
els
object. See Object data models
Rational Rose, 338–342
semantic, 267–268
Data models, enhanced, 931–932
active databases. See Active data-
base systems
bibliographic references, 989–991
deductive database systems. See
Deductive database systems
multimedia databases. See
Multimedia databases
spatial databases. See Spatial
databases
summary and exercises, 983–989
1140 Index
temporal databases. See Temporal
databases
Data normalization, 18
Data organization, transparency of,
880
Data provenance, 306
Data records, in University database
example, 6
Data replication. See Replication
Data requirements, database design
and, 200
Data servers, in two-tier client/
server architecture, 47
Data sources
accessing with Java programs, 469
databases as, 415
Data striping, RAID, 618
Data structure, database design and,
310
Data sublanguage, DML as, 38
Data Surveyor, 1060
Data transfer costs, for distributed
query processing, 902–904
Data types
associated with record fields, 595
atomic (user-defined), 386–388
class hierarchies. See Type (class)
hierarchies
common SQL, 92–94
complex types, 358–360, 430
constructors. See Type construc-
tors
domains and, 61
entity types. See Entity types
n-ary relationship types, 291–292
names and functions, 365
PHP, 485–486
reference types, 373–374
spatial types, 959–960
temporal types, 945
type-compatible relations, 697
type generator, 358–359
UNION types, 258–260
in University database example, 7
value sets specified via, 209
Data warehouses
bibliographic references, 1082
building, 1075–1078
characteristics of, 1069
data mining compared with, 1036
data modeling for, 1070
difficulties with implementing,
1080–1081
functions of, 1078–1079
overview of, 1067–1068
summary and exercises, 1081–1082
types of databases, 3
views compared with, 1079–1080
Database administrators. See DBAs
(database administrators)
Database applications. See
Applications, database
Database architectures. See
Architecture, database
Database back-ends, 25
Database-based approach, to Web
content analysis, 1025
Database cache, DBMS, 746
Database design
conceptual design choices, 222,
224
in database application life cycle,
308
denormalization as design deci-
sion related to query speed,
731–732
factors influencing physical data-
base design, 727–729
indexing decisions, 730–731
issues in active database systems,
937–940
practical. See Database design
methodology
relational. See Relational database
design
specialization and generalization
choices, 263–264
tuning, 735–736
verification of, 345
Database design methodology, 298
automated tools for, 342–346
bibliographic references, 348–350
choice of DBMS, 323–325
conceptual schema design,
313–321
data model mapping (logical
database design), 326
database application system life
cycle, 308–309
implementation process and,
309–311
information system (IS) life cycle,
307–308
organizational context for data-
base systems and, 304–307
overview of, 303–304
physical database design, 326–327
Rational Rose for. See Rational
Rose
requirements collection and
analysis phase, 311–313
summary and exercises, 345–348
system implementation and tun-
ing, 327–328
transaction design, 322–323
UML as design specification
standard, 328
UML diagram types, 329–334
UML for database application
design, 329
University student database
example, 334–337
Database designers
database actors on the scene, 15
design and testing of applications,
199
Database fingerprinting, 857
Database implementation. See
Implementation
Database interfaces. See Interfaces
Database items, in transaction pro-
cessing, 745–747
Database management systems. See
DBMSs (database management
systems)
Database programming language.
See Programming languages
Database recovery techniques
ARIES recovery algorithm,
821–825
bibliographic references, 832
caching (buffering) disk blocks,
809–810
catastrophic failure and, 826–827
checkpoints and fuzzy check-
points, 812–813
deferred update and immediate
update techniques, 808–809
immediate update techniques,
817–820
in multidatabase systems,
825–826
NO-UNDO/REDO recovery
based on deferred update,
815–817
overview of, 807–808
recovery in distributed databases,
909–910
rollbacks, 813–815
shadow paging, 820–821
steal/no-steal and force/no-force
techniques, 811–812
summary and exercises, 827–832
system logs and, 808
write-ahead logging, 810–812
Database schemas. See also Schema
instances and database state and,
32–33
Index 1141