Author index

Abiteboul S. 319 Lum V. 31 Avis D. 237 Maciaszek L.A. 377, 611 Batory D.S. 427 Mannss R. 279 Beckley D.A. 407 Masunaga Y. 143, 615 Broder A. 207 Matsuo F. 539 Bryce D. 457 Matsuo M. 359 Chang C.C. 91, 113, 159, 177, Matsushita Y. 183

603 Merrett T.H. 19 Chirica L.M. 359 Moto-oka T. 293 Cook R.A. 623 Nakatsu N. 391 Czejdo B. 367 Nguyen G.T. 471 Dadam P. 31 Nievergelt J. 441 ElGindy H.A. 249 Ohzawa Y. 125 Embley D.W. 367 Olivares J. 471 Erbe R. 31 Onaga K. 125 Evens M.W. 407 Overmars M. 279 Fayerman B. 19 Pinzani R. 501 Furukawa T. 577 Pippolini F. 501 Fushimi S. 293 Pistor P. 31 Futamura S. 539 Raman V.K. 407 Ghosh S.P. 3 Ruan C. 621 Ginsburg S. 333, 345 Schek H.-J. 539 Grazzini E. 501 Schimm1er M. 309 Guenauer J. 31 Schmeck H. 309 Hanatani Y. 585 Schroder H. 309 Hinrichs K. 441 Shen J.-J. 113 Hirasawa S. 103 Shi S.G. 133, 625 Hull R. 319, 457 Shieh J.C. 177 Ikeda H. 125 Simons B. 207 Inazumi H. 103 Takagi T. 539 Kambayashi Y. 65, 577 Tan K.P. 415, 623 Katsuno H. 563 Tanaka H. 293 Kawamura K. 183 Tanaka K. 333 Kim W. 427 Tang C.-J. 345 Kitsuregawa M. 293 Tatsumi T. 183 Kojima 1. 65 Tazawa S. 225 Kostovetsky A. 481 Toussaint G.T. 249 Kriegel H.-P. 279 Ushijima K. 539 Lang H.-W. 309 Walch G. 31 Lee S. 607 Werner H. 31 Leong H.W. 415 Whang K.-Y. 489 Lian L.S. 159 Wong S.K.M. 191 Litwin W. 77 Woodfill J. 31 Liu M.C. 621 Wu C.T. 529 Luccio F. 265 Yamamoto S. 201

Yamane Y. 515

827

Yazdanian K. 51 Zezu1a P. 399 Zheng Z.M. 621 Ziarko W. 191 Zizka J. 399

628

Subject index

&-operation, 503 2-phase, 185 2d-way trie, 392 3-satisfiability problem, 209 4NF-NF2-mapping problem, 557 ACCESS, 613 ACD-1, 621 ACRIP, 611 ADD heuristic, 488, 493 AND/OR DAG model, 458 APPEND, 144 AUTOMATIC, 579 Abstract object rep, 460 Access

mechanism, 401 path, 401 privilege, 13 -key, 504

Accession list, 403 number, 228

Action, 184 -oriented scheduling, 185

Active domain, 326 Active schema, 466 Acyclic Bachman diagram, 580 Acyclic database, 623 Acyclic query, 571 Acyclicity of JDs, 584 Adbis1, 539 Advanced information management

(AIM) project, 31 Afterimage, 150 Aggregation, 8, 362, 473, 475 Alpha frame, 466 Analysis of variance, 7 Area, 378 Associative file structure, 407 Associative retrieval, 279 Atomic formula, 565 Atomic object rep, 460 Atomic type, 320 Attribute

clustering, 307 inheritance, 429 inheritance graph, 431

scheme, 346 Automatic schema navigation, 624 Avl trees, 73 Axiom, 473 Axioms of boolean algebra, 193 B+ -tree, 67, 72, 488, 505 B-operation, 504, 506 B-tree, 24, 67, 72, 77, 88 BB-operation, 504, 508 BFS2, 225 BMFS2, 225 Bachman diagram, 578 Backend controller, 530, 536 Backup, 67 Balanced K-d tree (BKD), 407, 410 Balanced file organization scheme

(BFS), 201 Balanced filing scheme, 225 Balanced multiple-valued filing

scheme, 226 Balanced multiway tree, 67 Base, 585

relation, 540 Basic version, 434 Batcher's bitonic sort, 309, 311 Bentley-Kung machine, 280 Best match query, 287, 288, 410 Bi-simulatability, 339 Bill of materials, 583 Binary (2-way) fixed order trie,

394 Binary cartesian product file,

159, 161, 162 Binary entity-relationship model

(BERM), 368 Binary tree, 68, 79, 266, 280 Biparental heap, 416 Bipartite graph, 219 Bit map, 436 Block, 488

design, 204 Blocking factor, 489, 491 Branch, 22

factor, 381 Breadth

numbering, 269

629

strategy, 269, 271 Broadcast tree (BT), 265 Broadcasting, 133, 136 Browser, 466 Bucket, 78, 113, 159, 177, 226,

391,452, 532 -oriented consecutive retrieval

(CR)organization, 113, 117 -oriented consecutive retrieval

with redundancy (CRWR) organization, 121

Bucket-query incidence matrix, 118 Buffer strategy, 488 Bus line, 133 C-expression, 557 C-group (consistency group), 153 CAD, 441 CAD/CAM database support system,

458 CALC key, 379, 578 CALC record type, 386 CDB, 613 CLUSTERED VIA record type, 386 CO-CAM, 613 CODASYL, 377, 578 COMMIT, 42 CR property, 104 CRFS, 125 Canonical query, 201 Capacity function, 196 Cartesian product,

52, 128, 321, 555 file, 116, 161

Case relationship, 362 Category attribute, 11 Cell based method, 243 Centre theorem, 244 Chang's Algorithm, 93 Chinese character, 604 Chinese Remainder Theorem, 92 Close match query, 287, 289 Closed edge, 256 Clustering, 404

property, 488, 496 Co-NP-hard, 568 Colorability problem, 179 Compact B-Tree, 86 Comparison of sorting algorithms,

312 Complacency problem, 568 Complacent assertion, 563 Complacent integrity constraint,

563 Complete hypergraph, 202 Complete version, 433 Complex domain, 550 Complex object,

41, 445, 460, 472, 479 Complex tuple, 36

manager, 34 Complexi ty, 177

630

Composite version, 434 Compression algorithm, 125 Computation scheme (CS), 335, 347 Computation tuple, 335, 346 Computation-tuple sequence,

333, 335, 346 Computation-tuple sequence scheme

(CSS) , 333, 336, 345, 348 Computational complexity, 6

of the statistics, 14 Computational geometry, 443 Concurrency control, 183, 623 Configuration, 464 Conflict-free set of MVDs, 581 Consecutive retrieval (CR)

property, 103, 116,134 file, 138 organization, 113

Consistency, 143, 183, 471, 473 control, 153

Constant table, 544 Constructive solid geometry (CSG) ,

445 Contention-free set of MVDs, 581 Contiguous assigned machine

scheduling, 219 Convex hull, 249 Cross-vertex, 321, 462 Currency indicator, 379 Cyclic JD, 583 Cyclic access storage, 104 Cyclic polytope, 246 Cyclic query, 571 Cy linder, 126 DACOMNET, 607 DATADICT, 624 DBMS-R, 621 DBS-130, 621 DBTG set, 578, 579 DEIMS-3, 619 DELTA, 619 DIMADGIO, 464 DISCONNECT, 579 DROP heuristic, 488, 491 Data

analysis, 603 dictionary, 4 directory, 4 flow computation, 289 search tree, 400 storage definition language

(DSDL), 378 stream, 294 transmission, 134 typing facility, 472

Database definition table, 543 key, 379 logic interface (LI), 474 machine, 279, 529 sample, 476

scheme, 564 state, 565 storage function, 360

Deadline, 219 Deadlock, 184

detection, 185 recovery, 185

Deduction in a DB, 54 rule, 51, 55

Deductive capabilities, 51 Deferred update, 42 Delete query, 12 Denormalization, 558 Depth

indicator, 270 numbering, 269, 270 of partition tree, 517 strategy, 270, 271, 272

Derivation method, 54, 55 Derived database scheme, 368 Derived object rep, 460 Description-related domain, 550 Design

alternative, 429 information, 463

Designer interface (DI), 474 Differential equation, 604 Differential file, 434 Direct access, 66 Directory structures, 68, 70 Discriminator

attribute, 301, 303 value, 301, 303

Disjointness relationship, 362 Disk

Modulo (OM) allocation method, 116, 163

utilization" factor, 66 Distributed database system,

143, 133 Distributed relational database,

143 Divide and conquer, 516 Document, 20, 191 Domain, 52, 128

management table, 544 -range constraint, 359, 362

Double-Y layout, 267 Dummy replica, 143, 146, 150 Duplication of records, 105 Dynamic PATRICIA, 19 Dynamic constraint, 475 Dynamic file organization, 67 Dynamic hash file, 532 Dynamic hash-based file

organization, 65 Dynamic hashing, 68

scheme, 68, 73, 612 Dynamic programming, 383 EDC, 619

ER algebra, 367 ER algebraic query language, 371 Edge visible polygon, 249 Edge visible region, 251 Educational database system, 611 Engineering

data management, 457 support environment (ESE), 458

Entity set descriptor, 368 Entity-relationship

algebra, 370 approach, 472 model, 359, 367, 467

Entropy, 107 Equation sum, 8 Equi-join, 12, 517 Ether-type bus connection, 135 Euler's Theorem, 92 Evaluation

attribute, 335, 346 function, 335, 347

Evaluation order graph, 576 Event, 481

model, 467 Exact TRACER file, 129 Exact match query, 287, 409, 531 Existence

constraint, 578 dependency, 362

Extended binary entity-relationship model (EBERM), 368

Extension parameter, 446 Extensional data, 540 External hash join, 515. 522 External partition scheme, 523 External relation, 56 FD, 571

-complacent integrity constraint, 563

-function, 572 FERM schema, 359 FIFO queue, 310 FIXED, 579 FOPES, 399, 400 Face, 444 Feasible placement, 211 File

allocation, 192 allocation problem, 177, 179 organization, 399 organization model, 401 organization scheme, 128 transmission schedule,

133, 134, 137, 139 First order logic, 51, 473 First-order query, 227 Flat file, 410 Floppy disk, 127 Flow network, 195 Folding allocation method, 167 Fragment, 145, 321

631

representation, 460, 462 string index, 33, 39

Frequency decomposition, 480, 481 separation approach, 480 separation technique, 479 spectrum, 481

Functional data model, 322, 359 Functional dependency,(FD)

5, 146, 474, 578 with nulls (NFD) , 582

Functional entity relationship model (FERM), 359

Functional relationship, 319, 321, 462

GRACE, 294 GUIDE, 467 General rules, 51, 56 Generalization, 322, 462, 472, 475 Generalized HUBFS2 (GHUBFS2), 226 Generalized KD-tree (GKD-tree), 302 Generalized wff, 572 Generalized CRFS, 126 Generation method, 54, 55 Geometric computation, 442 Geometric join query, 451 Geometric modeling, 445 Geometric object, 441 Geometric query, 445 Geometrical database, 238 Global constraint, 580 Global query, 133 Gradated statistics, 307 Granularity, 183

of statistics metadata, 10 Graphical query

language, 372 processing, 367

Graphics data frame, 466 schema frame, 466 -based user interface, 457

Gray code, 243 Grid

file, 441 file system, 453 structure, 415

Ground clause, 541 H layout, 267 HEU method, 165 HEU1 allocation method, 165 HEU2 allocation method, 165 HQL(Hangul Query Language), 608 HUBFS2, 226 HUBFSk, 201 HUBMFS2, 226 Half

-TOT tree, 273 -space query problem, 237

Ham sandwich theorem, 244 Hangul data management, 608

632

Hardware sortor, 307 Has-version relationship, 464 Hash, 294

function, 392, 69 jOin, 515

Hashing, 91 function, 92

Heap property, 416 Heapsort, 415 Hiroshima university

balanced filing scheme, 226 balanced multiple-valued filing

scheme, 226 Historical MAC DAG, 464 Historical database, 608 Historical information, 458 History

data, 32, 34 index, 39 management, 37, 45 query, 39

Horizontal clustering, 307 Horizontal table partitioning, 144 Horn

set, 539, 540 -clause, 473

Hyperclaw decomposability, 202 decomposition, 201

Hypergraph, 136, 202, 578 Hyperrectangle, 237, 297 I-expression, 557 IFO

graph, 323 instance, 320 model, 319, 320 schema, 320, 324

IFS1, 226 INGRES, 608 INQ, 619 IPAD, 458, 467 IPSJ, 615 IQBE, 612 IRA, 612 ISA relationship,

319, 322, 362, 460 ISA rule, 324 Impact matrix, 481 Implementation, 428 Incomplete verSion, 433 Index, 279, 379

blocking factor, 491 maintenance cost: 488 manager, 33 selection, 487, 491 storage cost, 488

Indexed tuple variable, 565 Inferential relational database

system, 539 Information lossless decomposition,

146

Information retrieval (IR), 191 model, 192

Initialization, 336, 348 Input attribute, 335, 346 Insert query, 12 Insertion class, 579 Instantiation, 430, 465, 564. 569

information, 463 tree, 465

Integer linear programming, 383 programming, 137

Integrity constraint, 563 rule, 51

Intensional data, 541 Interchange, 418 Interface, 428 Internal hash join, 515 Internal partition scheme, 523 Interpolation hashing scheme, 532 Intersection query, 448 Interval, 339, 350

intersection query, 450 Inverted file tree machine (IFTM),

282, 279 Inverted filing scheme, 226 Inverted list,

410, 114, 160, 178, 407 Japanese character, 620 Job removal scheduling, 222 Join

attribute, 531 decomposition, 585 dependency (JD),

146, 578. 585, 623. 624 field, 516 representable, 585 selectivity factor, 508

K-dimensiona1 record, 280 K-hyperclaw, 202 K-local CS, 337 K-local constraint, 337 KD-tree(k-d tree), 239, 293, 301 KISS, 607 Key

collision problem, 91 search, 78 -breaking anomaly, 581

Knowledge-base (KB), 473 management system(KBMS), 497, 608

LS3 sort, 312 Latency time, 127 Lattice page partitioning, 298 Left upper triangle grid, 416, 419 Letter oriented key, 94 Line segment, 249 Linear regression analysis, 4, 5 Linear tree method, 146 Link-query, 11 Litteral, 53

Load factor, 77, 82, 83, 84, 88 Loading time, 127 Local ess, 338, 356 Local area network, 133 Local bi-simulatability, 340 Local propagation, 327 Local representability, 356 Locality of data, 66 Location parameter, 446 Locking, 13

performance, 623 Logical database design tool, 633 Logical expression, 53 Logical operator, 53 Logical page, 295 Logical record, 378 Loss of search time, 107 M-ary (digital) tree, 78 M-cycle hash file, 529, 530 MAC (MAnager of Configurations),

461, 463 MANDATORY, 579 MANUAL, 579 MDBMS, 612 MOBS, 538 MIMO, 538 MITI, 617 Magnetic disk storage system, 104 Main memory

based file, 66 environment, 65

Mandatory relationship, 362 Matching, 219 Materialization, 377 Materialized join, 559 Max-min matching algorithm, 220 Maximal key, 79 Maximum cardinality matching, 219 Maximum weighted matching, 219 Measure of unbalance, 396 Member record, "578 Membership-W-independence, 352 Memory

Overflow, 70 initialization time, 66 utilization factor, 66, 70

Merge scan method, 515 -split operation, 310

Meta data, 3, 149 Meta-knowledge base (MKB) , 473 Meta-rule, 474 Method

of atomic component, 194 of least square, 5

Middle key, 80 Minimal perfect hashing

function, 92, 603 scheme, 95

Minimum cut, 196 Mixed-type

633

bucket, 227 claw bucket, 227

Modified IFTM (mIFTM), 285 Modula-2, 453 Monotone edge visible region, 251 Morecular object, 429 Morrison's practical algorithm to

retrieve information coded in alphanumeric (PATRICIA),

19 Morrison's algorithm, 25 Multi-attribute file system,

113, 159, 177 Multi-disk system, 115, 179 Multi-key retrieval, 279, 282 Multi-media

object, 472 DBMS, 619

Multidimensional clustering, 293, 294

Multidimensional search problem, 237

Multilevel storage, 192 Multilist structure, 228 Multipaging, 240 Multiple query processing, 133 Multiple correlation coeffiCient, 7 Multiple disk system, 159 Multiple key retrieval, 407 Multiple regression coefficient, 6 Multiple relationship, 582 Multiple-file database, 496 Multivalued dependency (MVD) ,

146, 474, 578, 585, 623 Multivalued dependency with nulls

(NMVD), 581 Multivariate analysis, 4, 6 Multiway trees, 66 ND-disk system, 116 NEW-SYSTABLE, 149 NF2

algebra processor, 549 relation, 550 relational algebra, 549, 552 relational model, 36

NHI (Natural Hangul Interface), 608 NP, 137 NP-complete,

134, 140, 208, 454, 487 NP-hard, 179 Natural join, 146 Navigation, 583 Near neighbor

query, 289 search, 294

Nearest neighbor query, 410 Negation as failure, 545 Negative clause, 541 Nest, 553 Nested consistency control

mechanism, 143, 155

634

Nested prOjection, 554 Nested scan method, 515 Nested selection, 555 Nesting of functions, 322 Network

database model, 577 flow model, 192, 196

Next element subdiviSion, 249 Non-first-normal-form (NF2) , 549 Non-normalized relational algebras,

33 Non-normalized relations, 32 Non-redundant

deletion, 283 insertion, 283

Non-uniform query, 397 Normal equations, 6 Null value, 578, 581 OPTIONAL, 579 OTN sort, 312 Object, 319, 581

equivalence class, 476 frame, 480 history, 333, 345 oriented database, 479 representation, 460 type, 429 type data, 430 update frequency, 482 version data, 430 -oriented semantic database

model, 458 Observation, 4 Odd-even-transposition sort, 312 Off-the-disk processing, 538 Open edge, 256

deletion, 256 Optimal allocation method, 159 Optimal partition number, 519 Optimal trie, 392 Orthant, 239 Orthogonal range query problem, 237 Outer join, 558 Overflow chaining, 68 Overlappig, 404 Owner record, 578 P-ary partition scheme, 524 P-C-skeleton, 155 P-group (partitioning group), 153 PARTIAL SCAN, 379 PATRICIA, 19, 21, 23

book, 27 PICK operating system, 613 PL/1 regional(l) direct access, 408 Pack, 272 Page, 378

merging, 72 splitting, 70, 72

Parallel comparison-exchange operation, 311

Parallel execution of relational

operations, 529 Parallel sequential access, 535 Parameterized version, 433 Parent table, 145 Parser, 40 Part-subpart hierarchy, 461 Partial correlation coefficient, 7 Partial directory, 403 Partial match query, 113, 159,

177, 287, 288, 298, 391, 409, 531

Partial orders, 134, 139 Partial randomness, 81 Partial range query, 287 Partition

buffer, 523 number, 516 set, 503 tree 517

Perfect hashing function, 91 Perfect nested expression, 564 Performance

evaluation, 305 of statistics metadata, 14 prediction, 399 related characteristics, 401

Permissible update, 327 Physical allocation structure, 378 Physical database

design optimizer, 496 organization, 293

Physical lock, 183 Physical locking scheme, 183 Physical page, 295 Physical storage structure, 378 Pipelining, 284, 294 Plug and socket diagram, 433 Point

query, 448 set query, 448 -in-interval query, 448

Polish notation, 542 Polygon, 249

tree, 243 Polygonal query, 238 Polyhedra, 444 Polyhedral range query, 237 Polyhedron, 444

tree, 243 Positive clause, 541 Predicate

locking, 184 symbol, 53

Prenex normal form, 566 Primary object, 461

rep, 462 Primary vertex, 324 Prime number, 93 Prime relation, 58 Procedure definition table, 543 Projection, 146, 345

-selection combination, 554 Prolog, 474, 539

machine, 612 Prototype, 476 Pruned trie, 392, 397 Pseudo TRACER file, 129 Pseudo-quad tree, 239 QUEL decomposition algorithm, 502 QUICKPICK, 613 Quad tree, 239 Quantified query, 564 Query

class, 400 distribution function, 295 processor, 40 tree evaluator, 40, 41 tree optimizer, 40, 41

Question-answering systems, 108, 110

Quick sort, 521 R-re1axed CR (RCR) property,

104, 105 _ RDB/DV, 619 RDB/Vl, 515, 619 REBUILD, 147 RECONNECT, 579 RTDB, 621 Random variable, 4 Range

query, 79, 80, 287, 288, 294, 297, 531

search query, 409 -select query, 11

Rank, 335, 347 Rate-distortion

function, 106 theory, 104, 106

Realm, 378 Record

array, 285 type, 378, 578 usage statistics, 377 -based model, 466 -query incidence matrix, 117 -to-area mapping, 377, 382

Rectangle, 207 Recursive partitioning, 515 Recursive unsolvability, 358 Redo, 41 Reduction, 208 Redundancy of a filing scheme, 227 Refutation procedure, 539 Region, 208

query, 441 Register structure, 268 Regression coefficient, 4, 7 Regular set table, 543 Regularity, 487 Relation, 128

cardinality, 491 management table, 543

635

scheme, 564 -valued attribute, 551

Relational database machine, 293 Relational operation, 272 Relational representation of text,

20, 24 Relationship

function, 360 set descriptor, 368

Relative design importance (RDI), 379

Relative design rank, 382 Relaxed CR (HCR) property, 104, 105 Release time, 219 Reorganization, 69 Repeating group, 36 Replace query, 13 Replica, 146 Replication tree, 148 Representable object rep, 460 Response set, 400 Restriction column, 489 Result buffer, 536 Retention class, 579 Retundant table, 272 Ribble sort, 312 Rollback, 41 SCAN, 379 SEQUENTIAL record type, 386 SKI, 467 SNAP, 468 SQL, 144 SYSCATALOG, 149 SYSTABLE, 149 Satisfiability, 209 Scheduling

system, 183 theory, 208, 219

Search strategy, 401 Searching algorithm, 19 Second-order query, 227 Sector, 126 Security, 13. 125 Seek time, 127 Segment, 530 Selection, 531 Selectivity, 489. 491 Semantic comlacency, 567 Semantic constraint, 577. 624 Semantic control, 478 Semantic database modelling, 319 Semantic integrity, 471 Semantic link, 479 Semantic modeling, 359 Semantic validation sub-system, 471 Semantically FD-complacent

integrity constraint, 571 Semi-join, 564 Semiconductor memory, 307

chips, 66 Separability, 382, 400, 496

636

Sequential access, 66 Serializability, 136 Set membership, 579 Settling time, 127 Shannon's source coding theorem,

107 Shared access-key, 504 Shared index, 505 Sharing degree, 504 Shift memory, 310 Single primary update strategy, 153 Single relation database, 128 Singular set, 384 Sink, 196 Site, 134 Socket, 432 Software backend, 538 Song's space allocation scheme, 283 Sort, 294 Sorting, 309, 628

algorithm, 415 algorithms for VLSI, 310 chip, 309, 310

Source, 196 Space partitioning, 237, 239 Specialization, 322, 462, 472. 475 Sphinx, 608 Spli t key, 80 Splitting using the middle key, 83 Square

grid structure, 416 processor, 282

Stabbing pair, 256 State

attribute, 335, 346 function, 335, 347

Statistical data, 4 Statistical database, 125

management system (SDBMS), 3 Statistical dependency, 5 Statistical query, 131 Statistics

metadata, 4, 7 metadata locking, 13 -link-query, 12

Steiner point, 251 Storage

allocation, 192 bucket, 401 chip, 310 record, 378 structure, 502 system, 404 utilization factor, 65. 532

Store site, 150 Strictly optimal allocation method,

166 Strongly dependent object, 477 Structural constraint, 578. 579 Structural model, 497 Structured object, 320

Structured variable hashing scheme, 74

Structured variable length hashing scheme, 68

Student-Newman-Keuls test, 412 Subrelation, 516 Subschema, 384

-driven relative design importance, 385

Subtuple manager, 34 Supersequence problem,

134, 139, 140 Surrogate key, 367 Syntactically complacent integrity

constraint, 567 System R*, 144 System catalog, 143

structure, 149 TELETEX, 607 TIGRE, 472 TODAY, 613 TORNADO, 458, 466 TWS(transaction's workspace), 41 Table partition, 143 Table partitioning

and replication tree, 148 rule, 146

Table replication, 143, 146 rule, 146

Table system wide name (SWN), 145 Tautology, 568 Template, 432 Temporal database, 608 Temporal information, 32 Term, 565 Terminal tree (TT), 266 Text, 20

database, 19 Textual data, 39 Textual retrieval, 32 Third normal form, 624 Tile, 207, 208 Time version, 583 Time-stamping, 42 Topology

of a storage device, 125 of storage devices, 126

Tracer, 125 Transaction, 183, 489

model, 489 -oriented scheduling, 185

Transitive anomaly, 581 Transparence, 154 Transposed file, 125, 402

organization scheme, 128 organization scheme with

consecutive retrieval property, 125

Transposing of relation, 307 Traversal, 80 Tree

machine, 280 of trees (TOT) structure, 266

Triangulation, 249 Trie, 21, 68, 77, 78, 82, 391

hashing, 77 index file, 392 -index, 22

Tsuno, 539 -kakushi, 541

Tuple calculus, 565 clustering, 307 distribution function, 295 identifier (TID),

35, 146, 488, 502 name, 42

Twin index, 23 Two level memory, 191 Type, 320

-version generalization, 429 U-operation, 504, 506 UB-operation, 504, 507 UNION, 144 UU-operation, 504, 506 Unbalanced K-d tree (UKD), 407, 410 Undo, 37, 41 Unifiable, 53 Unification, 56 Uniform

constraint, 336, 347 distribution assumption, 516 partial match query distribution,

298 query, 395 range query, 300

Uniformity of data, 392 Unit processor, 530 Universal operation, 502, 503 Universal relation, 557 Unnest, 553 Unsuccessful search, 394 Update

operation, 359 propagation, 319, 326 graph, 329 semantics, 325 synchronization, 156

VIA mode, 578 VIDEOTEX, 607 VLSI, 207, 279, 309, 458

CAD object, 427 placement problem, 207 tree, 265

VSEQ(T), 337, 348 Value assignment, 565 Version, 427, 429

control, 427, 463 -derivation hierarchy, 435

Vertical clustering, 307 Vertical table partitioning, 145 View constraint, 580

637

Walk manager, 40, 41 Wall clock time, 408 Weakly internally visible region,

256 Weakly related object, 477 Well-formed formula (wff) , 565 XRDI, 385

638