1152 Index
EQUIJOIN and NATURAL JOIN
variations, 159–161
hybrid hash-join, 696
implementing, 689–690
join selection factors, 693–694
multiple relation queries and
JOIN ordering, 718–719
nested-loop joins, 690–693
overview of, 157–158
partition-hash joins, 694–696
Join operations, in QBE, 1094–1095
Join selection factors, 693–694
Join selectivity ratio, 160, 715
Joined tables (relations), 123–124
JPEG image format, 966
K-means clustering algorithm,
1055–1056
KDD (Knowledge Discovery in
Databases), 1036
Key attribute, 209
Key constraints
on entity attributes, 208–209
integrity constraints in databases,
21
overview of, 68–70
specifying in SQL, 95–96
Key field, sorted files and, 603
Keys
candidate and primary in rela-
tional databases, 518–519
indexes on multiple, 660–661
methods for simple selection, 686
in ODMG object model, 388–390
specifying in XML schema, 430
Keyword queries
overview of, 39
searching with, 995
types of queries in IR systems,
1007
Kleinberg, Jon, 1021
Knowledge-based systems, 932, 1007
Knowledge Discovery in Databases
(KDD), 1036
Knowledge discovery process
data mining in, 1036–1037
goals of, 1037–1038
types of knowledge discovered,
1038–1039
KR (knowledge representation)
aggregation and association,
269–271
classification and instantiation,
268
compared with semantic data
models, 267–268
identification, 269
overview of, 245
specialization and generalization,
269
Label-based security
administrator defining policy for,
853
Oracle Label Security, 868–870
Label Security administrator, 853
Labels, semistructured data and, 417
LANs (local area networks), 44, 879
Large databases, 304
Latches, for short term locks, 802
Late (dynamic) binding, in ODMS,
368
Latency. See Rotational delay (rd)
Lattices, for specialization, 255–256
LCS (local conceptual schema), 889
LDAP (Lightweight Directory Access
Protocol), 919–921
Leaf classes, 265
Leaf-deep trees, 718
Leaf nodes, of tree structures, 646
Learning approaches
classification and, 1051
clustering and, 1054
neural networks and, 1058
Legacy data models, 51
Legacy database systems, 49, 60
Legal relation states (legal exten-
sions), 514
Levels of isolation, of transaction,
755
Libraries of functions. See Function
calls, database programming
with
Lifespan temporal attributes,
953–954
Lightweight Directory Access
Protocol (LDAP), 919–921
LIKE comparison operator, in string
pattern matching, 105
Linear hashing, 614–616
Linear regression, 1058
Linear searches
with brute force algorithm,
685–686
cost functions for SELECT opera-
tions, 713
of file blocks on disk, 597
of files, 602
Lines, on maps, 960
Link structure, of Web pages,
1020–1021
Linked allocation, of file blocks on
disk, 597
Links, in UML class diagrams, 227
LIS (local internal schema), 889
List constructor, 359
Literals (values), 378–382
atomic formulas as, 973
atomic literals, 378
collection literals, 382
complex types for, 358–360
in OO systems, 358
structured literals, 378
Loading/converting data, in data-
base application life cycle, 308
Loading databases, initial state and,
33
Loading utility, for loading data files
to database, 42–43
Local area networks (LANs), 44, 879
Local conceptual schema (LCS), 889
Local internal schema (LIS), 889
Local query optimization, 902
Local schema, in federated database
architecture, 890
Localization, in distributed query
processing, 901
Location analysis, for spatial data-
bases, 959
Location transparency, 880
Lock compatibility table, 792
Lock manager subsystem, in DBMS,
779
Lock table, 779
Locking. See also Two-phase locking
for concurrency control, 777
granularity level in, 795–796
index locking and predicate lock-
ing, 801
multiple granularity level,
796–798
used in indexes, 798–800
Locks
binary, 778–780
certify locks, 792–793
conversion of, 782
shared/exclusive (read/write),
780–782
in two-phase locking, 778
Log buffers, 753–754
Log records, 753
Log sequence number (LSN), 822
Logic databases, 932. See also
Deductive database systems
Logic programming, 970
Logical (conceptual) level, goodness
of relation schemas and, 501
Logical data independence, in three-
schema architecture, 35–36
Logical data models, 341

Logical definitions, of domains, 61
Logical design, 9, 202
Logical field references, for relation-
ships between file records,
617
Logical indexes, vs. physical indexes,
668
Logical operators. See AND, OR,
NOT connectives
Logical ordering, secondary indexes
and, 642
Logical theory, in ontologies, 272
Login sessions, 839
Logs/logging
auditing and, 839–840
database recovery and, 808
tracking transaction operations,
753–754
during undo process, 821
Long-haul networks, 879
Long text strings, in HTML files,
484
Loss of integrity, as security threat,
836
Lossless (nonadditive) join property
decomposition into 3NF rela-
tions, 560–563
decomposition into 4NF rela-
tions, 570
normal forms and, 518
overview of, 553–556
successive, 557
testing binary decompositions for,
557
Lossy design, 554
Lost updates, in concurrency con-
trol, 748–749
Low-level data models, 30
Low-level (procedural) DMLs,
37–38
LSN (log sequence number), 822
MAC (mandatory access control)
classification attributes, tuple
classification, and multilevel
relations, 848–850
comparing with discretionary
access control, 850–851
overview of, 847
security classes in, 847–848
Macro life cycle, 307
Magnetic tape
for archiving and backup, 586
as storage devices, 592–593
Main memory, 585
Main memory database, 585
Main or master files, 605
Maintenance
database, 6
of derived data, 943
maintenance costs in choosing
DBMS, 323
Maintenance personnel, 17
Mandatory access control. See MAC
(mandatory access control)
Manipulating databases
overview of, 5
University student database
example, 9
Manufacturing, applying data min-
ing to, 1060
Map data, as spatial data, 959
Mapping
data model mapping. See Data
model mapping
from EER model to relational
model. See EER-to-Relational
mapping
from EER schema to ODB
schema, 397–398
from ER model to relational
model. See ER-to-Relational
mapping
between levels of three-schema
architecture, 35
Query mapping, 901
SELECT command, 97
tuples, 64
Market-basket data, association
rules and, 1040
Marketing, applying data mining to,
1060
Mass storage devices, 585
Massively parallel processing
(MMP), 1079
Master files, 605
Materialized evaluation, converting
query trees into query execu-
tion plans, 710
Materialized views
active rules for maintaining con-
sistency of, 943
data warehouses compared with,
1079
Mathematical relations, 59, 63
Mathematical set theory, 104
MAX function
aggregate functions in SQL,
124–125
grouping and, 166
implementing, 698
MBR (minimum bounding rectan-
gle), in R-Trees, 962
Index 1153
Measurement operations, for spatial
databases, 958
Mechanical arm, on hard disks, 591
Memory hierarchies, storage devices
and, 584–586
Memory usage, cost components of
query execution, 711
Menu-based interfaces, 38
Merge phase, of sort-merge strategy,
683
Messages, passing to objects, 356
Meta-classes, in knowledge repre-
sentation, 268
Meta-data
in DBMS catalog, 33
DBMSs managing, 306
defined, 5
describing structure of primary
database, 10–11
Metadata repository, in data ware-
housing, 1078
Metasearch engines, 1018
Methods. See also Operations
of object classes, 50
of object operations, 356
Metric operators, as spatial operator,
961
Metrics, for evaluating relevance in
IR, 1015–1017
MGL (multiple granularity locking),
797–798
Micro life cycle, 307
Middle tier, in three-tier architec-
ture, 48
Middle-tier Web servers, PHP, 482
Middleware software
federated databases and, 886
heterogeneous DDBMSs and, 50
MIN function
aggregate functions in SQL,
124–125
grouping and, 166
implementing aggregate opera-
tions, 698
Minimal model, for interpretation
of rules in deductive databases,
976
Minimal sets, of functional depen-
dencies, 549–551
Minimum bounding rectangle
(MBR), in R-Trees, 962
Minimum cardinality constraint,
217
Miniworld, 4
MINUS operation, in relational
algebra, 152–155
1154 Index
Mirroring (shadowing), RAID, 619
Mixed fragmentation, in distributed
databases, 896
Mixed strategy
for schema design, 316
for view integration process, 319
Mixed transactions, 322
MMP (massively parallel process-
ing), 1079
Model mapping. See Data model
mapping
Model-theoretic interpretation, of
rules in deductive databases,
976
Models, data. See Data models
Models, for interpretation of rules
in deductive databases, 976
Models, spatial, 959–960
Modification anomalies, avoiding
redundant information in
tuples, 509
Modifier operations, objects, 362
Modify operations, on files, 600.
See also Update operations
Modules
client and server, 29
DBMS, 16
DBMS component, 40–42
MOLAP (multidimensional OLAP),
1079
Monitoring and maintenance phase,
in database application life
cycle, 308
Morphological analysis, in semantic
model for IR, 1006
Movable-head disks, 591
MPEG image format, 966
Multidatabase systems
recovery techniques for, 825–826
types of distributed databases,
885
Multidimensional associations,
1048–1049
Multidimensional data models
decision-support technologies,
1069
dimension tables and fact tables,
1073
indexing, 1074–1075
roll-up and drill-down displays,
1072
schemas, 1073–1074
Multidimensional OLAP (MOLAP),
1079
Multilevel indexes
B-trees, 649–652
B+-trees, 652–655
dynamic, 646–647
overview of, 643–646
search, insertion, deletion,
655–660
search trees compared with,
647–649
variations on B-trees and
B+-trees, 660
Multilevel relations, in mandatory
access control, 848
Multimedia databases
analysis of audio data sources,
969
analysis of images, 967–968
object recognition, 968–969
overview of, 965–967
semantic tagging of images, 969
types of databases, 3
Multiple granularity locking (MGL),
797–798
Multiple hashing, in collision reso-
lution, 609
Multiple inheritance
in ODBs (object databases), 368
ODL (object definition language)
and, 395
subclasses and, 256
Multiple relations
options for mapping specializa-
tion or generalization, 295
queries and JOIN ordering,
718–719
Multiplicities, in UML class dia-
grams, 227
Multiprocessor systems, 879
Multiprogramming operating
systems, 744–745
Multiset (bag), of tuples, 103–105,
150
Multiuser DBMS systems, 49
Multiuser transactions
in databases, 13–14
processing system, 744–745
Multivalued attributes
declaring, 397
in ER model, 206
mapping ER-to-Relational data
models, 291
Multivalued dependency. See MVD
(multivalued dependency)
Multiversion concurrency control,
777, 791–793
Multiway joins, 124, 689
Mutually exclusive role, in role-
based access control, 851
MVD (multivalued dependency)
4NF and, 531–533
formal definition of, 533
inference rules for, 568
relational model constraints, 68
N-ary
relationship types, 291–292
strategies for view integration
process, 319
N-tier architectures, for Web appli-
cations, 47–49
Named iterator, SQLJ, 461
Named queries, in OQL, 402–403
Namespaces, XML, 428–429
Naming conventions
for constraints, in SQL, 96–97
for relations, 62
for schema constructs, 222
Naming mechanism, object persis-
tence and, 363
Naming transparency, 880
NAS (network-attached storage),
622–623
Native XML format
DBMSs, 49
overview of, 425
storing, 431
NATURAL JOIN operations,
123–124, 159–161
Natural language interfaces, 39
Natural language queries, 1009
Navigational searches, 996
Nearest neighbor, in spatial queries,
961
Negation symbol, in QBE, 1096
Negative associations, 1049–1050
Negative literals, in Datalog lan-
guage, 973
Nested-loop joins
cost functions for, 716
factors impacting performance of,
690–693
implementing, 689
Nested queries
correlated, 119–120
innermost, 119
overview of, 117–119
Nested relations
INF and, 521
SQL and, 111
Network-attached storage (NAS),
622–623
Network data models
classifying DBMSs and, 49
overview of, 51
types of data models, 31

Network transparency, 880
Neural networks, 1058
NO-UNDO/REDO recovery tech-
nique
based on deferred update, 815–817
overview of, 807, 809
No waiting algorithm, for deadlock
prevention, 787
Nodes, of tree structures, 646
Non-identifying relationships, in
Rational Rose, 340
Nonadditive (lossless) join property
decomposition into 3NF rela-
tions, 560–563
decomposition into 4NF rela-
tions, 570
normal forms and, 518
overview of, 553–556
successive, 557
testing binary decompositions for,
557
Nonprime attributes, 519
Nonprocedural languages, relational
calculus as, 174
Nonrecoverable schedules, transac-
tions, 758
Nonrecursive queries, evaluating in
Datalog, 981–983
Nonrelevant sets, in probabilistic
model for IR, 1005
Nonrepeatable reads, transaction
support in SQL, 771
Nonserial schedules, 761
Nontime-varying attributes, 953
Nonvolatile storage, in databases,
586
Normal forms
based on primary keys, 516–517
Boyce-Codd normal form
(BCNF), 529–531, 559–560
domain-key normal form
(DKNF), 531–533, 574–575
fifth normal form (5NF), 534–535
first normal form (1NF), 65,
519–523
fourth normal form (4NF),
531–534, 568–570
insufficiency of, 552
normalization of relations, 517
practical use of, 518
second normal form (2NF), 523,
526–527
temporal normal form, 952
tests, 517
third normal form (3NF),
523–525, 528, 558–563
Normalization
algorithms. See algorithms, nor-
malization
automated tools for database
design, 344
functional dependencies and, 545
relational database design based
on, 60
of relational schema design, 516
of relations, 517–518
NOT EXISTS functions, SQL,
120–122
NOT logical connective. See AND,
OR, NOT connectives
NOT NULL, specifying attribute
defaults in SQL, 94
Notation
diagrammatic, 516
in ER diagrams, 221–223,
1083–1085
for Prolog/Datalog languages,
970–973
for query graphs, 179–180,
701–703
for query trees, 163–165, 701–703
in relational data model, 66–67
in UML class diagrams, 226–228
Notification application, for active
databases, 942
NULL values
access control integrity, 850
comparisons involving, 116–117
constraints, 68–70
in ER model, 206
examples illustrating, 116
grouping tuples with, 128
problems in relational design,
563–565
reducing in tuples, 509–510
specifying attribute defaults in
SQL, 94
in tuples, 65–66
Numeric arrays, PHP, 487
Numeric data types, in SQL, 92
Object Data Management Group.
See ODMG (Object Data
Management Group)
Object data management systems.
See ODMS (object data man-
agement systems)
Object data models
classifying DBMSs and, 49
converting to/from logical
models, 341
object modeling, 245
ODMG object model, 376
Index 1155
overview of, 50
spatial data, 960
types of data models, 31
Object databases. See ODBs (object
databases)
Object definition language. See ODL
(object definition language)
Object diagrams, UML, 330
Object Identifiers. See OIDs (object
identifiers)
Object identifiers, in SQL, 111
Object lifeline, in sequence dia-
grams, 332
Object-orientation (OO), 355–357
Object-oriented analysis (OOA),
1083
Object-oriented database manage-
ment systems (OODBMSs), 49
Object-oriented databases. See
OODBs (object-oriented data-
bases)
Object-oriented programming
languages. See OOPLs (object-
oriented programming
languages)
Object recognition, in images,
968–969
Object-relational database manage-
ment systems (ORDBMS), 354
Object-relational (extended rela-
tional) systems, 51, 111
Object-relational model
creating tables based on UDTs, 374
encapsulation of operations,
374–375
ODB extensions to SQL, 369–370
OIDs using reference types,
373–374
specifying inheritance and over-
loading of functions, 375–376
specifying relationships via refer-
ence, 376
UDT (user-defined types) and
complex structures, 370–373
Objects
atomic (user-defined) objects,
386–388
complex types for, 358
in ODMG object model, 377–378
operations, 362–363
persistence of, 19, 363–364
state and behavior components
of, 355
visible/hidden attributes of, 361
Occurrences, current set in database
state, 32
1156 Index
ODBC (Open Database
Connectivity)
client-side API for calling
DBMSs, 47
data mining tools using, 1060
library of functions, 448
ODBs (object databases)
bibliographic references, 412–413
complex types for objects and lit-
erals, 358–360
conceptual design, 395–396
encapsulation of operations,
361–363
extensions to SQL, 369–370
list of concepts in, 369
mapping EER schema to ODB
schema, 397–398
multiple and selective inheritance,
368
OID (object identifiers), 357–358
OO (object-orientation) concepts
and features, 355–357
overview of, 353–355
persistence of objects, 363–364
polymorphism (operator over-
loading), 367–368
selective inheritance, 368
summary and exercises, 408–411
type hierarchies and inheritance,
364–367
ODL (object definition language)
binding ODL constructs to C++,
407–408
inheritance and, 395
in ODMG standard, 376
supporting semantic constructs of
ODMG object model, 390
type constructors in, 359–360
University student database
example, 391–395
ODMG (Object Data Management
Group)
C++ language binding in, 407
OQL (object query language) in
ODMG standard, 398
standards, 354, 376
ODMG object model
atomic (user-defined) types,
386–388
built-in interfaces and classes,
383–385
extents, keys, and factory objects,
388–390
inheritance in, 383
literals in, 378–382
objects in, 377–378
ODL (object definition language)
and, 390–395
overview of, 376–377
ODMS (object data management
systems). See also ODBs (object
databases)
complex types for objects and lit-
erals, 358
early (static) binding and late
(dynamic) binding, 368
high-level query languages used
by, 361
list of concepts in, 369
OIDs, 357, 377–378
overview of, 353
standard for, 376
Offline, storing data, 587
OIDs (object identifiers)
comparing RDB design with
ODB design, 395–396
ODB features included in SQL,
370
in ODMG object model, 377–378
reference types, 373–374
unique identity and, 357–358, 369
Okapi relevance system, in proba-
bilistic model for IR, 1006
OLAP (online analytical processing)
data mining tools, 1061
data warehousing and, 1067–1068
overview of, 3
relational and multidimensional,
1079
OLTP (online transaction process-
ing)
classifying DBMSs by purpose, 50
database support for, 1068
sharing data and multiuser trans-
actions, 13
transaction processing and, 79
Online analytical processing. See
OLAP (online analytical pro-
cessing)
Online data storage, 587
Online directories, 919–921
Online transaction processing. See
OLTP (online transaction pro-
cessing)
Ontologies
concepts, 267–268
defined, 272
OWL (Web Ontology Language),
969
Semantic Web and, 272–273
Web content analysis and,
1023–1024
OO (object-orientation), 355–357
OOA (object-oriented analysis),
1083
OODBMSs (object-oriented data-
base management systems), 49
OODBs (object-oriented databases)
attribute versioning for incorpo-
rating time in, 953–954
complexity of data and, 24
persistent storage and, 19
OOPLs (object-oriented program-
ming languages)
bindings to, 376
class declarations of, 364
instance variables in, 356
ODBs closely coupled with, 363
OO concepts, 355–356
Open addresses, collision resolution,
608
Open Database Connectivity. See
ODBC (Open Database
Connectivity)
Open operation, on files, 599
Operating costs, in choosing a
DBMS, 323–324
Operating systems. See OSs (operat-
ing systems)
Operations. See also Functions;
Methods
comparing RDB design with
ODB design, 396
in data models, 30
database, 12
in database application life cycle,
308
database design and, 201
encapsulation of, 361–363, 369
on files, 599–601
objects, 362–363
in ODMG object model, 387
pipelining, 700
query processing and optimizing,
700
transaction, 751–752
transformation rules for relation-
al algebra operations, 706–708
in UML class diagrams, 227
Operations, in relational data model
Delete operation, 77–78
Insert operation, 76–77
overview of, 75–76
Update (Modify) operation, 78–79
Operators
arithmetic operators in SQL,
105–106
Boolean, 1007

collection operators in OQL,
403–405
comparison operators in SQL, 98
concatenate operator in PHP, 485
grouping operator in QBE,
1095–1098
logical connectives. See AND, OR,
NOT connectives
overloading. See Polymorphism
(operator overloading)
relational, 980–981, 983
SELECT operator (σ), 147–149
spatial, 960–961
Operators, database workers behind
the scene, 17
Optical jukebox memories, 586
Optimization, in data mining, 1038
Optimizing queries. See Query pro-
cessing and optimizing
Optional fields, in file records, 595
OQL (object query language)
collection operators and, 403–405
extracting single elements from
singleton collections, 403
group by clause in, 405–406
in ODMG standard, 376, 398
ordered (indexed) collection
expressions, 405
overview of, 398–399
query results and path expres-
sions, 400–402
simple OQL queries, database
entry points, and iterator vari-
ables, 399–400
specifying views as named
queries, 402–403
OR logical connective. See AND, OR,
NOT connectives
Oracle
Cartridge, 931
distributed databases, 915–919
query optimization in, 721–722
Oracle Internet Directory, 919–921
Oracle Label Security
architecture of, 869
combining data labels and user
labels, 869–870
overview of, 868
virtual private database technolo-
gy, 868–869
ORDBMS (object-relational data-
base management systems), 354
ORDER BY clause, SQL
ordering query results, 106–107
in retrieval queries, 129–130
sorting query results, 682–683
Order preserving functions, hashing
and, 609
Ordered (indexed)
collection expressions in OQL, 405
cost functions for SELECT opera-
tions, 713
query results in SQL, 106–107
Ordered (sorted files), in records,
603–606
Ordering field, file organization and,
603
Ordering key, sorted files and, 603
Organization context, for database
systems, 304–307
OSs (operating systems)
DBMS access and disk read/write,
40
multiprogramming, 744–745
support for transaction process-
ing in distributed databases,
909
OUTER JOIN operations
implementing, 699–700
vs. inner joins, 160–161
overview of, 169–170
in SQL, 123–124
Outer queries, 117
OUTER UNION operation, in rela-
tional algebra, 170–171
Outliers, spatial, 965
Overflow (transaction) files, 605
Overlapping
entity sets, 253
specialization and, 264
OWL (Web Ontology Language),
969
Owner accounts, granting/revoking
privileges, 843–844
Package diagrams, UML, 330
PageRank algorithm, 1021
Parallel architecture, for servers,
1079
Parallel database management
systems, vs. distributed archi-
tecture, 887–888
Parallel processing
on disks, 593–594
handling multiple processes, 745
Parameterized statements (bind
variables), protecting against
SQL injection, 858
Parameters
disk blocks (pages), 1087–1089
SQL/PSM (SQL/Persistent Stored
Modules), 474
Parametric users, interfaces for, 39
Index 1157
Parser, checking query syntax with,
679
Partial categories, 260
Partial dependencies, 523
Partial keys, 219
Partial order, of transaction sched-
ule, 757
Partial specialization, 253–254, 264
Partially committed state, transac-
tions, 752
Partially replicated catalogs, 913
Participation constraints, on binary
relationships, 217
Partition algorithm, for local fre-
quent itemsets, 1047
Partition-hash joins
methods for implementing joins,
690
overview of, 694–696
Partitioned hashing, 661–662
Passwords, DBAs assigning, 839
Path expressions
dot notation for build path
expressions in SQL, 376
in OQL, 400
specifying with XPath, 432–434
Patterns
analysis phase of Web usage
analysis, 1027
data mining for discovering, 1057
substring pattern matching in
SQL, 105–106
within time series, 1039
PEAR (PHP Extension and
Application Repository), 491
Peer-to-peer database systems, 915
Performance
advantages of distributed data-
bases for, 882
DBMS utilities for monitoring, 43
Persistence
collections, 367
data, 586
objects, 363–364, 378
Persistent storage, of program
objects in databases, 19
Persistent stored modules (PSM),
474–476
Personal databases, 305
Personalization, of information in
Web searches, 1019
Personnel costs, in choosing a
DBMS, 323–324
PGP (Pretty Good Privacy), 854
Phantom records, concurrency con-
trol techniques, 800–801
1158 Index
Phantoms, transaction support in
SQL, 771
PHP
arrays, 486–488
bibliographic references, 497
collecting data from forms and
inserting records, 493–494
connecting to databases, 491–493
features, 484–485
functions, 488–490
overview of, 481–482
retrieval queries, 494–495
server variables and forms,
490–491
simple example of, 482–484
summary and exercises, 496–497
variables, data types, and con-
structs, 485–486
PHP Extension and Application
Repository (PEAR), 491
Phrase queries, types of queries in
IR systems, 1008
Physical clustering, of records on
disks, 617
Physical data independence, in
three-schema architecture, 36
Physical data models, 30
Physical database design. See also
Database design
bibliographic references, 740
data organization in, 587
denormalization as design deci-
sion related to query speed,
731–732
in ER (Entity-Relationship)
model, 202
factors influencing, 727–729
indexing decisions, 730–731
overview of, 9, 326–327
summary and exercises, 739–740
tuning and, 735–736
Physical database file structures, 583
Physical database phase, in database
design, 311
Physical indexes
vs. logical, 668
ordering primary and clustering
indexes, 642
Physical problems/catastrophes,
recovery needed due to, 751
Physical relationships, between file
records, 617
Pile file (heap), 602
Pipelined evaluation, converting
query trees into query execu-
tion plans, 710
Pipelining, combining operations
using, 700
Pivoting (rotation)
functionality of data warehouses,
1078
working with data cubes,
1070–1072
PL/SQL
designing database programming
language from scratch, 449
impedance mismatch and, 450
writing database applications
with, 447
Plaintext, 864
Point events (facts), in temporal
databases, 946
Pointers, blocks of data and, 597
Points
on maps, 959–960
in temporal databases, 945
Policies
access control for e-commerce
and Web, 854–855
flow policies, 860
for label-based security, 853
security policies, 836
Polygons, on maps, 960
Polyinstantiation, in mandatory
access control, 849–850
Polymorphism (operator overload-
ing)
defined, 369
in OO systems, 357
overview of, 367–368
specifying in SQL, 375–376
populating (loading) databases, 33
Populations, in statistical database
security, 859
Positional iterator, SQLJ, 461–462
Positive literals, in Datalog language,
973
Precedence graph (serialization
graph), 763–765
Precision metrics
finding relevant information and,
1019
measures of relevance in IR,
1015–1017
Precision, vs. security, 841
Precompilers
DML commands and, 42
embedded SQL and, 452
in SQL programming, 449
Predicate-defined (condition-
defined) subclasses, 252, 264
Predicate dependency graph, 982
Predicate locking, 801
Predicates
as arity or degree of p, 973
built-in, 972–973
fact-defined and rule-defined, 978
interpretation of, 976
in Prolog languages, 970–972
relational schemas and, 66
Prediction, as goal of data mining,
1037
Preprocessors
embedded SQL and, 452
in SQL programming, 449
in Web usage analysis, 1025–1027
Presentation layer (client), in three-
tier client/server architecture,
892
Pretty Good Privacy (PGP), 854
Primary file organization
B-trees as, 651
data organization and, 587
Primary indexes
cost functions for SELECT opera-
tions, 713
methods for simple selection, 686
for ordered records (sorted files),
605
overview of, 633–635
searching nondense multilevel
primary index, 646
tables comparing index types, 642
types of ordered indexes, 632
PRIMARY KEY clause, CREATE
TABLE command, 95
Primary keys
defined, 519
normal forms based on, 516–517
primary indexes and, 633
relational model constraints, 69
Primary site, concurrency control
techniques for distributed data-
bases, 910–911
Primary storage, 584
Prime attributes, 519, 526
Printer servers, in client/server
architecture, 45
Privacy
information privacy vs. informa-
tion security, 841–842
issues in database security,
866–867
protecting in statistical databases,
859
Private keys, in public (asymmetric)
key algorithms, 864
Privileged software, 19

Privileges
discretionary, 842–844
granting/revoking, 111, 844–846
limits on propagation of, 846–847
unauthorized escalation and
abuse, 855, 858
views for specifying, 844
Proactive updates, valid time rela-
tions and, 949
Probabilistic model, for information
retrieval, 1005–1006
Procedural DMLs, 37–38
Process-driven design, 310
PROCESS RULES, in active data-
base systems, 938
Processes
in database design, 322
multiprogramming and, 744
Processors, parallel, 1079
Program-data independence, 11–12,
23–24
Program-operation independence, 12
Program variables, 599
Programming languages
advantages/disadvantages of, 477
approaches to database program-
ming, 449
DBMS, 36–38
impedance mismatch and, 450
object-orientation creating com-
patibility between, 369
Web databases. See PHP
XML, 432–436
Programs, insulation between pro-
grams and data, 11–13
PROJECT operations
algorithms for, 696–697
Query processing and optimizing,
696–697
in relational algebra, 149–150
Projection attributes, SELECT com-
mand and, 98
Projective operators, types of spatial
operators, 961
Prolog language. See also Datalog
language
logic programming and, 970
notation, 970–973
Proof-theoretic interpretation, of
rules in deductive databases,
975
Properties, of association rules, 1041
Properties of relational decomposi-
tions
dependency preservation,
552–553
dependency-preserving and non-
additive join decomposition
into 3NF schemas, 560–563
dependency-preserving decompo-
sition into 3NF schemas,
558–559
insufficiency of normal forms
and, 552
nonadditive join decomposition
into BCNF schemas, 559–560
nonadditive (lossless) join,
553–556
overview of, 544, 551
successive nonadditive join
decompositions, 557
testing binary decompositions for
nonadditive join property,
553–556
Protocols
concurrency control, 777
deadlock prevention, 785–787
for ensuring serializability of
transaction schedules, 767–768
Proximity queries, 1008
PSM (Persistent stored modules),
474–476
Public (asymmetric) key algorithms,
863–865
Public keys, in public (asymmetric)
key algorithm, 864
Publishing XML documents, 431
Punctuation marks, text preprocess-
ing in information retrieval,
1011
Pure time conditions, 955
QBE (Query-By-Example)
basic retrieval in, 1091–1095
domain calculus and, 183, 185
grouping, aggregation, and data-
base modification in,
1095–1098
overview of, 1091
QMF (Query Management Facility),
185
Quadtrees, 963
Qualified aggregations, in UML class
diagrams, 228
Qualified associations, in UML class
diagrams, 228
Qualifier conditions, XPath, 432
Quality control, data warehousing
and, 1080
Quantifiers
collection operators in OQL,
403–405
existential and universal, 177–178
Index 1159
transforming, 180
using in queries, 180–182
Queries. See also OQL (object query
language); SQL (Structured
Query Language)
content-based retrieval, 965
database tuning and, 736–738
defined, 6
design decisions related to query
speed, 731–732
evaluating nonrecursive Datalog
queries, 981–983
information retrieval, 1007–1009
interactive interface for, 40
IR systems, 1007–1009
keyword-based, 39
modes of interaction in IR sys-
tems, 999
physical database design and,
728–729
processing in databases, 19–20
in Prolog languages, 973
retrieval queries from database
tables, 494–495
spatial, 958, 961
statistical, 859
TSQL2, 954–956
Query blocks, 681
Query-By-Example. See QBE
(Query-By-Example)
Query compilers, 41
Query decomposition, 905–907
Query execution plans
converting query trees into,
709–710
creating, 679
Query graphs
creating, 679
notation for, 179–180, 701–703
Query languages
DML as, 38
for federated databases, 886
SQL. See also SQL (Structured
Query Language)
TSQL2. See also SQL (Structured
Query Language)
Query Management Facility (QMF),
185
Query mapping, 901
Query modification, 135
Query optimizer, 41, 679
Query processing and optimizing
aggregate functions, 698–699
bibliographic references, 725
catalog information used in cost
functions, 712–713
1160 Index
converting query trees into query
execution plans, 709–710
cost components of query execu-
tion, 711–712
cost functions for JOIN, 715–718
cost functions for SELECT,
713–715
DBMS module for, 20
disjunctive selection conditions,
688
external sorting, 682–685
heuristic algebraic optimization
algorithm, 708–709
heuristic optimization of query
trees, 703–706
heuristics used in query optimiza-
tion, 700–701
hybrid hash-join, 696
implementing JOIN operations,
689–690
implementing SELECT opera-
tions, 685
join selection factors, 693–694
multiple relation queries and
JOIN ordering, 718–719
nested-loop joins, 690–693
notation for query trees and
query graphs, 701–703
operations, 700
OUTER JOIN operations, 699–700
overview of, 679–681
partition-hash joins, 694–696
PROJECT operations, 696–697
query optimization in Oracle,
721–722
search methods for complex
selection, 686–687
search methods for simple selec-
tion, 685–686
selectivity and cost estimates in
query optimization, 710–711
selectivity of conditions and,
687–688
semantic query optimization,
722–723
set operations, 697–698
summary and exercises, 723–725
transformation rules for relation-
al algebra operations, 706–708
translating SQL queries into rela-
tional algebra, 681–682
Query processing and optimizing, in
distributed databases
data transfer costs for distributed
query processing, 902–904
distributed query processing
using semijoin operation, 904
overview of, 901–902
query update and decomposition,
905–907
Query results
cursors for looping over tuples in,
450
ordering, 106–107
path expressions and, 400–402
retrieval queries from database
tables, 494–495
Query (transaction) server, in two-
tier client/server architecture,
47
Query trees
converting into query execution
plans, 709–710
creating, 679
notation for, 163–165, 701–703
optimization of, 703–706
R-Trees, for spatial indexing, 962
RAID (Redundant Array of
Inexpensive Disks)
levels, 620–621
overview of, 617–619
performance improvements,
619–620
reliability improvements, 619
RAM (Random Access Memory),
585
Random access storage devices, 592
Randomizing function (hash func-
tion), 606
Range queries, 686, 961
Range relations, of tuple variables,
175–176
Rational Rose
data modeler, 338
database design with, 337
tools and options for data model-
ing, 338–342
RBAC (role-based access control),
851–852
RBG (red, blue, green) colors, 967
RDBMS (relational database man-
agement systems)
creating indexes, 731
ORDBMS (object-relational data-
base management systems),
354
providing application flexibility,
23–24
two-tier client/server architec-
tures and, 46
RDBs (relational databases)
designing. See relational database
design
overview of, 395–396
schemas. See relational database
schemas
RDF (Resource Description
Framework), 436
Reachability, of objects, 363
Read command, hard disks, 591
Read-only transaction, 745
READ operation, transactions, 751
Read (or Get) operation, on files, 600
Read phase, of optimistic concur-
rency control, 794
Read-set, of transaction, 747
Read timestamp, 789
Read-write conflicts, in transaction
schedules, 757
Read/write heads, on hard disks, 591
Read/write, OSs controlling disk
read/write, 40
Read-write transactions, 745–747
read_item(X), 746
Real-time database technology, 3
Reasoning mechanisms, in knowl-
edge representation, 268
Recall metrics, in IR, 1015–1017,
1019
Recall/precision curve, in IR, 1017
Record-at-a-time DMLs, 38
Record-based data models, 31
Record pointers, 609
Records. See also Files (of records)
anchor record (block anchor), 633
blocking, 597
catalog information used in query
cost estimation, 712
fixed-length and variable-length,
595–597
inserting, 493–494
mixed, 616–617
ordered (sorted files), 603–606
phantom records, concurrency
control techniques, 800–801
placing file records on disk, 594
spanned/unspanned, 597–598
in SQL/CLI, 464–468
types of, 594–595
unordered (heap files), 601–602
Recoverability, transaction sched-
ules based o, 757–759
Recovery. See also Backup and
recovery; Database recovery
techniques

transaction management in dis-
tributed databases, 912–913
types of failures and, 750–751
Recursive closure operations, in
relational algebra, 168–169
Recursive relationships, 168, 215
Recursive rules, in Prolog languages,
972
Red, blue, green (RBG) colors, 967
REDO phase, of ARIES recovery
algorithm, 823
Redo transaction, 753
REDO, write-ahead logging and,
810–811
Redundancy, controlling in data-
bases, 17–18
Redundant Array of Inexpensive
Disks (RAID). See RAID
(Redundant Array of
Inexpensive Disks)
REF keyword, specifying relation-
ships via reference, 376
Reference types, OIDs using,
373–374
References
foreign key, 73
representing object relationships,
360
specifying relationships via
reference, 376
Referencing relations, 73
Referential integrity constraints
inclusion dependencies and, 571
integrity constraints in databases,
21
relational data model and, 73–74
specifying in SQL, 95–96
Reflexive associations, in UML class
diagrams, 227
Regression function, 1058
Regression, in data mining,
1057–1058
Regression rule, 1057
Regular entity types, 219, 287–288
Relation extension, 62
Relation intension, 62
Relation nodes
notation for, 703
in query graphs, 179
Relation schemas
domains and, 61
goodness of, 501–502
in relational databases, 501
Relation (table) level, assigning priv-
ileges at, 842–843
Relational algebra
aggregate functions and grouping,
166–168
bibliographic references, 194–195
CARTESIAN PRODUCT opera-
tion, 155–157
complete set of relational algebra
operations, 161, 164
DIVISION operation, 162–163
EQUIJOIN and NATURAL JOIN
operations, 159–161
examples of queries in, 171–174
generalized projection, 165–166
JOIN operation, 157–158
notation for query trees, 163–165
OUTER JOIN operations,
169–170
OUTER UNION operation,
170–171
overview of, 145–146
PROJECT operation, 149–150
recursive closure operations,
168–169
RENAME operation, 151–152
SELECT operation, 147–149
sequences of operations, 151
summary and exercises, 185–194
transformation rules for opera-
tions, 706–708
translating SQL queries into,
681–682
UNION, INTERSECTION, and
MINUS operations, 152–155
Relational calculus
domain (relational) calculus,
183–185
overview of, 146–147
tuple relational calculus. See Tuple
relational calculus
Relational completeness, of rela-
tional query languages, 174
Relational data model
bibliographic references, 85
characteristics of relations, 63–66
classifying DBMSs and, 49
concepts, 60–61
constraints, 67–70
correspondence to ER model, 293
Delete operation, 77–78
domains, attributes, tuples, and
relations, 61–63
formal languages for. See
Relational algebra; Relational
calculus
Insert operation, 76–77
Index 1161
integrity, referential integrity, and
foreign keys, 73–74
in list of data model types, 31
mapping from EER model to. See
EER-to-Relational mapping
mapping from ER model to. See
ER-to-Relational mapping
notation, 66–67
other types of constraints, 74–75
overview of, 50, 59–60
practical language for. See SQL
(Structured Query Language)
schemas, 70–73
SQL compared with, 97
summary and exercises, 79–85
transactions and, 79
update operations, 75–76, 78–79
Relational database design
algorithms for, 557, 566–567
attribute semantics in, 503–507
bibliographic references, 302, 579
bottom-up approach to, 544
Boyce-Codd normal form
(BCNF), 529–531
dependency preservation proper-
ties of decompositions,
552–553
dependency-preserving and non-
additive join decomposition
into 3NF schemas, 560–563
dependency-preserving decompo-
sition into 3NF schemas,
558–559
disallowing possibility for spuri-
ous tuples, 510–513
domain-key normal form
(DKNF), 574–575
equivalence of sets of functional
dependencies, 549
first normal form (1NF), 519–523
formal analysis of relational
schemas, 513
formal definition of fourth nor-
mal form, 533–534, 568–570
functional dependencies based on
arithmetic functions and pro-
cedures, 572–574
functional dependency and,
513–516
general definition of second nor-
mal form, 526–527
general definition of third normal
form, 528
goodness of relational schemas,
501–502
1162 Index
inclusion dependencies, 571–572
inference rules for functional and
multivalued dependencies, 568
inference rules for functional
dependencies, 545–549
informal guidelines for relational
schemas, 503, 513
join dependencies and fifth nor-
mal form, 534–535
key definitions, 518–519
mapping from EER model to
relational model. See EER-to-
Relational mapping
mapping from ER model to rela-
tional model. See ER-to-
Relational mapping
minimal sets of functional
dependencies, 549–551
multivalued dependency and
fourth normal form, 531–533
nonadditive join decomposition
into 4NF relations, 570
nonadditive join decomposition
into BCNF schemas, 559–560
nonadditive (lossless) join prop-
erties of decompositions,
553–556
normal forms based on primary
keys, 516–517
normalization of relations,
517–518
NULL values and dangling tuples
and, 563–565
overview of, 285
practical use of normal forms,
518
reducing NULL values in tuples,
509–510
reducing redundant information
in tuples, 507–509
relational decomposition and
insufficiency of normal forms,
552
second normal form (2NF), 523
successive nonadditive join
decompositions, 557
summary and exercises, 299–301,
575–578
template dependencies, 572
testing binary decompositions for
nonadditive join property, 557
third normal form (3NF),
523–525
top-down and bottom-up
approaches, 502
tuning and, 733
Relational database management
systems. See RDBMS (relational
database management systems)
Relational database schemas
algorithms for schema design,
557
bibliographic references, 542
clear semantics for attributes in,
503–507
components of, 70–73
disallowing possibility for spuri-
ous tuples, 510–513
formal analysis of, 513
functional dependency and,
513–516
informal guidelines, 503, 513
overview of, 501–502
reducing NULL values in tuples,
509–510
reducing redundant information
in tuples, 507–509
relation schemas in, 501
summary and exercises, 535–542
Relational database state, 70
Relational design by analysis, 543
Relational design by synthesis, 544
Relational expressions, 983
Relational OLAP (ROLAP), 1079
Relational operators
in deductive database systems,
980–981
relational expressions and, 983
Relations (relation states). See also
Tables
alternative definition of, 64–65
column-based storage of, 669–670
defined, 61
interpretation (meaning) of, 66
legality of, 514
normalization of, 517–518
ordering tuples in, 63
ordering values within tuples, 64
overview of, 62–63
values and NULLS in tuples,
65–66
Relations, temporal
bitemporal time, 950–952
transaction time, 949–950
valid time, 947–949
Relationship relation (lookup table)
mapping of binary 1:1 relation-
ship types, 289
mapping of binary 1:N relation-
ship types, 290
mapping of binary M:N relation-
ship types, 290–291
Relationships
in data modeling, 31
in ODMG object model, 386
references to, 360
representing in OO systems, 356
specifying by reference, 376
symbols for, 1084
University student database
example, 7
Relationships, in EER model
class/subclass relationships, 247
specific relationship types and,
249–250
Relationships, in ER model
attributes of relationship types,
218
constraints on binary relationship
types, 216–218
degree of relationship greater
than two, 228–232
degree of relationship type,
213–214
overview of, 212
relationship types, sets, and
instances, 212–213
relationships as attributes, 214
role names and recursive relation-
ships, 215
Relevant sets, in probabilistic model
for IR, 1005
Reliability, in distributed databases,
881, 882
Remote commands, for SQL injec-
tion attacks, 857
RENAME operation, in relational
algebra, 151–152
Reorganize operation, on files, 600
Repeating field or groups, in file
records, 595
Repeating history, in ARIES recov-
ery algorithm, 821
Replication
active rules for maintaining con-
sistency of replicated tables, 943
in distributed databases, 897
example of fragmentation, alloca-
tion, and replication, 898–901
transparency of, 880
Representational (or implementa-
tion) data models, 31
Requirements collection and analy-
sis phase
in database design, 200, 311–313
database design starting with, 9
of information system (IS) life
cycle, 307

Reset operations, on files, 599
Resource Description Framework
(RDF), 436
Response time, physical database
design and, 326
Restrict option, of delete operation,
77
Result equivalence, of transaction
schedules, 762
Result relations, 75
Result tables, in QBE, 1095
Retrieval operations
database design and, 728
from database tables, 494–495
on files, 599
modes of interaction in IR
systems, 999
objects, 362
QBE (Query-By-Example),
1091–1095
types of relational data model
operations, 75
Retrieval transactions, 322
Retroactive update, valid time rela-
tions and, 949
Return values, of PHP functions,
490
Reverse engineering, Rational Rose
and, 338
Revoking privileges, 844, 845–846
Rewrite blocks, file organization
and, 602
Rewrite time, as disk parameter,
1089
RIFT (rotation invariant feature
transform), 968
Rigorous two-phase locking, 785
Rivest, Ron, 865
ROLAP (relational OLAP), 1079
Role-based access control (RBAC),
851–852
Role hierarchy, in role-based access
control, 851
Role names, and recursive relation-
ships, 215
Roll-up display
functionality of data warehouses,
1078
working with data cubes,
1070–1072
ROLLBACK (or ABORT) operation,
752
Rollbacks, in database recovery,
813–815, 950
Root element, XML schema lan-
guage, 429
Root tag, XML documents, 423
Roots, of tree structures, 646
Rotation. See Pivoting (rotation)
Rotation invariant feature transform
(RIFT), 968
Rotational delay (rd)
as disk parameter, 1087
on hard disks, 591
Row-level access control, 852–853
Row-level triggers, 937
Rows. See Tuples (rows)
Rows, in SQL, 89
RSA encryption algorithm, 865
Rule consideration, in active
databases
deferred consideration, 942
overview of, 938–939
Rule-defined predicates (views),
978
Rule sets, in active database systems,
938
Rules, in deductive databases
interpretation of, 975–977
overview of, 21, 932
in Prolog/Datalog notation,
970–972
safe, 979–980
Runtime database processor
DBMS component modules, 42
query execution and, 679
Runtime, specifying SQL queries at,
458–459
Safe expressions, in tuple relational
calculus, 182–183
Safe rules, in deductive databases,
979–980
Sampling algorithm, in data mining,
1042
SANs (Storage Area Networks),
621–622
Saturation, hue, saturation, and
value (HSV), 967
SAX (Simple API for XML), 423
Scale-invariant feature transform
(SIFT), 968
Scan operations, files, 600
Scanner, for SQL, 679
Schedules (histories), of transactions
characterizing based on recover-
ability, 757–759
characterizing based on serializ-
ability, 759–760
equivalence of, 768–770
overview of, 755–757
serial, nonserial, and conflict-
serializable schedules, 761–763
Index 1163
testing conflict serializability of,
763–765
Schema
conceptual design, 313–321
entity type describing for entity
sets, 208
instances and database state and,
32–33
ontologies and, 272
relational. See Relational database
schemas
relational data model and, 70–73
three-schema architecture. See
Three-schema architecture
Schema construct, 32, 222
Schema diagram, 32
Schema evolution, 33
Schema matching, types of Web
information integration, 1023
Schema, SQL
change statements, 137–139
names, 89
overview of, 89–90
Schema (view) integration, 316–317,
319–321
Schemaless XML documents, 422
Scientific applications, 25
Scope, variable, 490
Scripting languages, PHP as, 482
SCSI (Small Computer System
Interface), 591
SDL (storage definition language),
37, 110
Search engines
overview of, 998–999
vertical and metasearch, 1018
Search fields, 648
Search trees, 647–649
Searches
conversational, 1029–1030
faceted, 1028–1029
information retrieval. See IR
(Information Retrieval)
measures of relevance, 1014–1015
methods for complex selection,
686–687
methods for simple selection,
685–686
navigational, informational, and
transactional, 996
social searches, 1029
Web. See Web search and analysis
Second normal form (2NF)
general definition of, 526–527
overview of, 523
Secondary access path, 631
1164 Index
Secondary file organization, 587
Secondary indexes
advantages of, 668
cost functions for SELECT, 714
methods for simple selection, 686
overview of, 636–642
tables comparing index types, 642
types of ordered indexes, 632–633
Secondary keys, 636
Secondary storage, 584, 711
Secret key algorithms, 863
Sectors, of hard disk, 589
Security
vs. precision, 841
Web security, 1028
Security and authorization subsys-
tem, DBMS, 19
Security, database. See Database
security
Seek time (s)
as disk parameter, 1087
on hard disks, 591
Segmentation, automatic analysis of
images, 967
SELECT command, SQL
aggregate functions used in, 125
basic form of, 97–98
FROM clause, 107
DISTINCT keyword with, 103
information retrieval with, 97
projection attributes and selec-
tion conditions, 98, 100
in SQL retrieval queries, 129–130
SELECT-FROM-WHERE structure,
of SQL queries, 98–100
SELECT operations
cost functions for, 713–715
disjunctive selection conditions,
688
on files, 599
implementing, 685
in relational algebra, 147–149
search methods for complex
selection, 686–687
search methods for simple selec-
tion, 685–686
selectivity of conditions, 687–688
SELECT operator (σ), 147
Select-project-join queries, 179
Selection cardinality, 712
Selection conditions
in domain calculus, 184
SELECT command and, 98, 100
SELECT operation and, 147
Selection, functionality of data
warehouses, 1079
Selective inheritance, in ODBs
(object databases), 368
Selectivity and cost estimates, in
query optimization
catalog information used in cost
functions, 712–713
cost components of query execu-
tion, 711–712
cost functions for JOIN, 715–718
cost functions for SELECT,
713–715
multiple relation queries and
JOIN ordering, 718–719
overview of, 710–711
Selectivity, of conditions, 687–688
Self-describing data, 10–11, 416
Semantic constraints
relational model constraints, 68
template dependencies and, 572
types of constraints, 74
Semantic data models
abstraction concepts in, 268
aggregation and association,
269–271
classification and instantiation, 268
compared with knowledge repre-
sentation, 267–268
ER (Entity-Relationship) model,
245
identification, 269
for information retrieval,
1006–1007
specialization and generalization,
269
Semantic query optimization,
722–723
Semantic relationships, in semantic
model for IR, 1006
Semantic Web, 272–273
Semantics
approach to IR, 1000
of attributes, 503–507, 514
equivalence of transaction sched-
ules and, 769–770
heterogeneity of in federated
databases, 886–887
integrity constraints and, 21
tagging images, 969
Semijoin operation, 904
Semistructured data, 416–417
Separators, XPath, 432
Sequence diagrams, UML, 329, 331
Sequential order, in accessing data
blocks, 592
Sequential patterns
in data mining, 1037
describing knowledge discovered
by data mining, 1039
discovery of, 1057
in pattern discovery phase of Web
usage analysis, 1027
Serial schedules, 761
Serializability, of transaction
schedules
characterizing schedules based
on, 759–760
serial, nonserial, and conflict-
serializable schedules, 761–763
testing conflict serializability of
schedules, 763–765
used for concurrency control,
765–768
view serializability, 768–769
Serialization (precedence) graph,
763–765
Servers
client program calling database
server, 451
database servers, 42
DBMS module for, 29
parallel architecture for, 1079
PHP variables, 490–491
server level in two-tier client/
server architecture, 47
specialized servers in client/server
architecture, 45–46
Set-at-a-time DMLs, 38
Set constructor, 359
SET DIFFERENCE operation
algorithms for, 697–698
in relational algebra, 152–155
Set null (set default) option, in
delete operations, 77–78
Set operations
algorithms for, 697–698
query processing and optimizing,
697–698
SQL, 104
Set types, in network data model, 51
Sets
equivalence of, 549
explicit sets of values in SQL, 122
SQL table as multiset of tuples, 97
tables as, 103–105
Shadow directory, 820
Shadow paging, 820–821
Shamir, Adi, 865
Shape, automatic analysis of images,
967
Shape descriptors, 965
Shared nothing architecture,
887–888

Shared subclasses (multiple inheri-
tance), 256, 297
Shared variables, embedded SQL
and, 452
Sharing data and multiuser transac-
tions, 13–14
Sharing databases, 6
Shrinking (second) phase, in two-
phase locking, 782
SIFT (scale-invariant feature
transform), 968
Simple API for XML (SAX), 423
Simple (atomic) attributes, in ER
model, 205–207
Simple Object Access Protocol
(SOAP), 436
Simultaneous update, 949
Single inheritance, subclasses and,
256–257
Single-level indexes
clustering indexes, 635–636
overview of, 632–633
primary indexes, 633–635
secondary indexes, 636–642
tables comparing index types, 642
Single-loop joins
cost functions for, 716
methods for implementing joins,
689
Single-quoted strings, PHP text
processing, 485–486
Single-relation options, for mapping
specialization or generalization,
295
Single-sided disks, 589
Single time points, in temporal
databases, 946
Single-user systems, 49
Single-user transaction processing
system, 744–745
Single-valued attributes, in ER
model, 206
Singular value decompositions
(SVD), 967
Slice and dice, functionality of data
warehouses, 1078
Small Computer System Interface
(SCSI), 591
SMART document retrieval system,
998
SMP (symmetric multiprocessor),
1079
Snowflake schema, for multidimen-
sional data models, 1073–1074
SOAP (Simple Object Access
Protocol), 436
Social searches, 1029
Software costs, choosing a DBMS,
323
Software developers, 16
Software engineers
database actors on the scene, 16
design and testing of applications,
199
Sort-merge joins
cost functions for, 717
methods for implementing joins,
689–690
Sort-merge strategy, 683
Sorting
external, 682–685
functionality of data warehouses,
1078
implementing aggregate opera-
tions, 699
ordered records (sorted files),
603–606
Space utilization, physical database
design and, 326
Spamming, Web spamming, 1028
Spanned/unspanned organization,
of records, 597
Sparse indexes, 633
Spatial analysis, 959
Spatial applications, 25
Spatial databases
applications of spatial data,
964–965
data indexing, 961–963
data mining, 963–964
data types and models, 959–960
dynamic operators, 961
operators, 960–961
overview of, 957–959
Spatial joins/overlays, 961
Spatial outliers, 965
Special purpose DBMSs, 50
Specialization/generalization
constraints on, 251–254
definitions, 264
design choices for, 263–264
EER-to-Relational mapping,
294–297
generalization, 250–251
hierarchies and lattices, 254–257
in knowledge representation, 269
notation for, 1084–1085
refining conceptual schemas,
257–258
specialization, 248–250
UML (Unified Modeling
Language), 265–266
Index 1165
Specialized servers, in client/server
architecture, 45
Specific attributes (local attributes),
of subclass, 249
Specific relationship types, sub-
classes and, 249–250
Specification, conceptualization and,
272
Speech input and output, queries
and, 39
SQL-99, 942–943
SQL/CLI (Call Level Interface)
database programming with,
464–468
library of functions, 448
SQL injection attacks
code injection, 856
function call injection, 856–857
protecting against, 858
risks associated with, 857–858
SQL manipulation, 856
types of, 855
SQL programming techniques
approaches to database program-
ming, 449–450
bibliographic references, 479
database programming tech-
niques and issues, 448–449
dynamic SQL, 448, 458–459
embedded SQL. See Embedded
SQL
function calls. See Function calls,
database programming with
impedance mismatch, 450
overview of, 447–448
sequence of interactions in, 451
SQL/PSM (SQL/Persistent Stored
Modules). See SQL/PSM (SQL/
Persistent Stored Modules)
summary and exercises, 477–478
SQL/PSM (SQL/Persistent Stored
Modules)
overview of, 473
specifying persistent stored
modules, 475–476
stored procedures and functions,
473–475
SQL (Structured Query Language).
See also Embedded SQL
* (asterisk) for retrieving all
attribute values of selected
tuples, 102–103
aliases, 101–102
bibliographic references, 114
CHECK clauses for specifying
constraints on tuples, 97
1166 Index
clauses in simple SQL queries,
107
common data types, 92–94
CREATE TABLE command, 90–92
data definition in, 89
dealing with ambiguous attribute
names, 100–101
DELETE command, 109
embedding SQL commands in
Java, 459–461
external sorting, 682–685
INSERT command, 107–109
list of features in, 110–111
manipulation by SQL injection
attacks, 856
missing or unspecified WHERE
clauses, 102
naming constraints, 96–97
object-relational features in, 354
ordering query results, 106–107
overview of, 87–89
QBE compared with, 1098
schema and catalog concepts in,
89–90
SELECT-FROM-WHERE structure
of queries, 98–100
servers, 47
specifying attribute constraints
and default values, 94–95
specifying key and referential
integrity constraints, 95–96
substring pattern matching and
arithmetic operators, 105–106
summary and exercises, 111–114
tables as sets in, 103–105
temporal data types, 945
transaction support, 770–772
translating SQL queries into rela-
tional algebra, 681–682
UDT (user-defined types) in, 111
UPDATE command, 109–110
SQL (Structured Query Language),
advanced features
aggregate functions, 124–126
ALTER command, 138–139
bibliographic references, 143
clauses in retrieval queries,
129–130
comparisons involving NULL and
three-valued logic, 116–117
correlated nested queries,
119–120
CREATE ASSERTION command,
131–132
CREATE TRIGGER command,
132–133
CREATE VIEW command,
134–135
DROP command, 138
EXISTS and NOT EXISTS func-
tions, 120–122
explicit sets and renaming of
attributes, 122
GROUP BY clause, 126–129
HAVING clause, 127–129
inline views, 137
nested queries, 117–119
outer and inner joins, 123–124
overview of, 115
schema change statements, 137
summary and exercises, 139–143
UNIQUE function, 122
view implementation and update,
135–137
views (virtual tables) in, 133–134
SQL (Structured Query Language),
ODB extensions to
dot notation for build path
expressions, 376
encapsulation of operations,
374–375
inheritance and polymorphism,
375–376
OIDs (object identifiers) using
reference types, 373–374
overview of, 369–370
specifying relationships via refer-
ence, 376
tables based on UDTs, 374
UDTs and complex structures for
objects, 370–373
SQLJ
embedding SQL command in
Java, 459–461
retrieving multiple tuples using
iterators, 461–464
SQLODE communication variable,
454
SQLSTATE communication variable,
454
Standards
database approach and, 22
database design specification, 328
SQL, 88
Star schema, 1073
Starvation, concurrency control
and, 788
State
in ODMG object model, 382
relational database state, 70–72
transaction, 751–752
State constraints, 75
Statechart diagrams, UML, 329, 333
Statement-level active rules, in
STARBURST example, 940–942
Statement-level triggers
overview of, 937
in STARBURST example, 940
Statement records, in SQL/CLI,
464–468
Static (early) binding, in ODMS,
368
Static files, 601
Static hashing, 610
Static Web pages, 420
Statistical analysis, in pattern dis-
covery phase of Web usage
analysis, 1026
Statistical approach, to IR,
1000–1002
Statistical database security, 859–860
Statistical databases, 837–838, 874
Statistical queries, 859
Steal/no-steal techniques
in database recovery, 811–812
UNDO/REDO recovery algorithm,
819
Stem, of words, 1010
Stemming, text preprocessing in
information retrieval, 1010
Stopwords
in keyword queries, 1007
removal, 1009–1010
text/document sources, 966
Storage
allocation of file blocks on disk,
598
bibliographic references, 630
buffer management and, 593–594
column-based storage of rela-
tions, 669–670
cost components of query execu-
tion, 711
covert channels, 861
database storage, 586–587
database storage reorganization,
43
database tuning and, 733
file headers (descriptors) and, 598
file systems and. See Files (of
records)
files, fixed-length records, and
variable-length records,
595–597
hardware structures of disk
devices, 588–592
iSCSI (Internet SCSI), 623–624
magnetic tape devices, 592–593

measuring capacity, 585
memory hierarchies and, 584–586
NAS (network-attached storage),
622–623
overview of, 583–584
parallelization of access. See RAID
(Redundant Array of
Inexpensive Disks)
placing file records on disk, 594
record blocking and, 597
records and record types, 594–595
SANs (Storage Area Networks),
621–622
secondary storage devices, 587
spanned/unspanned records,
597–598
summary and exercises, 624–630
Storage Area Networks (SANs),
621–622
Storage definition language (SDL),
37, 110
Storage medium, physical, 584
Stored attributes, in ER model, 206
Stored data manager module,
DBMS, 40, 42
Stored procedures, 21, 473–475
Stream-based processing, 700
Streaming XML documents, 423
Strict hierarchies, 255
Strict schedules, 759
Strict timestamp ordering, 790–791
Strict two-phase locking, 784–785
Strings
pattern matching, 105
PHP text processing, 485
Strong entity types, 219, 287
Struct (tuple) constructors, 358–359
Structural constraints, of relation-
ships, 218
Structural diagrams, UML, 329
Structured data
extracting, 1022
overview of, 416
vs. unstructured, 993–994
Structured domains, in UML class
diagrams, 227
Structured literals, 378
Subclasses
in EER model, 246–248, 264
generalizing into superclasses, 250
as leaf classes in UML, 265
options for mapping specializa-
tion or generalization, 294
predicate-defined and user-
defined, 252
shared, 256
specific attributes (local attrib-
utes) of, 249
specific relationship types and,
249–250
union types or categories,
258–260
Subset of Cartesian product, 63
Subsets, of attributes, 68–69
Substring pattern matching, in SQL,
105–106
Subtrees, 646
Subtypes, 247, 365–366
SUM function
aggregate functions in SQL,
124–125
grouping and, 166, 168
implementing aggregate opera-
tions, 698
Superclass/subclass relationships
in EER model, 264
overview of, 247
union types or categories,
258–260
Superclasses
base class and, 265
in EER model, 246–248, 264
generalization and, 250
options for mapping specializa-
tion or generalization, 294
specialization and, 248
Superkeys
defined, 518
relational model constraints, 69
Supertypes, 247, 365
Superuser accounts, 838
Supervised learning
classification and, 1051
neural networks and, 1058
Support, for association rules, 1040
Surrogate keys, 298
Survivability, challenges in database
security, 867
SVD (singular value decomposi-
tions), 967
Symmetric key algorithms, 863
Symmetric multiprocessor (SMP),
1079
Synonyms, thesaurus as collection
of, 1010
Syntactic analysis, in semantic
model for IR, 1006
System
accounts, 838
catalog, 42
definition in database application
life cycle, 308
Index 1167
recovery needed due to system
error, 750
security issues at system level, 836
System designers, 16
System environment
DBMS module, 40–42
tools, application environments,
and communication facilities,
43–44
utilities for, 42–43
System independent mapping, in
choosing a DBMS, 326
System logs. See also Logs/logging
auditing and, 839–840
database recovery and, 808
tracking transaction operations,
753–754
Systems analyst, 16
Table inheritance, in SQL, 376
Tables
ALTER TABLE command, 138–139
assigning privileges at table level,
842–843
base tables (relations) vs. virtual
relations, 90
basing on UDTs, 374
DROP TABLE command, 138
in relational model, 60, 61
retrieval queries from database
tables, 494–495
in SQL, 89
SQL table as multiset of tuples,
97, 103–105
virtual. See Views
Tags
HTML, 418–419
semistructured data and, 417
Tape jukeboxes, 586
Tape, magnetic, 592–593
Tape reel, 592
Taxonomies, 272
Technical metadata, in data ware-
housing, 1078
Templates
dependencies, 572
in Query-By-Example, 1091
Temporal aggregation, 957
Temporal databases
attribute versioning for incorpo-
rating time in OODBs,
953–954
bitemporal time relations,
950–952
options for storing tuples in tem-
poral relations, 952–953
overview of, 943–945
1168 Index
querying constructs using TSQL2
language, 954–956
time representation, calendars
and time dimensions, 945–947
time series data, 957
transaction time relations,
949–950
valid time relations, 947–949
Temporal intersection join, 952
Temporal normal form, 952
Temporal variables, 948
Temporary updates (dirty reads),
concurrency control and,
748–749
Term frequency-inverse document
frequency. See TF-IDF (term
frequency-inverse document
frequency)
Terminated state, transactions, 752
Terms (keywords)
modes of interaction in IR
systems, 999
sets of terms in Boolean model
for IR, 1002
Ternary relationships
choosing between binary and ter-
nary relationships, 228–231
constraints on, 232
in ER (Entity-Relationship)
model, 213–214
Tertiary storage, 584, 586
Testing
conflict serializability of sched-
ules, 763–765
in database application life cycle,
308
Texels (texture elements), 967
Text
preprocessing in information
retrieval, 1009–1012
sources in multimedia databases,
966
storing XML document as, 431
Texture, automatic analysis of
images, 967
TF-IDF (term frequency-inverse
document frequency)
applying to inverted indexing, 1013
in vector space model for IR,
1003–1004
Thematic analysis, for spatial data-
bases, 959
Theorem proving, in deductive
databases, 976
Thesaurus
ontologies, 272
text preprocessing in information
retrieval, 1010–1011
Third normal form (3NF)
dependency-preserving and non-
additive join decomposition
into, 558–563
dependency-preserving decompo-
sition into, 558–559
general definition of, 528
overview of, 523–525
Thomas’s write rule, 791
Threats, to database security,
836–837
Three-phase commit (3PC) proto-
col, 908
three-schema architecture
data independence and, 35–36
levels of, 34–35
overview of, 33
Three-tier architectures
client/server architecture,
892–894
PHP, 482
for Web applications, 47–49
Three-valued logic, 116–117
Time constraints, on queries and
transactions, 729
TIME data type, 945
Time dimensions, in temporal data-
bases, 945–947
Time periods, in temporal data-
bases, 946
Time representation, in temporal
databases, 945–947
Time series
management systems, 957
patterns in, 1039, 1057
as specialized database applica-
tions, 25
in temporal databases, 946, 957
Time-varying attributes, 953
Timeouts, for dealing with dead-
locks, 788
TIMESTAMP data type, SQL, 93, 945
Timestamp ordering (TO)
basic, 789–790
for concurrency control, 777
multiversion technique based on,
792
strict timestamp ordering,
790–791
Thomas’s write rule, 791
Timestamps
overview of, 789
read and write, 789
transaction time relations and, 949
Timing channels, covert, 861
TO. See Timestamp ordering (TO)
Tool developers, 17
Tools, DBMS, 43–44
Top-down methodology
for conceptual refinement, 257
for database design, 502
for schema design, 315–316
Topical relevance, in IR, 1015
Topological operators, 960
Topological relationships, among
spatial objects, 959
Topologies, network, 879
Total categories, 260
Total participation, binary relation-
ships and, 217
Total specialization constraint, 253
Tracks, on hard disks, 589
Trade-off analysis, 345
Training costs, in choosing a DBMS,
323–324
Transaction-id, 753
Transaction processing systems
ACID properties, 754–755
bibliographic references, 775
characterizing schedules based on
recoverability, 757–759
characterizing schedules based on
serializability, 759–760
commit point of transactions,
754
concurrency control, 747–750
database design and, 306
equivalence of schedules, 769–770
overview of, 743–744
recovery, 750–751
schedules (histories) of transac-
tions, 756–757
serial, nonserial, and conflict-
serializable schedules, 761–763
serializability used for concurren-
cy control, 765–768
single-user vs. multiuser, 744–745
SQL support for transactions,
770–772
summary and exercises, 772–774
system log, 753–754
testing conflict serializability of
schedules, 763–765
transaction states and operations,
751–752
transactions, database items,
read/write operations, and
DBMS buffers, 745–747
view equivalence and view serial-
izability, 768–769

Transaction processing systems, in
distributed databases
catalog management, 913
concurrency control, 909–912
operating system support, 909
overview of, 907–908
recovery, 912–913
two-phase and three-phase com-
mit protocols, 908–909
Transaction Table, in ARIES recov-
ery algorithm, 822
Transaction time, in temporal data-
bases, 946
Transaction time relations, in tem-
poral databases, 949–950
Transaction timestamp, 786
Transactional databases, distinguish-
ing data warehouses from,
1069
Transactional searches, 996
Transactions
ACID properties, 754–755
canned, 15
commit point of, 754
committed and aborted, 750
defined, 6
designing, 322–323
interactive, 801
multiuser, 13–14
recovery needed due to transac-
tion error, 750
relational data model and, 79
schedules (histories) of, 756–757
SQL transaction control com-
mands, 111
states and operations, 751–752
throughput in physical database
design, 327
types of, 745
Transfer rate (tr), disk blocks, 1088
Transformation approach, to image
database queries, 966
Transience
collections, 367
data, 586
object lifetime and, 378
objects, 355, 363
Transition constraints, 75
Transition tables, in STARBURST
example, 940
Transitive closure, of relations, 168
Transitive dependencies, in 3NF,
523–524
Transparency
autonomy as complement to, 882
in distributed databases, 879–881
Tree data models. See Hierarchical
data models
Tree structures. See also B+-trees;
B-trees
decision making in database
design, 730
FP-tree (frequent-pattern tree)
algorithm, 1043–1045
leaf-deep trees, 718
overview of, 646–647
R-trees, 962
search trees, 647–649
specialization hierarchy, 255
TV-trees (telescoping vector
trees), 967
Triggers
active rules specified by, 933
associating with database tables,
21
before, after, and instead triggers,
938
CREATE TABLE command,
132–133
CREATE TRIGGER command,
936
creating in SQL, 111
overview of, 932
row-level and statement-level,
937
specifying constraints, 74
in SQL-99, 942–943
Truth values, of atoms, 184
TSQL2 language, 954–956
Tuning databases
design, 735–736
guidelines for, 738–739
implementation and, 311
indexes, 734–735
overview of, 733–734
queries, 736–738
system implementation and
tuning, 327–328
Tuple-based constraints, 97
Tuple relational calculus
examples of queries in, 178–179
existential and universal quanti-
fiers, 177–178
expressions and formulas,
176–177
notation for query graphs,
179–180
overview of, 174–175
safe expressions, 182–183
SQL based on, 88
transforming universal and exis-
tential quantifiers, 180
Index 1169
tuple variables and range rela-
tions, 175–176
universal quantifier used in
queries, 180–182
Tuple versioning approach, to
implementing temporal data-
bases, 947–953
bitemporal time relations,
950–952
implementation considerations,
952–953
transaction time relations and,
949–950
valid time relations and,
947–949
Tuples (rows)
classification in mandatory access
control, 848
combining using JOIN operation,
157–158
comparison of values in, 118
component values of, 67
dangling tuples in relational
design, 563–565
defined, 61
disallowing spurious, 510–513
eliminating duplicates, 150
hypothesis tuples, 572
n-tuple for relations, 62
ordering in relations, 64
ordering values within, 64–65
reducing NULL values in,
509–510
reducing redundant information
in, 507–509
retrieving all attribute values of
selected, 102–103
retrieving multiple tuples in
SQLJ, 461–464
retrieving multiple tuples using
cursors, 455–457
SQL table as multiset of, 97
storing in temporal relations,
952–953
unspecified WHERE clause and,
102
valid time relations and, 948
values and NULLS in, 65–66
versioning for incorporating time
in relational databases, 953
Tuples variables
aliases and, 101
looping with iterators, 98
range relations and, 175–176
TV-trees (telescoping vector trees),
967
1170 Index
Two-phase commit (2PC) protocol
recovery in multidatabase sys-
tems, 825–826
transaction management in dis-
tributed databases, 908
Two-phase locking
basic locks, 784
binary locks, 778–780
conversion of locks, 782
overview of, 777–778
serializability guaranteed by,
782–784
shared/exclusive (read/write)
locks, 780–782
variations on two-phase locking,
784–785
Two-tier client/server architecture,
46–47
Two-way joins, 689
Type (class) hierarchies
constraints on extents corres-
ponding to, 366–367
inheritance and, 369
in OO systems, 356
simple model for inheritance,
364–366
Type-compatible relations, 697
Type constructors
atom constructor, 358
collection constructor, 359
defined, 369
ODB features included in SQL,
370
ODL and, 359–360
struct (tuple) constructor,
358–359
Type generator, 358–359
UDT (user-defined types)
creating, 370–373
in SQL, 111
tables based on, 374
UML (Unified Modeling Language)
class diagrams, 226–228
for database application design,
329
as design specification standard,
328
diagram types, 329–334
notation for ER diagrams, 224
object modeling with, 200
representing specialization/gener-
alization in, 265–266
University student database
example, 334–337
UMLS metathesaurus, 1010–1011
Unary relational operations
CARTESIAN PRODUCT opera-
tion, 155–157
overview of, 146
PROJECT operation, 149–150
SELECT operation, 147–149
UNION, INTERSECTION, and
MINUS operations, 152–155
Unbalanced trees, 646
Unconstrained write assumption,
769
UNDO/NO-REDO recovery
immediate update techniques,
818–819
overview of, 807, 809
Undo operations, transactions, 753
UNDO phase, of ARIES recovery
algorithm, 823
UNDO/REDO recovery
immediate update techniques,
819
overview of, 807, 809
UNDO, write-ahead logging and,
810–811
Unidirectional associations, in UML
class diagrams, 227
Unified Modeling Language. See
UML (Unified Modeling
Language)
UNION operation
algorithms for, 697–698
in relational algebra, 152–155
SQL set operations, 104
Union types (categories)
EER-to-Relational mapping,
297–299
modeling, 258–260
UNIQUE function, SQL, 122
Unique identity, in ODMS, 357
UNIQUE KEY clause, CREATE
TABLE command, 96
Unique keys, in relational models, 70
Uniqueness constraints
on entity attributes, 208–209
factors influencing physical data-
base design, 729
integrity constraints in databases,
21
overview of, 68–70
specifying in SQL, 95–96
Universal quantifiers
transforming, 180
in tuple relational calculus,
177–178
used in queries, 180–182
Universal relation assumption, 552
Universal relation schema, 552
Universal relations, 544
Universe of discourse (UoD), 4
University student database example
data records in, 6–9
EER schema applied to, 260–263
Unordered (heap files) records,
601–602
Unrepeatable read problem, 750
Unstructured data
HTML and, 418–420
information retrieval dealing
with, 993–994
Unsupervised learning
clustering and, 1054
neural networks and, 1058
UoD (universe of discourse), 4
Update anomalies, avoiding redun-
dant information in tuples,
507
UPDATE command, SQL
active rules and, 936
overview of, 109–110
Update operations
bitemporal databases and, 950
database design and, 728
factors influencing physical data-
base design, 729
operations on files, 599
query processing in distributed
databases, 905–907
in relational data model, 78–79
types of relational data model
operations, 75
Update transactions, 322
Usage projections, data warehousing
and, 1080
Use case diagrams, UML, 329–331
User accounts, database security
and, 839–840
User-defined subclasses, 252, 264
User-defined time, 947
User-defined types. See UDT (user-
defined types)
User-friendly interfaces, 38
User interfaces
GUIs (graphical user interfaces),
20, 39, 1061
multiple users, 20
User labels, combining with data
labels, 869–870
Users
classifying DBMSs by number of,
49

database actors on the scene,
15–16
measures of relevance in IR, 1015
multiuser transactions, 13–14
types of users in information
retrieval, 995–996
Utilities, DBMS system, 42–43
Valid event data, 957
Valid state
database states, 33
relational databases, 71
Valid time databases, 946
Valid time, in temporal databases,
946
Valid time relations, in temporal
databases, 947–949
valid XML documents, 422–425
Validation
in database application life cycle,
307–308
of queries, 679
Validation (optimistic) concurrency
control, 777, 794–795
Validation phase, of optimistic con-
currency control, 794
Value, hue, saturation, and, 967
Value references, in RDBs, 396
Value sets (domains), of attributes,
209–210
Values
stored in records, 594
in tuples, 65–66
Values (literals)
atomic formulas as, 973
atomic literals, 378
collection literals, 382
complex types for, 358–360
in OO systems, 358
structured literals, 378
Variable-length records, 595–597
Variables
bind variables (parameterized
statements), 858
communication variables in SQL,
454
domain, 183
instance, 356
iterator variables, in OQL,
399–400
limited, 980
PHP, 485–486
PHP server, 490–491
PHP variable names, 484–485
program, 599
in Prolog languages, 971
scope, 490
shared, 452
temporal, 948
tuple, 98, 101, 175–176
VDL (view definition language), 37
Vector space model, for information
retrieval, 1003–1005
Vertical fragmentation, in distrib-
uted databases, 881, 895
Vertical partitioning, database tun-
ing and, 735
Vertical propagation, of privileges,
847
Vertical search engines, 1018
Very large databases, 586
Victim selection algorithm, for
deadlock prevention, 788
Video applications, 25
Video clips, in multimedia data-
bases, 932, 965
Video segments, in multimedia
databases, 966
Video sources, in multimedia data-
bases, 966
View definition language (VDL), 37
View equivalence, of transaction
schedules, 768–769
View integration approach, in con-
ceptual schema design, 315
View materialization, 135
View serializability, of transaction
schedules, 768–769
Views
data warehouses compared with,
1079–1080
database designers creating, 15
granting/revoking privileges, 844
multiple views of data supported
in databases, 12
specifying as named queries in
OQL, 402–403
Views (virtual tables), SQL
vs. base tables, 134
CREATE VIEW command,
134–135
implementation and update,
135–137
inline views, 137
overview of, 89, 133–134
Virtual data, in views, 12
Virtual data warehouses, 1070
Virtual private databases (VPDs),
868–869
Virtual relations, specifying with
CREATE VIEW command, 90
Index 1171
Virtual tables. See Views (virtual
tables), SQL
Visible/hidden attributes, of objects,
361
Vocabularies
in inverted indexing, 1012
searching, 1013–1014
Volatile storage, 586
Voting method, distributed concur-
rency control based on, 912
VPDs (virtual private databases),
868–869
Wait-die transaction timestamp, 786
Wait-for graph, 787
WAL (write-ahead logging),
810–812
WANs (wide area networks), 879
Weak entity types, 219–220,
288–289
Web
access control policies for,
854–855
hypertext documents and, 415
interchanging data on, 24
Web analysis, 1019, 1027
Web applications, architectures for,
47–49
Web-based user interfaces, 38
Web browsers, 38
Web clients, 38
Web content analysis
agent-based approach to,
1024–1025
concept hierarchies in, 1024
database-based approach to, 1025
ontologies and, 1023–1024
overview of, 1022
segmenting Web pages and
detecting noise, 1024
structured data extraction, 1022
types of Web analysis, 1019
Web information integration,
1022–1023
Web crawlers, 1028
Web databases, programming. See
PHP
Web forms, collecting data
from/inserting record into,
493–494
Web interface, for database applica-
tions, 449
Web Ontology Language (OWL), 969
Web pages
analyzing link structure of,
1020–1021
1172 Index
content analysis, 1024
ranking, 1000
Web query interface integration,
1023
Web search and analysis
analyzing link structure of Web
pages, 1020–1021
comparing with information
retrieval, 1018–1019
HITS ranking algorithm,
1021–1022
overview of, 1018
PageRank algorithm, 1021
practical uses of Web analysis,
1027–1028
searching the Web, 1020
Web content analysis, 1022–1025
Web searches combining brows-
ing and retrieval, 1000
Web usage analysis, 1025–1027
Web security, 1028
Web servers
middle tier in three-tier architec-
ture, 48
specialized servers in client/server
architecture, 45
Web Services Description Language
(WSDL), 436
Web spamming, 1028
Web structure analysis
analyzing link structure of Web
pages, 1020–1022
types of Web analysis, 1019
Web usage analysis
pattern analysis phase of, 1027
pattern discovery phase of,
1026–1027
preprocessing phase of,
1025–1026
types of Web analysis, 1019
Well-formed XML, 422–425
WHERE clause
DELETE command, 109
explicit sets of values in, 122
missing or unspecified, 102
in SQL retrieval queries, 129–130
UPDATE command, 109–110
Wide area networks (WANs), 879
Wildcard (*)
types of queries in IR systems,
1008–1009
using with XPath, 433
WITH CHECK OPTION, view
updates and, 137
WordNet thesaurus, 1011
Wound-wait transaction timestamp,
786
Wrappers, structured data extrac-
tion and, 1022
Write-ahead logging (WAL),
810–812
Write command, hard disks and,
591
Write phase, of optimistic concur-
rency control, 794
Write-set, of transactions, 747
Write timestamp, 789
Write-write conflicts, in transaction
schedules, 757
write_item(X), 746
WSDL (Web Services Description
Language), 436
XML access control, 853–854
XML declaration, 423
XML (eXtended Markup Language)
data model, 51
interchanging data on Web using,
24
XML (Extensible Markup Language)
bibliographic references, 443
converting graphs into trees, 441
hierarchical (tree) data model,
420–422
hierarchical XML views over flat
or graph-based data, 436–440
languages, 432
languages related to, 436
overview of, 415–416
storing/extracting XML docu-
ments from databases,
431–432, 442
structured, semistructured, and
unstructured data, 416–420
summary and exercises, 442–443
well-formed and valid docu-
ments, 422–425
XML schema language, 425–430
XPath, 432–434
XQuery, 434–435
XML schema language, 425–430
example schema file, 426–428
list of concepts in, 428–429
overview of, 425
XPath, 432–434
XQuery, 434–435
XSL (Extensible Stylesheet
Language), 415, 436
XSLT (Extensible Stylesheet
Language Transformations),
415, 436