HOME > 상세정보

상세정보

Principles of database query processing for advanced applications

Principles of database query processing for advanced applications (2회 대출)

자료유형
단행본
개인저자
Yu, C. T. (Clement T.) Meng, Weiyi.
서명 / 저자사항
Principles of database query processing for advanced applications / Clement T. Yu, Weiyi Meng.
발행사항
San Francisco, Calif. :   Morgan Kaufmann ,   c1998.  
형태사항
xvi, 485 p. : ill. ; 25 cm.
ISBN
1558604340
서지주기
Includes bibliographical references (p. 429-458) and index.
일반주제명
Database management. Querying (Computer science)
000 00895camuu2200265 a 4500
001 000045288437
005 20060825111341
008 970829s1998 caua b 001 0 eng
010 ▼a 97038044
020 ▼a 1558604340
035 ▼a (KERIS)REF000004103804
040 ▼a DLC ▼c DLC ▼d DLC ▼d 211009
050 0 0 ▼a QA76.9.D3 ▼b Y82 1998
082 0 0 ▼a 005.74/1 ▼2 21
090 ▼a 005.741 ▼b Y94p
100 1 ▼a Yu, C. T. ▼q (Clement T.)
245 1 0 ▼a Principles of database query processing for advanced applications / ▼c Clement T. Yu, Weiyi Meng.
260 ▼a San Francisco, Calif. : ▼b Morgan Kaufmann , ▼c c1998.
300 ▼a xvi, 485 p. : ▼b ill. ; ▼c 25 cm.
504 ▼a Includes bibliographical references (p. 429-458) and index.
650 0 ▼a Database management.
650 0 ▼a Querying (Computer science)
700 1 ▼a Meng, Weiyi.
945 ▼a KINS

소장정보

No. 소장처 청구기호 등록번호 도서상태 반납예정일 예약 서비스
No. 1 소장처 과학도서관/Sci-Info(2층서고)/ 청구기호 005.741 Y94p 등록번호 121131343 도서상태 대출가능 반납예정일 예약 서비스 B M

컨텐츠정보

목차


CONTENTS

Preface = xiii

1 Introduction to Relational Query Processing = 1

 1.1 The Relational Data Model = 2

  1.1.1 Data Model = 2

  1.1.2 Relational Algebra = 4

  1.1.3 SQL = 6

 1.2 An Overview of Query Processing and Optimization = 7

 1.3 Fast Access Paths = 9

  1.3.1 Storage Hierarchy = 9

  1.3.2 B^+ Tree = 11

  1.3.3 Hashing = 15

 1.4 Single Operation Processing = 16

  1.4.1 Evaluating Selection = 18

  1.4.2 Evaluating Projection = 19

  1.4.3 Evaluating Join = 20

 1.5 Determining the Execution Order of Operations = 26

  1.5.1 Transformatin Rules = 26

  1.5.2 Algebra-Based Optimization = 27

  1.53 Cost Estimation-Based Optimization = 30

 Exercises = 33

 Bibliographic Notes = 36

2 Query Processing in Object-Oriented Database Systems = 37

 2.1 Object-Oriented Data Model = 38

 2.2 OQL : An Ibject-Oriented Query Language = 42

  2.2.1 Path Expressions = 44

  2.2.2 Set Attributes and Quantifiers = 44

  2.2.3 Reference Variables = 45

  2.2.4 Part a Class Hierarchy = 46

  2.2.5 Reference Methods = 46

  2.2.6 Structured Output = 46

 2.3 OODB Query Processig and Optimization = 47

  2.3.1 Object Algebra and Algebraic Transformation = 49

  2.3.2 Path Expression and Algebraic Transformation = 55

  2.3.3 Method Materialization = 66

 2.4 Indexes in OODB Systems = 69

  2.4.1 Class Hierarchy Index = 69

  2.4.2 H-Tree Index = 72

  2.4.3 Indexes along Path Expressions = 74

 Exercises = 77

 Bibliographic Notes = 79

3 Query Processing in Distributed Relational Database Systems = 81

 3.1 Distributed Database Concepts = 82

  3.1.1 Computer Networks = 82

  3.1.2 Distributed Database Design = 84

  3.1.3 Issues in Query Optimization = 85

 3.2 Distributed Processing of Joins = 86

  3.2.1 Utilizing Placement Dependency Information = 86

  3.2.2 Fragment and Replicate Algorithm = 89

  3.2.3 Combining Placement Dependencies and Data Replication = 92

  3.2.4 Hash Partitioning Altorithm = 93

  3.2.5 A Comparison of Different Methods = 95

 3.3 Processing Chain Queries = 96

 3.4 Semi-Join = 99

  3.4.1 Eliminate All Unnecessary Data for Query Using Semi-Joins = 101

  3.4.2 Estimatioin of Cost = 106

 3.5 Combining Semi-Joins with Joins = 111

 Exercises = 112

 Bibliographic Notes = 116

4 Query Processing in Multidatabase Systems = 117

 4.1 Multidatabase System Architecture = 119

 4.2 Schema Integration Operators and Data Inconsistencies = 122

  4.2.1 Integration Operators = 124

  4.2.2 Data Inconsistency and Resolution Function = 126

 4.3 Global Query Optimization = 130

  4.3.1 Query Modification and Decomposition = 132

  4.3.2 Single-Query Approach = 137

  4.3.3 Materialization Approach = 146

  4.3.4 Estimating Local Cost Formulas Using Query Sampling = 157

 4.4 Query Translation = 159

  4.4.1 Translation of Relational Queries to OODB Queries = 161

  4.4.2 Translation of OODB Queries to Relational Queries = 171

 Exercises = 180

 Bibliographic Notes = 183

5 Parallel Processing of Relational Queries = 185

 5.1 Basic Concepts of Parallel Processing = 186

  5.1.1 Multiprocessor Architectures = 186

  5.1.2 Parallelism for Database Queries = 188

 5.2 Data Partitioning Techniques = 189

  5.2.1 Round-Robin Partitioning = 190

  5.2.2 Range Partitioning = 191

  5.2.3 Hash Partitioning = 192

  5.2.4 Other Issues Related to Data Partitioning = 193

 5.3 Parallel Sorting Algorithms = 195

  5.3.1 Parallel Binary Merge Sort = 196

  5.3.2 Block Bitonic Sort = 197

  5.3.3 NOW Sort = 198

 5.4 Parallel Processing of Selections and Projections = 201

 5.5 Parallel Processing of Joins = 202

  5.5.1 Nested Loop Joins = 202

  5.5.2 Sort Merge Join = 204

  5.5.3 Simple Hash Join = 207

  5.5.4 GRACE Hash Join = 208

  5.5.5 Hybrid Hash Join = 210

  5.5.6 Comparison of the Join Algorithms = 210

 5.6 Parallel Query Optimization = 212

  5.6.1 Hashing-Based Pipelined Parallelism for Right Deep Trees = 214

  5.6.2 Processor Allocation for Multiway Join Queries = 218

 Exercises = 222

 Bibliographic Notes = 224

6 Processing Fuzzy Relational Queries = 227

 6.1 Fuzzy Set and Fuzzy Term = 228

 6.2 Satisfaction of a Tuple with Respect to a Query = 230

  6.2.1 Comparison of Two Attribute Values = 230

  6.2.2 Handling Where-Clauses = 231

  6.2.3 Hanling Select-Clauses = 232

 6.3 Transformation of Nested SQL Queries to Unnested SQL Queries = 233

 6.4 Unnesting of Fuzzy Queries = 237

 6.5 Context-Dependent Interpretations of Fuzzy Terms = 240

 Exercises = 242

 Bibliographic Notes = 243

7 Query Processing in Deductive Database Systems = 245

 7.1 Basic Concepts = 245

 7.2 Computing Derived Relations = 249

  7.2.1 Computation of Nonrecursive Predicates = 249

  7.2.2 Test for Recursions in Rules = 250

  7.2.3 Computation of Recursive Predicates = 251

  7.2.4 Transitive Closure = 262

 Exercises = 263

 Bibliographic Notes = 265

8 Multidimensional Search Structures = 267

 8.1 G-Tre = 268

  8.1.1 G-Tree Data Structure = 268

  8.1.2 G-Tree Operations = 270

 8.2 Quadtree = 276

  8.2.1 Point Quadtree Strictire = 276

  8.2.2 Point Quadtree Operations = 277

  8.2.3 Region Quadtree Structure = 280

  8.2.4 Region Quadtree Operations = 281

 8.3 $$R^*$$-Tree = 283

  8.3.1 $$R^*$$-Tree Structure = 284

  8.3.2 $$R^*$$-Tree Operations = 285

 Exercises = 292

 Bibliographic Notes = 294

9 Text Retrieval = 295

 9.1 An Overview of Text Retrieval and Classification = 296

  9.1.1 Representation of a Text Document = 296

  9.1.2 Term Significance = 297

  9.1.3 Query Representation = 298

  9.1.4 Retrieval = 299

  9.1.5 Quality of Terms = 300

  9.1.6 Performance Evaluation = 303

  9.1.7 Relevance Feedback = 304

  9.1.8 Clustering = 306

  9.1.9 Searching = 306

 9.2 Retrieval Effectiveness = 310

  9.2.1 Optimal Retrieval of Documents = 310

  9.2.2 Independence Model = 312

  9.2.3 Tree Dependence Model = 315

  9.2.4 Generalized Dependence Model = 320

  9.2.5 Transforming a Set of Dependent Terms into a Set of "Independent" Terms = 323

 9.3 Relevance Feedback = 329

  9.3.1 Applying Relevance Information to the Same Query = 330

  9.3.2 Permanent Learning = 336

  9.3.3 Feedback without User's Information = 337

 9.4 Specialized Hardware = 338

  9.4.1 Connection Machine = 339

  9.4.2 Associative Memory = 341

  9.4.3 Finite State Automata = 344

 9.5 Other Retrieval Methods = 347

  9.5.1 Inference Network = 347

  9.5.2 Parsimonious Covering Theory = 349

 Exercises = 354

 Bibliographic Notes = 356

10 Text Clustering and Clustered Search = 359

 10.1 Text Clustering = 360

  10.1.1 Graph-Theoretical Methods = 360

  10.1.2 Single-Pass Method = 364

  10.1.3 On-Line Learning Clustering Methods = 369

  10.1.4 Reduction of Time by Sampling = 375

  10.1.5 Determination of the Number of Clusters and Their Representatives = 376

 10.2 Clustered Search = 377

  10.2.1 Terms Are Binary and Independent in the Document of Each Cluster = 377

  10.2.2 Terms Are Binary and Arbitrarily Dependent in the Document of Each Cluster = 379

  10.2.3 Terms Are Nonbinary and Independent = 381

  10.2.4 Terms Are Nonbinary and Arbitrarily Dependent = 382

 Exercises = 383

 Bibliographic Notes = 384

11 Image and Video Retrieval = 387

 11.1 Picture Retrieval = 389

  11.1.1 Picture Representation = 389

  11.1.2 Picture Retrieval = 397

  11.1.3 Deduction and Reduction of Spatial Relationships = 405

  11.1.4 Indexes for Similarity Computation = 410

  11.1.5 An Application = 411

 11.2 Video Retrieval = 414

  11.2.1 Introduction = 414

  11.2.2 A Language for Video Retrieval = 416

  11.2.3 Processing Video Queries = 419

 Exercises = 425

 Bibliographic Notes = 426

References = 429

Index = 459



관련분야 신착자료