Elmasri R., Navathe S.B. Fundamentals of Database Systems
Подождите немного. Документ загружается.
ontologies and, 272
relational. See Relational database
design
three-schema architecture. See
Three-schema architecture
Database security
access control policies for e-
commerce and Web, 854–855
access control, user accounts, and
audits, 839–840
bibliographic references, 874–875
challenges in, 867–868
comparing mandatory access
control with discretionary
access control, 850–851
control measures, 837–838
covert channels, 861–862
DBAs (database administrators)
and, 838–839
DES and AES standards, 863
digital certificates, 865–866
digital signatures, 865
discretionary privileges, 842–844
encryption, 862–863
flow control, 860–861
granting/revoking privileges,
844–846
information security vs. informa-
tion privacy, 841–842
label-based security and row-level
access control, 852–853
limits on propagation of privi-
leges, 846–847
mandatory access control,
847–850
Oracle Label Security, 868–870
overview of, 835
privacy issues, 866–867
public (asymmetric) key algo-
rithms, 863–865
role-based access control,
851–852
sensitivity of data and, 840–841
SQL injection attacks, 855–858
statistical, 859–860
summary and exercises, 870–874
symmetric key algorithms, 863
threats, 836–837
types of security, 836
XML access control, 853–854
Database security and authorization
subsystem, DBMSs, 837
Database server layer, in three-tier
client/server architecture, 893
Database servers, DBMS component
modules, 42
Database state (snapshot), 32–33
Database storage reorganization,
DBMS utilities, 43
Database system environment
database system utilities, 42–43
DBMS component modules,
40–42
tools, application environments,
and communication facilities,
43–44
Databases, introduction to
actors on the scene, 14–16
advantages of DBMS approach,
17
backup and recovery in, 20
bibliographic references, 28
characteristics of database
approach, 9–10
as collection of named data items,
746
comparing with IR systems,
997–998
complex data relationships in, 20
concurrent use of, 744
creation/conversion costs,
323–324
defined, 4
design, 9
early applications using hierarchi-
cal and network systems, 23
extending application capabilities,
24–26
inferencing and actions using
rules, 21–22
information retrieval (IR) and, 26
insulation between programs and
data, and data abstraction,
11–13
integrity constraints in, 20–21
interchanging data of Web using
XML, 24
multiple user interfaces in, 20
multiple views of data, 13
object-oriented, 24
other benefits and implications of
using database approach, 22
overview of, 3–6
persistent storage of program
objects, 19
personal, 305
query processing in, 19–20
redundancy controlled in, 17–18
relational databases providing
data abstraction and applica-
tion flexibility, 23–24
self-describing nature of, 10–11
sharing data and multiuser trans-
actions, 13–14
storing/extracting XML docu-
ments from, 431–432, 442
summary and exercises, 27–28
unauthorized access restricted in,
18–19
University student database
example, 6–9
when not to use DBMS, 26–27
workers behind the scene, 16–17
Datalog language
clausal form and Horn clauses,
974–975
evaluating nonrecursive queries,
981–983
notation, 970–973
programs and safety, 978–980
as variation of Prolog language,
970
DATE data type, in SQL, 93, 945
DB/DC system, DBMS tools, 44
DBAs (database administrators)
database actors on the scene, 15
interface for, 40
role in database security, 838–839
DBMSs (database management sys-
tems)
accessible with PEAR DB, 492
advantages of, 17
backup and recovery in, 20
buffers in transaction processing,
745–747
cache, 683, 746, 809
Catalog, 10–11
centralized architecture, 44
choosing for database design,
323–325
classification of, 49–52
client/server architecture, 44–46
component modules, 40–42
conceptual representation of data
in, 12
definition of, 5
interfaces, 38–40
languages, 36–38
lock manager subsystem in, 779
modules, 29
query processing and optimiza-
tion module, 20
security and authorization sub-
system, 19, 837
single-user vs. multiuser, 744–745
SQL and, 87
storing/extracting XML docu-
ments, 431
1142 Index
system designers, 16
system utilities, 42–43
tools, application environments,
and communication facilities,
43–44
two-tier client/server architecture,
46–47
when not to use, 26–27
DCT (Discrete Cosine Transform),
966
DDBMSs (Distributed DBMSs)
architecture of, 889–891
classifying DBMSs by site distri-
bution, 49–50
defined, 878
degree of homogeneity of soft-
ware, 884
DDBs (distributed databases)
advantages of, 882
architecture of, 889–891
autonomy of, 881
bibliographic references, 924–927
catalog management, 913
cloud computing and, 914–915
concurrency control, 910–912
data fragmentation in, 894–896
data replication and allocation in,
897
data transfer costs for distributed
query processing, 902–904
defined, 878
example of fragmentation, alloca-
tion, and replication, 898–901
federated database management
systems, 885–887
functions of, 883
multiprocessor systems compared
with, 879
in Oracle, 915–919
overview of, 877–878
parallel vs. distributed architec-
ture, 887–888
peer-to-peer database systems,
915
query processing, 901–902
query processing using semijoin
operation, 904
query update and decomposition,
905–907
recovery, 912–913
reliability and availability of, 881
summary and exercises, 919–924
three-tier client/server architec-
ture, 892–894
transaction management in,
907–909
transparency in, 879–881
types of, 883–885
DDL (data definition language)
DBMS languages and, 37
processing schema definitions, 40
Rational Rose for DDL genera-
tion, 338
SQL as, 88
Deactivate rule, in active database
systems, 938
Deadlocks
detecting, 787–788
in distributed databases, 910
preventing, 785–787
Debit-credit transactions, 769
Decision-support systems (DSS),
1068–1069
Decision tree induction algorithm,
1052–1054
Decision trees, classification with,
1051
Declarative assertions, 131
Declarative expressions, in relational
calculus, 174
Declarative languages
DBMS languages, 38
deductive database systems and,
970
SQL as, 88
Decomposition. See Properties of
relational decompositions
Decrement operator, SQL, 105
Decryption algorithms, in public
key schemes, 864
Deductive axioms, in deductive
databases, 975
Deductive database systems
clausal form and Horn clauses,
974–975
Datalog notation, 973
Datalog programs and safety of,
978–980
evaluating nonrecursive Datalog
queries, 981–983
interpretation of rules, 21, 975–977
overview of, 970
Prolog notation, 970–972
relational operators, 980–981
Deductive knowledge, discovered
during data mining, 1038
Deductive rules. See Rules, in deduc-
tive databases
Default values, of attributes in SQL,
94–95
Deferred consideration, of rules in
active databases, 938
Deferred update techniques
following no-steal approach, 811
NO-UNDO/REDO recovery,
815–817
overview of, 807–809
Defining attribute, of specialization,
252
Defining databases
database state and, 33
overview of, 5
University student database
example, 6–7
Defining predicate, of subclass, 252
Degree of homogeneity, of DDBMS
software, 884
Degree of local autonomy, of
DDBMS software, 884
Degree of relationship
in ER (Entity-Relationship)
model, 213
greater than two, 228–232
in relational model, 62
SELECT operator and, 149
DELETE command, SQL, 109, 936
Delete operation
concurrency control techniques,
800–801
on files, 600
relational data model operations,
77–78
Deletion anomalies, avoiding redun-
dant information in tuples, 509
Deletion markers, file organization
and, 602
Denial of Service (DOS) attacks,
855, 857
Denormalization
defined, 18, 518
query speed and, 731–732
Dense indexes, 633, 636
Density-based clustering, 964
Dependency. See also Functional
dependencies
modeling in pattern discovery
phase of Web usage analysis,
1027
predicate dependency graph, 982
Dependency preservation property
decomposition into third normal
form (3NF), 560–563
normal forms and, 518
overview of, 552–553
Deployment diagrams, UML, 330
Deployment, operation, and main-
tenance phase, of information
system (IS) life cycle, 308
Index 1143
Derived attributes
in ER model, 206
in functionality of data ware-
houses, 1079
Derived tables, SQL views, 89
DES (Data Encryption Standard),
863
DES keyword, for descending order
of query results, 107
Descendant nodes, of tree struc-
tures, 646
Description records, in SQL/CLI,
464–468
Descriptor elements, SQL, 89
Design autonomy
in distributed databases, 881
in federated databases, 886–887
Design, database. See Database
design
Design phase, of information system
(IS) life cycle, 307
Design transparency, in distributed
databases, 881
Design verification, 345
Desktop search engines, 996
Destination page, as hyperlink
component, 1020
Destructor operations, on objects,
362
Detached consideration, of rules in
active databases, 939
DFT (Discrete Fourier Transform),
966
Diagnostic area size, transaction
support in SQL, 770
Diagrams
automated tools for database
design, 343–344
Class diagrams. See Class dia-
grams
ER diagrams. See ER diagrams
Schema diagram, 32
UML. See UML (Unified
Modeling Language)
Dictionary constructor, 359
Digital certificates, 865–866
Digital libraries, searchable Web
documents in, 1018
Digital signatures, 854, 865
Digital terrain analysis, for spatial
databases, 959
Digits, in text preprocessing in
information retrieval, 1011
Dimension tables, in multidimen-
sional data model, 1073
Directories
current and shadow, 820
online directories, 919–921
Directory Information Tree (DIT),
919
Directory services, in distributed
databases, 919–921
Directory Services Markup
Language (DSML), 855
Dirty bits, in DBMS cache, 810
Dirty Page Table, in ARIES recovery
algorithm, 822
Dirty reads, transaction support in
SQL, 770
Discrete Cosine Transform (DCT),
966
Discrete Fourier Transform (DFT),
966
Discretionary access control (DAC),
850–851
Discretionary privileges, 842–844
Discriminator key, in UML class
diagrams, 228
Disjointness (disjointedness) con-
straint, 253, 264
Disjoints, 895
Disjunctive selection conditions, 688
Disk blocks (pages)
on hard disks, 589
parameters, 1087–1089
Disk controllers, 591
Disk devices
hard drives, 591
hardware structures of, 588–592
placing file records on disk, 594
as random access storage devices,
592
recovery needed due to failure of,
751
Disk packs, 589
Disk speed, as disk parameter, 1088
Disk storage, cost components of
query execution, 711
Distance function, in image data-
base queries, 966
DISTINCT keyword, with SELECT
command, 103
Distributed architecture, vs. parallel,
887–888
Distributed computing systems, 877
Distributed databases. See DDBs
(distributed databases)
Distributed DBMSs. See DDBMSs
(Distributed DBMSs)
Distributed warehouses, 1078
Distribution transparency, 880, 894
DIT (Directory Information Tree),
919
DIVISION operation, in relational
algebra, 162–163
DKNF (domain-key normal form),
574–575
DML (data manipulation language)
DBMS languages, 37
precompilers and, 42
SQL as, 88
Document-centric XML documents,
422
Document header, HTML, 419
Document Object Model (DOM),
423
Document Type Definitions
(DTDs), 423, 425
Documentation, in XML schema
language, 429
Documents
hypertext documents, 415
information retrieval from, 1014
in multimedia databases, 932,
965–966
Semantic Web and, 272
SMART retrieval system, 998
Documents, XML
extracting from databases,
431–432, 442
publishing, 431
types of, 422
well-formed and valid, 422–425
DOM (Document Object Model),
423
Domain-key normal form (DKNF),
574–575
Domain of knowledge, in ontolo-
gies, 268
Domain (relational) calculus, 183
Domain variables, 183
Domains
of attributes in UML class
diagrams, 227
cardinality of, 63
constraints and, 68
relation schema and, 62
in relational model, 61
DOS (Denial of Service) attacks,
855, 857
Dot notation
in ODMG object model, 382
operations, 362
for path expressions in SQL, 376
Double buffering, 593
1144 Index
Double-quoted strings, in PHP text
processing, 485–486
Double-sided disks, 589
Downward closure property
Apriori algorithm using,
1041–1042
association rules and, 1041
Drill-down display
in data warehouses, 1078
working with data cubes,
1070–1072
Driver manager class, JDBC, 469
Drop command, in active database
systems, 938
DROP SCHEMA command, 138
DROP TABLE command, 138
DROP VIEW command, 135
DSML (Directory Services Markup
Language), 855
DSS (decision-support systems),
1068–1069
DTDs (Document Type
Definitions), 423, 425
Duplicate elimination, PROJECT
operation and, 150
Durability property, of transactions,
755
Duration events (facts), in temporal
databases, 946
Dynamic arrays, PHP, 483
Dynamic database application, 30
Dynamic database programming
approaches
Dynamic SQL, 448, 458–459
overview of, 464
SQL/CLI (Call Level Interface),
464–468
Dynamic files, 601
Dynamic hashing, 612, 614, 731
Dynamic (late) binding, in ODMS,
368
Dynamic multilevel indexes,
646–647
Dynamic operators, spatial, 961
Dynamic SQL
defined, 448
specifying queries at runtime,
458–459
Dynamic Web pages
defined, 481
vs. static, 420
XML for, 416
E-commerce
access control policies for,
854–855
interchanging data on Web using
XML, 27–28
E-mail servers, 45
Early (static) binding, in ODMS,
368
ECA (Event-Condition-Action)
model, 933
Economies of scale, as benefit of
database approach, 22
ECR (Entity-Category-Relationship)
model, 258
Edges
detecting in automatic analysis of
images, 967
notation for query trees and
query graphs, 703
of query graphs, 179
EER (Enhanced Entity-
Relationship) model
aggregation and association,
269–271
bibliographic references, 284
classification and instantiation,
268
constraints on specialization and
generalization, 251–254
data abstraction, knowledge rep-
resentation, and ontological
concepts, 267–268
design choices for
specialization/generalization,
263–264
formal definitions of concepts,
264–265
generalization, 250–251, 269
hierarchies and lattices for spe-
cialization and generalization,
254–257
identification, 269
mapping to ODB schema,
397–398
modeling union types, 258–260
ontologies and the Semantic Web
and, 272–273
overview of, 245–246
refining conceptual schemas,
257–258
specialization, 248–250, 269
subclasses, superclasses, and
inheritance, 246–248
summary and exercises, 273–284
UML as alternative notation to,
265–266
UNIVERSITY example of EER
schema, 260–263
EER-to-Relational mapping
mapping shared subclasses (mul-
tiple inheritance), 297
mapping specialization or gener-
alization, 294–297
mapping union types (cate-
gories), 297–299
EIS (executive information systems),
1068
Element operator, in OQL, 403
Elements, in SQL schema, 89
Elements, XML documents
complex vs. simple, 421–422
notation for specifying, 424
overview of, 420
storing XML document as data
element, 431
XML schema language, 429
Embedded SQL
advantages/disadvantages,
476–477
approaches to database program-
ming, 449
communicating between program
and DBMS, 454
connecting to databases, 453
defined, 448
overview of, 451–452
programming example, 454–455
retrieving multiple tuples using
cursors, 455–457
retrieving single tuples with,
452–453
SQLJ, 448, 459–464
as static database programming
approach, 464
Empty elements, XML schema lan-
guage, 429
Encapsulation
defined, 369
ODB features included in SQL,
370
in OO systems, 356
overview of, 361–363
UDTs and, 374–375
Encryption
DES and AES standards, 863
overview of, 862–863
public (asymmetric) key
algorithms, 863–865
RSA encryption algorithm, 865
symmetric key algorithms, 863
End transaction, transaction types,
745
End users, 15–16
Index 1145
END_TRANSACTION operation,
751–752
Enhanced Entity-Relationship
model. See EER (Enhanced
Entity-Relationship) model
Enterprise Resource Planning. See
ERP (Enterprise Resource
Planning)
Enterprise search systems, 996
Enterprise-wide data warehouses,
1070
Entity-Category-Relationship (ECR)
model, 258
Entity integrity
constraint in relational data
model, 73
rules for multilevel relations, 850
Entity-Relationship model. See ER
(Entity-Relationship) model
Entity sets
overlapping, 253
overview of, 207–208
Entity types
attributes of, 203–207
classes compared with, 227
in data modeling, 31
generalized, 264
key attributes of, 208–209
mapping ER-to-Relational data
models, 287–289
notation for, 1083–1084
overview of, 207–208
relations, 288
subtypes or subclasses of,
246–247
supertypes or superclasses of, 247
symbols for, 1084
type inheritance in EER model,
248
weak entity types, 219–220
Entry points
to objects, 363
in ODMG object model, 377
in OQL, 399–400
Environment records, in SQL/CLI,
464–468
Environments
database system environment,
40–44
SQL, 90
EQUIJOIN operation, in relational
algebra, 159–161
Equivalence of schedules, 768–770
Equivalence of sets, of functional
dependencies, 549
ER diagrams
class diagrams compared with,
200
defined, 199
notation of, 221–226, 1083–1085
ER (Entity-Relationship) model
attributes of relationship types,
218
bibliographic references, 243
conceptual design choices, 222,
224
constraints on binary relationship
types, 216–218
correspondence to relational
model, 293
as data model type, 31
degree of relationship, 213
degree of relationship greater
than two, 228–232
entities and attributes, 203–207
entity types and entity sets,
207–208
ER diagram notation, 221–226,
1083–1085
as high-level conceptual model,
200–202
initial conceptual design for
COMPANY database example,
210–211
key attributes of entity types,
208–209
laboratory exercises, 241–243
naming conventions for schema
constructs, 222
overview of, 199–200
refining conceptual design for
COMPANY database example,
220–221
relationship types, sets, and
instances, 212–213
relationships as attributes, 214
role names and recursive relation-
ships, 215
sample database application,
202–203
summary and exercises, 232–241
UML class diagram notation,
226–228
value sets (domains) of attributes,
209–210
weak entity types, 219–220
ER-to-Relational mapping
algorithm for, 286–287
mapping binary 1:1 relationship
types, 289–290
mapping binary 1:N relationship
types, 290
mapping binary M:N relationship
types, 290–291
mapping multivalued attributes,
291
mapping N-ary relationship
types, 291–292
mapping regular entity types,
287–288
mapping weak entity types,
288–289
summary of mapping constructs,
292–294
ERP (Enterprise Resource Planning)
database back-ends and, 25
federated databases and, 886
SANs (Storage Area Networks)
and, 621
Errors/exceptions
in Java, 459–461
in ODMG object model, 383
recovery needed due to, 750
reliability and availability and,
881
ETL (extraction, transformation,
and loading) tools, 1069
Event-based processing, in XML,
423
Event-Condition-Action (ECA)
model, 933
Events
as component of triggers, 133
specifying, 943
Events, in ECA model
defined, 933–934
in STARBURST example, 940
Example elements, QBE, 1091
EXCEPT operation
in relational algebra, 152–155
as SQL set operations, 104
Exception objects, in knowledge
representation, 268
Exceptions. See Errors/exceptions
Execution autonomy
in distributed databases, 881
in federated databases, 886–887
Execution transparency, in distrib-
uted databases, 881
Executive information systems
(EIS), 1068
Existence dependency, in binary
relationships, 217
Existential quantifiers
transforming, 180
1146 Index
in tuple relational calculus,
177–178
EXISTS function, SQL, 120–122
Expanding or growing (first) phase,
in two-phase locking, 782
Expert database systems, 932
Export schema, in federated data-
base architecture, 891
Expressions
in-line expressions in relational
algebra, 151
safe/unsafe expressions in tuple
relational algebra, 182–183
in tuple relational calculus, 176–177
Extends keyword, extending inheri-
tance, 383
Extensible hashing, 612–614
Extensible Stylesheet Language
Transformations (XSLT), 415,
436
Extensible Stylesheet Language
(XSL), 415, 436
Extension. See Database state
(snapshot)
Extensions, SQL, 88
Extents
constraints corresponding to type
hierarchies, 366
defined, 369
object persistence and, 363
in ODMG object model, 388–390
External hashing, 609–611
External schema
in federated database architecture,
891
in three-schema architecture, 34
Extraction, transformation, and
loading (ETL) tools, 1069
F-score, measures of relevance in IR,
1017
Faceted searches, 1028–1029
Facets, 1028–1029
Fact constellation, in multidimen-
sional data models, 1074
Fact-defined predicates (relations),
978
Fact tables, in multidimensional
data model, 1073
Factory objects, in ODMG object
model, 388–390
Facts, in deductive databases, 970
Failed state, transactions, 752
Fan-out, of multilevel index, 643
Faults, reliability and availability
and, 881
FCIP (Fiber Channel over IP), 624
FCoE (Fiber Channel over
Ethernet), 624
FDBMS (federated database man-
agement systems), 50
FDBSs (federated database systems)
architecture of, 890–891
defined, 885
overview of, 885–887
Feasibility analysis, 307
Features, in vector space model for
IR, 1003
Federated database management
systems (FDBMS), 50
Federated database systems. See
FDBSs (federated database
systems)
Federated schema, in federated data-
base architecture, 891
Federated warehouses, 1078
Feedback loops, between phases of
database design, 310
Fiber Channel over Ethernet
(FCoE), 624
Fiber Channel over IP (FCIP), 624
Field models, spatial data, 960
Fields
connecting fields for relationships
between file records, 616
hash field, 606, 608
indexing fields (or attributes). See
Indexing fields (or attributes)
logical field references for rela-
tionships between file records,
617
ordering and key fields, 603
of records, 594–595
search field, 648
Fifth normal form (5NF), 534–535
File of commands, in SQL program-
ming, 449
File servers, in client/server archi-
tecture, 45
Files (of records)
allocation of file blocks on disk,
598
B-trees and data structures in
organization of, 617
data organization and, 587
database approach compared with
file processing, 9–10
dynamic file expansion, 611–612
dynamic hashing, 614
extensible hashing, 612–614
external hashing, 609–611
fixed-length records and variable-
length records, 595–597
hashing techniques, 606
headers (descriptors), 598
internal hashing, 606–609
linear hashing, 614–616
of mixed records, 616–617
operations on, 599–601
of ordered records (sorted files),
603–606
organization of, 601
placing file records on disk, 594
simple searches, 685
of unordered records (heap files),
601–602
Filtering
in agent-based approach to Web
content analysis, 1024
classification process in manda-
tory access control, 848
protecting against SQL injection,
858
Finances, applying data mining to,
1060
Find operation, on files, 599–600
FindAll operation, on files, 600
FindNext operation, on files, 600
FindOrdered operation, on files, 600
Fingerprinting, database, 857
First-come-first-served queues, deal-
ing with starvation, 788
First normal form (1NF), 65,
519–523
Fixed-head disks, 591
Fixed-length records, 595–597
Flash memory, 585
Flat data models, 436–440
Flat files, in relational model, 60
Flat relational model, 65
Flexibility, as benefit of database
approach, 22
Flow analysis, for spatial databases,
959
Flow control
covert channels, 861–862
overview of, 860–861
security control measures, 838
Flow policies, 860
FLWR expressions, XQua, 434
Folding technique, in hashing, 608
Force/no-force techniques
in database recovery, 811–812
UNDO/NO-REDO recovery algo-
rithm using, 818–819
Force-writing, log buffers, 754
Index 1147
FOREIGN KEY clause, of CREATE
TAB LE command, 96
Foreign keys
ER-to-Relational mapping of
binary 1:1 relationship types,
289
inclusion dependencies and, 571
in RDBs, 396
relational data model and, 73–74
Formatting disks, 589
Forms
collecting data from/inserting
record into, 493–494
PHP, 490–491
Forms-based interfaces, DBMS, 38
Forms specification languages,
38–39
Formulas
in domain calculus, 183
in tuple relational calculus,
176–177
Forward engineering, Rational Rose
and, 338
Fourth normal form (4NF)
formal definition of, 533–534
multivalued dependency and,
531–533
restating definition of, 568–570
FP-growth algorithms, in data min-
ing, 1045–1047
FP-tree (frequent-pattern tree) algo-
rithm, in data mining,
1043–1045
Fragmentation
in distributed databases, 894–896
example of, 898–901
transparency of, 880
Fragmentation schema, of data-
bases, 896
Free-form search requests, 995
FROM clause
of SELECT command, 107
in SQL retrieval queries, 129–130
Full functional dependency, in 2NF,
523
Fully inverted files, 669
Fully replicated catalogs, 913
Function-based indexes, 666–667
Function call injection attack,
856–857
Function calls, database program-
ming with
advantages/disadvantages, 477
approaches to database program-
ming, 449
JDBC for Java programming,
469–473
overview of, 461–464
PHP and, 491
SQL/CLI with C as host language,
464–468
Functional data models, 214
Functional dependencies
based on arithmetic functions
and procedures, 572–574
equivalence of sets of, 549
existence dependency and, 217
full functional dependency in
2NF, 523
inclusion dependencies, 571
inference rules for, 545–549, 568
JD (join dependencies), 534–535
minimal sets of, 549–551
MVD (multivalued dependency),
68, 531–533
overview of, 513–516
relational model constraints, 68
template dependencies, 572
transitive dependencies in 3NF,
523–524
types of constraints, 74
Functional requirements, in data-
base design, 200–201
Functions. See also Operations
as attributes and operations, 365
identifying functional behavior
for transactions, 322
PHP, 488–490
protecting against SQL injection,
858
QBE (Query-By-Example), 1095
SQL/PSM (SQL/Persistent Stored
Modules), 473–475
Fuzzy checkpoints
in ARIES recovery algorithm,
822
in database recovery, 812–813
Garbage collection, when transac-
tion commits, 821
GAs (genetic algorithms), 1059
GCS (global conceptual schema),
315, 889
Generalization. See
Specialization/generalization
Generalized model, for active data-
base systems, 933–937
GENERALIZED PROJECTION,in
relational algebra, 165–166
Generic IR pipeline, 1000–1001
Genetic algorithms (GAs), 1059
Geographic Information Systems.
See GIS (Geographic
Information Systems)
GIF image format, 966
GIS (Geographic Information
Systems)
spatial databases and, 958
types of databases, 3
Global conceptual schema (GCS),
315, 889
Global query optimization, 901
Global recovery manager, 825, 908
Global transaction manager, 907
Granting privileges
example, 845–846
GRANT OPTION, 844
overview of, 843
Granularity level, in locking
multiple granularity level locking,
796–798
overview of, 795–796
Granularity, of points in temporal
databases, 945
Graphical user interfaces (GUIs), 20,
39
Graphs. See also Diagrams
converting graph data into XML
trees, 441
creating hierarchical XML views
over flat or graph-based data,
436–440
hierarchies (acyclic graphs), 50
predicate dependency graph, 982
query graphs, 179–180, 679,
701–703
wait-for graph, 787
Grid files
for organizing file data, 662–663
for spatial indexing, 962
Ground axioms, in deductive data-
bases, 975
Group by clause, in OQL, 405–406
GROUP BY clause, in SQL
aggregation and, 698
overview of, 126–129
in retrieval queries, 129–130
of
SELECT command, 107
Grouping
aggregation and, 124–125,
166–168
GROUP BY and HAVING clauses
for, 126–129
Grouping attributes, 126
Grouping operator, in QBE (Query-
By-Example), 1095–1098
1148 Index
Growing (first) phase, in two-phase
locking, 782
Guided participation, in social
searches, 1029
GUIs (graphical user interfaces), 20,
39
Handle, C pointer variable and,
465–466
Hard drives, 591. See also Disk
devices
Hardware
addresses, 590
costs in choosing a DBMS, 323
structures of disk devices,
588–592
Hash field, 606
Hash field space, 608
Hash file, 606
Hash function (randomizing func-
tion), 606
Hash keys, 606, 686
Hash tables, 606
Hash values, of a record, 612
Hashing
cost functions for SELECT opera-
tions, 713
implementing set operations,
697–698
partitioned, 661–662
Hashing indexes
for decision making in database
design, 730–731
overview of, 663
Hashing techniques, files
dynamic file expansion, 611–612
dynamic hashing, 614
extensible hashing, 612–614
external hashing, 609–611
internal hashing, 606–609
linear hashing, 614–616
overview of, 606
Having clause, in OQL, 406
HAVING clause, in SQL
aggregate functions used in, 125
overview of, 127–129
in retrieval queries, 129–130
of SELECT command, 107
Health care, applying data mining
to, 1060
Heterogeneous databases
DDBMSs, 50
in Oracle, 918
Heuristic components, of design
tools, 344
Heuristic rules, 681, 701
Heuristics, in query optimization
converting query trees into query
execution plans, 709–710
heuristic algebraic optimization
algorithm, 708–709
notation for query trees and
query graphs, 701–703
optimization of query trees,
703–706
overview of, 700–701
transformation rules for relational
algebra operations, 706–708
Hierarchical data models
classifying DBMSs and, 49
overview of, 52
types of data models, 31
Hierarchical data models, for XML
converting graph data into XML
tree, 441
creating hierarchical XML views
over flat or graph-based data,
436–440
overview of, 420–422
Hierarchies
association rules among,
1047–1048
in object data models, 50
specialization hierarchies,
254–255
type hierarchies, 364–367
High-level data models, 30
High-level (nonprocedural) DMLs, 37
High-level query languages, 361
Histograms, catalog information
used in cost functions, 713
HITS ranking algorithm, 1021–1022
Homogeneous DDBMSs, 49
Horizontal fragmentation, 880, 895
Horizontal partitioning, in database
tuning, 736
Horizontal propagation, of privi-
leges, 846
Horn, Alfred, 973
Horn clauses, in deductive database
systems, 974–975
Host languages
C as host language in SQL/CLI,
464–468
in database programming, 452
DML and, 38
HSV (hue, saturation, and value),
967
HTML (HyperText Markup
Language)
hypertext documents and, 415
long text strings in HTML files,
484
unstructured data and, 418–420
Web publishing language, 24
Hubs, of Web pages or Web sites,
1020
Hue, saturation, and value (HSV),
967
Hybrid hash-join, 696
Hybrid XML documents, 422
Hyperlinks
browsing and, 999
destination page and anchor text
components, 1020
for linking Web documents, 24
Hypertext documents, on Web, 415
HyperText Markup Language. See
HTML (HyperText Markup
Language)
Hypertext Preprocessor, 482
Hyphens, text preprocessing in
information retrieval, 1011
Hypothesis tuples, in template
dependencies, 572
I/O performance, in database
tuning, 733
Idempotent operations,
UNDO and
REDO, 809
Identification
as abstraction process, 269
goals of data mining, 1038
of multimedia sources, 965
Identifiers, 269
Identifying (or owner) entity type,
219
Identifying relationship, of weak
entities, 219
Identity Management, in security,
852
IE (information extraction), 1012
Image data, in GIS systems, 960
Images, in multimedia databases
analysis of, 967–968
formats, 965–966
object recognition, 967
overview of, 932, 965
semantic tagging, 969
storage/retrieval, 25
Immediate consideration, rule con-
sideration in active databases,
938
Immediate update techniques,
808–809
overview of, 807, 809
recovery based on, 817–820
Index 1149
UNDO/NO-REDO recovery
algorithm, 818–819
UNDO/REDO recovery algorithm,
819
Immutable property, of OIDs, 357
Impedance mismatch problem, in
traditional databases, 19
Implementation
in database application life cycle,
308
database design and, 309–311
of database operations, 12
of database system, 327–328
encapsulation and, 361
goodness of relation schemas and,
502
issues in active database systems,
937–940
of object operations, 356
tuning and, 311
Implementation data models, 31
Implementation phase, of informa-
tion system (IS) life cycle, 307
In-line expressions, in relational
algebra, 151
Inclusion dependencies, 571–572
Incorrect summary problem, in
concurrency control, 748–749
Increment operator, SQL, 105
Incremental updates, 136
Indexed allocation, of file blocks on
disk, 597
Indexed (ordered) collection expres-
sions, in OQL, 405
Indexed Sequential Access Method
(ISAM), 631, 644–645
Indexed sequential file, 605, 644
Indexes
as access paths in physical data
models, 31
B-trees, 649–652
B+-trees, 652–655
bibliographic references, 674–675
bitmap, 663–666
clustering, 635–636
column-based storage of relations
and, 669–670
cost functions for
SELECT opera-
tions, 713
database storage and, 583
database tuning and, 734–735
DBMS queries and, 19
dynamic multilevel, 646–647
function-based, 666–667
grid files, 662–663
hash, 663
inverted indexing for information
retrieval, 1012–1014
issues with, 668–669
locks for concurrency control in,
798–801
methods for complex selection,
686–687
methods for simple selection, 686
multilevel, 643–646
on multiple keys, 660–661
ordered on multiple attributes,
661
partitioned hashing, 661–662
physical database design and,
730–731
physical vs. logical, 668
primary, 605, 633–635
rebuilding to improve perfor-
mance, 735
search, insertion, deletion with
B+-trees, 655–660
search trees, 647–649
secondary, 636–642
simple searches, 685
single-level, 632–633
spatial, 961–963
summary and exercises, 670–674
tables comparing index types, 642
text-based indexing of audio data,
969
variations on B-trees and
B+-trees, 660
Indexing fields (or attributes)
records and, 631
secondary indexes, 636
single-level indexes, 632
Inductive knowledge, 1038
Inference
control measures, 837–838
in databases, 21–22
in knowledge representation, 268
statistical databases and, 859–860
Inference (deduction mechanism)
engine
deductive database systems and,
970
nonrecursive Datalog queries and,
981
in Prolog/Datalog, 975
Inference rules
Armstrong’s, 548
for functional and multivalued
dependencies, 568
for functional dependencies,
545–549
Information extraction (IE), 1012
Information privacy, vs. information
security, 841–842
Information repository
DBMS tools, 43
organizations using, 306
Information Retrieval. See IR
(Information Retrieval)
Information system (IS)
vs. information privacy, 841–842
life cycle of, 307–308
Informational searches, 996
INFORMATION_SCHEMA, SQL, 90
Inherent rules, of data models, 21
Inheritance
comparing RDB design with
ODB design, 396
extending, 383
multiple, 256–257, 368
ODB features included in SQL,
370
ODL and, 395
in ODMG object model, 383
in OO systems, 356
selective, 368
shared subclasses, 297
single, 256–257
specifying in SQL, 375–376
table inheritance in SQL, 376
type hierarchies and, 364–367
type inheritance in EER model,
248
Initial state, populating (loading)
databases and, 33
Inline views, SQL, 137
Inmon, W. H., 1068
Inner joins
vs. outer joins, 160–161
in SQL, 123–124
Input/output, identifying for trans-
actions, 322
Input validation filtering, 858
INSERT command, SQL
active rules and, 936
overview of, 107–109
Insert operation
concurrency control techniques,
800–801
on files, 600
relational data model operations,
76–77
Insertion anomalies, reducing
redundant information in
tuples, 507–508
Inside-out strategy, for schema
design, 316
Instance variables, specifying, 356
1150 Index
Instances
current set in database state, 32
database schemas, 32–33
relational database state, 70
of specialization, 249
Instantiation, as inverse of classifica-
tion, 268
Instead triggers, in active database
systems, 938
Integrity constraints
active databases enforcing, 943
in databases, 20–21
entity integrity constraint, 73
in mandatory access control, 850
in relational data model, 73–74
relational database schema and, 70
Integrity loss, as security threat, 836
Intellectual property rights, 867
Intension entity type, describing for
entity set, 208
Interaction diagrams, UML, 331
Interactive query interface
SQL programming, 448
user interaction with databases
via, 40
Interactive transactions, concur-
rency control and, 801
Interblock gaps
disk parameter for, 1088
structures of disk devices, 589
Interfaces
for database operations, 12
DBA, 40
DBMS, 38–40
design tools and, 344
GUIs (graphical user interfaces),
20, 39
for high-level query languages, 38
for interactive queries, 40
multiple user, 20
in ODMG object model, 382–385
of operations, 356, 361
Interinstance integrity, 850
Interleaved concurrency
on disks, 593–594
multiprogramming and, 745
Internal hashing, 606–609
Internal schema, in three-schema
architecture, 34
International Standards
Organization (ISO), 88
Internet SCSI (ISCSI), 623–624
Interpolating variable, within
strings, 485
INTERSECT operation, SQL set
operations, 104
INTERSECTION operation
algorithms for, 697–698
in relational algebra, 152–155
INTERVAL data type, SQL
overview of, 93
as temporal data type, 945
Intranets, searches over, 996
Invalid state, of relational databases,
71
Inverted indexing, for information
retrieval, 1012–1014
IR (Information Retrieval)
bibliographic references,
1033–1034
Boolean model for, 1002–1003
comparing databases to, 26,
997–998
comparing Web search and analy-
sis to, 1018–1019
generic IR pipeline, 1000–1001
history of, 998–999
inverted indexing, 1012–1014
measures of search relevance,
1014–1015
mode of interaction in,
999–1000
overview of, 26, 993–997
probabilistic model for, 1005–1006
query types in, 1007–1009
recall and precision metrics in,
1015–1017
semantic model for, 1006–1007
summary and exercises,
1030–1032
text preprocessing in, 1009–1012
trends in, 1028–1030
vector space model for,
1003–1005
IS-A-COMPONENT-OF, 270
IS-A-MEMBER-OF, 268
IS-A (or IS-AN) relationships
class/subclass relationships in
EER model, 247
in EER model, 264
IS-A-PART-OF, 270
IS-A-SUBCLASS-OF, 269
IS-AN-INSTANCE-OF, 268
IS-ASSOCIATED-WITH, 270
IS (information system)
vs. information privacy, 841–842
life cycle of, 307–308
ISAM (Indexed Sequential Access
Method), 631, 644–645
ISCSI (Internet SCSI), 623–624
ISO (International Standards
Organization), 88
Isolation level, transaction support
in SQL, 770
Isolation property, transactions, 14,
754–755
Items, stored in records, 594
Itemsets
Apriori algorithm finding fre-
quent (large), 1041–1042
association rules and, 1040–1041
FP-growth algorithms for finding
frequent, 1045–1047
FP-tree algorithms for finding fre-
quent, 1044–1045
partition algorithm for local fre-
quent, 1047
sampling algorithm and, 1043
Iteration markers, in sequence dia-
grams, 332
Iterator objects, in ODMG object
model, 383
Iterator variables, in OQL, 399–400
Iterators
looping in SQL queries, 98
looping over tuples in a query
result, 450
retrieving multiple tuples in
SQLJ, 461–464
Java
embedding SQL commands in,
459–461
JDBC programming, 469–473
SQLJ and, 452
Java Database Connectivity. See
JDBC (Java Database
Connectivity)
JD (join dependencies), 534–535
JDBC class libraries, 469
JDBC driver, 469
JDBC (Java Database Connectivity)
client/server architecture for
DBMSs, 47
for Java programming, 469–473
library of functions, 448
Job mix, in database design, 728
Join attributes, 159, 689
Join conditions
in domain calculus, 184
SELECT command and, 100
temporal intersection join, 952
Join dependencies (JD), 534–535
Join indexing, in multidimensional
data models, 1075
JOIN operations
cost functions for, 715–718
distributed query processing using
SEMIJOIN operation, 904
Index 1151