Subject Index

A Adapter, 696–699, 1978, AND-Join, 2006, 2752, 3544 Abstraction, 6–7 Additive noise, 1911 AND-split, 2752 Abstract types, 1554 Adaptive query processing, 50–52 Animation, 950 Acceptance-rejection sampling, 2467 Adaptive stream processing, 52–56, 1636 ANN architecture, 1906 Access control, 2447–2452 Adaptive user interfaces, 46–47 Annotated data, 85 – mechanism, 7–10 Additionally marked information, 85 Annotation, 85, 1580, 3072, 3076, 3078 – policy, 11 Ad-hoc workflows, 3548 Annotation-based image retrieval, 85–88 Access control lists (ACLs), 3573 Administration model for RBAC, 57 Anomaly detection, 1569 Access latency, 72, 73, 76 Administration policies, 12–14 – on streams, 88–90 Access methods, 1448, 1449, 2224, 2681 Administration wizards, 58 Anonymity, 90–91, 2138, 2142–2146 Access path, 19 Administrative RBAC family of models, 57 Anonymity set, 91 Access rights, 864, 865 Administrative workflows, 3548 Anonymizer, 2686–2688, 2690 Accuracy, 2229 ADO.NET, 449 ANOVA (analysis of variance), 238 ACID properties, 926–927, 1644, Advanced transaction models, 1091–1092 ANSI/ICITS RBAC standard, 2448 1896–1898, 1978, 1980, 2761, 2762, 3559 Aesthetic principle, 430 ANSI RBAC, 91–92 – atomicity, 19–20 Affinity matrix, 2749, 2751 ANSI standard, 2755, 2756, 2760 – durability, 20–21 Affix removal, 2790, 2793 Answering queries using views, – isolation, 20 Agent, 46 92–97, 3324 – transaction, 3150 Agglomerative clustering, 933 Anti-monotone Acronym for redundant arrays of Aggregate-storing indices, 1456–1457 – constraints, 98 independent disks, 2823 Aggregate queries, 59–62 Appearance-based object model, 1937 ACTA, 1091–1092 – peer-to-peer, 111–113 Application level protocol standard, 2666 Action, 959 Aggregation, 59–70, 1028, 1029 Application-level tuning, 105–106 Active-active mode, 1843 – distance, 1890 Application(s), 107–110 Active and real-time data warehousing, 21–26 – group, 2924–2926 – benchmark, 99 Active conceptual modeling, 2228 – function, 2924–2926, 2928 – including secure databases, 2531 Active database, 28–33 – operators over time windows, 2996 – multimedia, 1323–1326 – coupling modes, 33–35 – views, 1421, 1423 – persistence, 100, 101, 103 – execution model, 35–36 Air index, 71–77 – programming interfaces – knowledge model, 36 Air indexes for spatial databases, 71–77 (APIs), 1557 – management system architecture, 28–33 Algebra, 258, 259, 2360–2363 – recovery, 100–103 – rulebase, 37 Algebraic and logical models, 1524, 1527 – server, 104, 1578, 1579 Active database (management) system Algebras for tuple timestamping, 2930–2931 Applying supervised learning to web (aDBS/aDBMS), 28–33 Algorithms, 378, 380–382 wrapper generation, 3561 – active database (aDB), 27 Alignment with business strategy, 1516 Approximate itemset, 120–123 – database transitions, 27 All-distances sketches, 759, 760 Approximate mining, 137, 138 – external signals, 27 Allen’s algebra, 2225–2227 Approximate queries(ing), 1764–1768 – periodically polling the database, 27 Allen’s relations, 78–79 – peer-to-peer, 111–113 – time events, 27 Alternative composition, 420 Approximate query answer, 884, 889 Active Data Warehousing, 21–26 Amercia II Project (MOA2), 1636 Approximate query processing, 113–119 Active disk, 37–38 AMOSQL, 79–80 Approximate reasoning, 119–120 Active learning, 3563 AMQP, 2210 e-Approximation, 1240, 1241, 1244 Active replicas, 1111–1114 AMS sketch, 80–83 Approximation Active-standby mode, 1843 Analysis of visual information, 3317 – frequent itemset, 120–123 Active storage, 37–38, 1552 Analytical interest, 1500 – randomization, 884–885 Active XML (AXML) documents, 38–40 Analytical validity, 1500 Apriori property, 98, 124–126 Activity, 41 Analytic hierarchy process, 1211 ARBAC97, 57 – block, 1661 Analytics, 3366, 3368 Architectural model, 2638 – diagrams, 41–45 Anchor text, 84 Architecture, 3012 Actor, 46 – document surrogate, 84 Architecture-conscious database system, AdaBoost, 261, 262 – home-page finding, 84 127–131 Adaptability techniques, 51 – incoming hyperlinks, 84 Archive recovery, 517, 518, 521–522 3724 Subject Index

ARC/INFO, 3132, 3136 Average precision, 192–193, 1256 Bitemporal chronon, 243 Area under ROC curve (AUC), 2351, 2352 – histogram, 194 Bitemporal query language, 243–244 Argus, 1898 – value for a given topic, 1691 Bitemporal relation, 2094 ARIES protocol, 1784–1788 Average R-precision, 195 Bitmap-based indexing, 248–251 Aristotle’s ontology, 1964 Axioms, 135, 1865 Bitmap-based index structures, 248–251 Arithmetic coding, 3047 AXML languages, 38 Bitmap compression, 250–251 Armstrong axioms, 135, 1200 Bitmap index(ices), 244–248, 1454–1457 Array databases, 2332, 2333, 2336–2338 B Bitmapped images, 1374–1376 AR sampling, 2467 Bag, 201–206 Bitmap table, 249 Artificial neural network (ANN), 1906, 1907 Bag relational algebra, 202, 204 Bitslice indices, 1454, 1456 Assessment activity, 608–610 Bag semantics, 201–206 Bitstrings, 2643, 2645 Association rule mining, 126, 136–139, Backup and restore, 200–201 Blanking, 1913 1184–1186, 3346, 3348 Backwards induction, 546 BLAST, 224 Association rule(s), 140–141, 365–368, 574, Bagging, 206–210, 988–990 Blind feedback (BF), 2382 2051, 3346–3351 Bag-of-visual words representation, 183 Blinding, 252 Associative similarity, 2648–2649, 2651 Bag of Words (BOW) model, 3069 Blind relevance feedback, 2447 Asynchronous JavaScirpt and XML (AJAX), – of datalog queries, 205 Blind signatures, 251–252 77–78 Bag-set semantics, 201, 202, 204, 205 – generation, 252 ATA, 2825–2826 Balanced pipeline, 2116 Block ciphers, 572–573 Atelic data, 142–143 Balanced trees, 1308, 1309 Block-level I/O services, 1574 Atomic clocks, 2108 Banking, 290, 292 Block nested loop join, 1895 Atomic event, 143 Base tables, 3244–3246 Bloom filter(s), 252–254, 2865 Atomicity, 143–146, 2588–2590, 2627, 2630 Basic database recovery methods, 1785 Bloomjoin, 253 Atomicity of actions, 143–144 Basic focused web crawl, 1150, 1152 BM25, 255–257, 1529, 1530 Attribute disclosure, 848 Basic retrieval performance measure, 2348 Boolean algebra, 2418, 2419 Attribution evolution, 2480 Bayes classifiers, 210–214, 341 Boolean expression, 2967 Audio Bayesian models, 1524, 1526–1527 Boosting, 259–263, 988–990 – classification, 148–154, 156 Bayes theorem, 211 Boostrap, 263–264 – compression, 3300–3301 BCNF, 264–265 Bottom granularity, 2971 – content analysis, 154–156 Behavior, 3017–3018 Boyce-Codd Normal Form (BCNF), – effect detection, 149–154 Best Match (BM), 255 264–265 – elements, 167–171 Best matches only, 1371 BP-complete, 265 – feature, 160–166 Bi-clustering, 2873 BP-Completeness, 265–266, 407Brand – indexing, 149 Bigram, 1910 advertising, 3457, 3458 – metadata, 157–160 Binary feature vector, 2157 Breadth-first search algorithms, 124–126 – parsing, 167–171 Binary Independence Retrieval (BIR), Broker, 2415–2418 – recognition, 149 2156–2160 Broker architectures, 500, 1899 – representation, 156 Binary large objects (BLOBs), 1818 Browsing, 267–268 – segmentation, 156, 167–171 Binary polynomials, 328 – in digital libraries, 268–273 Auditing and forensic analysis, 172–176 Binary semantic model, 438 – and searching, 1104 Auditory scenes, 167–169, 171 Bioinformatics, 1401–1403 Brushing, 1623–1626 Auditory sence segmentation, 167 Biological metadata management, 215–219 B-tree, 197–200 Augmentation, 67–69 Biological molecules, 220 B+-tree index, 197–200 Aurora/Borealis project, 1633, 1635 Biological networks, 220 B-tree locking, 273–277 Authentication, 176–180 Biological sequence, 223–224 B+-trees, 197–200, 242, 1300–1302, Authorization, 7–9 Biomedical data 1436–1437, 2681, 3172, 3173 – revocation, 12 – annotation, 224–228 Bucket algorithm and its variants, 2440 Automated page wrappers, 1191 – types, 229–232 Buffer management, 277–281 Automatic detection of auditory Biomedical image databases, 229 Buffer pool, 282–287 scenes, 167 Biomedical images, 1358–1360 Buffer pool data structure, 286 Automatic form generation, 1164–1165 Biomedical informatics, 1401–1404 Buffer replacement, 485–487 Automatic image annotation, 180–187 Biomedical literature, 233–235 Buffer replacement algorithms, 1800–1802 Automatic query expansion, 2258, 2259 Biostatistics, 236–238 Build phase, 1288 Autonomous database replication, 188 Biostatistics and data analysis, 236–238 Burrows-Wheeler Transform, 1443, Autonomous replication, 188–192 BIR Model, 2156–2160 1444, 3048 Autonomous systems, 47–50 Bisimilarity, 2861 Burst detection, 89 Availability, 729–731 Bisimulation, 2601, 2604 Business activity management (BAM), 413 Subject Index 3725

Business agenda, 1515–1516, 1518 Cellular phones, 1751–1753 Classifier learning, 151–152 Business intelligence, 287–288, 561, 563, Centralized deadlock detection, 900, 902 Client-Server DBMS, 342–343 3525, 3528 Centroid, 699 Clinical, 356–359 – data warehouse, 3472 Certain answers, 1407–1409, 1875, 1876 – data acquisition, 344–348 – systems, 287 Certain (and possible) answers, 315–317 – data and information models, Business logic, 998, 999 – conditional tables, 316 348–349 Business performance management, 287–288 – incomplete information, 317 – databases, 1564–1565 Business process, 289–293, 3545, 3546, 3548, – naive tables, 317 – data management systems, 344–347 3549, 3552–3557 – null values, 317 – data quality and validation – management, 1068–1071, 2170 Chandra and Harel completeness, 406–411 – accuracy, 349, 350 – management life-cycle, 291 Change detection on Streams, 317–321 – clinical data quality, 349–350 – modeling, 293–294 Change point analysis, 317 – completeness, 349, 350 – reengineering, 295–299 Change-table technique, 1421–1424 – reliability, 350 Business process execution language Changing data needs, 1516–1517 – decision support system, 350–353 (BPEL), 288–289, 3601 Channel-based publish/subscribe model – documents, 354 Business process modeling notation – pull style, 322 – event, 355 (BPMN), 3601 – push style, 322 – information systems, 351 Business-to-Business, 292 CHAP, 2828 – observation, 359–360 Business to business (B2B) integration, 991 Chart, 323 – ontologies, 360–363 Business workflows, 2507 Chase, 1563 – order, 363–364 By-product, 1515 Checksum, 327–328 – order and purchase order system, – and cyclic redundancy check 363–364 C mechanism, 327–328 Clinical document architecture (CDA), Cache Chip multiprocessor (CMP), 127–131 353–354 – line, 2195, 2196 Cholesky decomposition. Closed Itemsets, 365–368 – management, 744–747 Choreography, 2004, 2005Chronicle event Closed subsequence, 2622, 2625 Cache-conscious query processing context, 419 Closest-pair query, 368–373 – cache, 301–303 Chronon Cluster and distance measure, 374–375 – cache miss, 301, 302 – period, 329 Cluster-based classifiers, 341 – locality, 301–303 – time interval, 329 Clustering, 374–387, 393–396, 699–700, – memory latency, 302, 303 CIFS, 2824, 2826 781–783, 795–798, 1291–1294, Caching, 1738–1742 Citation 3355–3360, 3417–3425, 3506–3510 Caching in search engines, 3501–3504 – analysis, 330 – algorithms taxonomy, 384 Calculus expression, 420–421 – bibilometrics, 330 – index, 1434 Calendar, 305, 2969, 2971–2973 – co-citation, 330 – overview and applications, 383–387 – algebra, 2971, 2972 – matching, 330 – validity, 388–392 – cyclic time, 304 – reference, 330 – index, 388, 391 – date(s), 304 Class, 2914–2920 – methods, 388 Calendric system, 305 Classical MDS, 1784 Cluto, 937 Call level interface (CLI), 2755 Classification, 985, 3352–3355 Coalescing, 2932–2935 Camelot, 1898 – algorithms, 3041–3043 Coarse-grained provanence, 2203 Camera break (or video edit), 3316 – divide and conquer, 332 Co-clustering, 2873, 2874, 3045, 3046 Camera-takes, 3308 – error rate, 334 CODASYL, 2289 Candidate key, 1587, 1588 – learning, 331–335 Codd E.F. 2753, 2754, 2759, 2760 Canonical sensor network platform, 1538 – lightweight ontologies, 1614–1617 Cognitive overload, 259 Cartesian product join, 309 – model, 1886 Collaborative ontology elicitation, Cartography, 3383, 3384, 3386 – overfitted, 334 1967, 1969 Catalog, 570 – statistical modeling, 332 Collaborative software, 2667 Cataloging in digital libraries, 309–314 – in streams, 340–341 Collection of time-referenced data, 2957 – classification, 310–311 – symbolic learning techniques, 331 Collections and collection operations, 1928 Categorical data, 836, 3416–3417 – tree, 766, 767, 2469–2473 Color model, 1375, 1377 Categorical microaggregation, 1736 Classification by association rule analysis Combination of evidence, 3479 Categorical variables, 1660 – association rules, 335–339 Combinatorial search, 738–741 Causality relations, 1035, 1044 – associative classification, 335–339 Common internet file system (CIFS), 1900 Cayuga, 1029–1032 – classification based on associations Common Warehouse Metadata Interchange, CDP implementations, 478 (CBA), 335, 337, 338 401–404 Cell suppression, 1473 – classificatuon, 335–339 Common Warehouse Metamodel, 401–404 3726 Subject Index

Compact encoding, 2, 3 Conceptual modeling, 1942, 1966, Content-based image retrieval (CBIR), 229, Compact representation of decision 1967, 2572 231–232, 1354, 1356, 1357, 1368–1370, rules, 769 Conceptual schema, 1645–1648 1373, 2379–2381 Comparative analysis, 405 Conceptual schema design, 438–442 – relevance feedback, 2282–2285, 2287 Comparative visualization, 405 Conceptualization, 723–728 – target search, 2282, 2284, 2287 Compatibility, 2936–2945 Concurrency, 2627, 2631 Content-based indexing, 1350 Compensating transactions, 2588–2590 – control, 443–444, 2591, 3144–3156 Content-based profilers, 2093 – subtransactions, 406 – control and recovery in B-tree, 274 Content-based publish/subscribe, 464–466 Complacency, 1510, 1511 Concurrency control manager (CCM), 445 Content-based publish/subscribe systems Completeness, 3017 Concurrent programming languages, over peer-to-peer networks, 2070 Complete query language, 406–411 1554–1556 Content delivery network (CDNs), 2800, Complex event, 411–413 Condition, 960, 2547 3442 Complex event processing (CEP), 412–413, Condition-action coupling, 34 Content description based on invariant 1029–1032, 1055, 1068 Conditional dependencies, 458, 460, 462 features, 1364 Complexity theory, 2041 Conditional logic, 2006 Content description based on semantic Complex query predicates, 1858 Conditional random fields, 397, 399, 400 features, 1364–1365 Complex set of decisions, 769 Conditional tables, 1407–1409 Content determination, 3049 Complex shapes, 809 – certain answers, 447 Content distribution, 2061–2064 Component abstraction, 6 – incomplete information, 447 Content links, 941 Component based software development – naive tables, 447 Content modeling, 3276–3280 (COSD), 414 – null values, 446 Content-only query, 473 Composed services, 413–418 Condition evaluation, 959 Context, 473–474 Composed services and WS-BPEL, 413–418 Confidentiality, 729–730, 2783–2789 – aware user interfaces, 46–47 Composite event, 418–419, 1045, Confidential outcome attribute, 1735 – dimension, 474 1059–1062 Conflation, 1608, 1609, 2790, 2791, 2793 – of a time, 2377 Composite web application, 3482–3483 Conflict(s), 1991–1994 – of use, 46–47 Composition, 419–420 – equivalence, 1948 Contextual advertising, 3458 Composition of fuzzy relations, 1209 – vs. non-conflict operations, 1794 Contingency transaction, 1979 Compressed bitmap indices, 1456 – resolution, 628 Continuous data, 3437 Compressed full-text indexes, 1443–1447 – resolution mechanism, 1518 – consistency, 3443–3444 Compressed structured text, 1679–1684 Confluence, 37 – stream, 492 Compressed suffix Conjunction, 448, 449 Continuous data protection (CDP), 478 – array, 1443 Conjunctive query(ies), 93, 448–449 Continuous event context, 419 – tree, 1446 Connection, 449 Continuous events, 35 Compression, 421–429, 3051, 3052, 3054 Connection pool, 449 Continuous κ-nearest-neighbor (C-κNN) – distance function, 424–426 Connectivity, 696–699, 1977–1978 queries, 2443, 2445 – mobile location data Connectivity logic, 998–1000 Continuous media data (audio/video), 1814 – scheme, 1684 Connector, 696–699, 1978 Continuous microaggregation, 1736 – techniques, 621, 622, 625 Consensus, 1510, 1511 Continuous monitoring of spatial queries, Computer aided annotation, 1385, 1388 Consequence of an event, 1046 479–483 3D computer graphics, 2506 Consistency, 722, 1071–1072, 1510, 1925 Continuous multimedia, 484–487 Computerized physician order entry – data, 452 Continuous multimedia data retrieval, (CPOE) – models, 626–628 484–487 – clinical decision support, 434–436 – problem, 462 Continuous queries, 492–493, 3533, 3534, Computerized provider order entry, – query answering, 452, 1410, 1413, 1414 3536 432–437 Consolidated storage, 2798 – models, 490 Computer performance, 2086 Constant interval, 2925, 2926, 2928, 2995 – in sensor networks, 488–492 Computer Supported Collaborative Work Constraint(s), 323–327, 704, 705, 708, Continuous relevance scale, 2747, 2748 (CSCW), 1327 1179–1183, 1940–1941, 2754, 2757–2760 Continuous spatial query, 479 Concatenated transactions, 493 – based mining, 1182 Continuous time model, 3112 Conceptual data model, 2559 – databases, 452–457 Continuous uncertainty, 648, 649 Conceptual design, 2940, 2944 – model, 454 Continuous variables, 1660 Conceptual interfaces, 1554, 1555 – query languages, 454–457 ConTract, 493–494 Conceptual model, 1004, 1008, 1009, 2559, – RBAC, 91–92 Contrast pattern based classification, 985 2944 Containment relationships, 1308 Control data, 494 Conceptual model for integration of Content acquisition, 224–228 Control-flow, 3553, 3554, 3556 software systems, 2633 Content-and-structure query, 463–464 – diagrams, 41–45 Subject Index 3727

– patterns, 3557, 3558 Cross product, 308–309 – techniques to improve scientific – statement, 1661 Cross-references, 941 simulations, 733–738 Controlled rounding, 1473 Cross-validation, 532–537 – trigger, 738 Controlled tabular adjustment, 1473 Cube, 538–539, 1950–1953 – tuning, 738–744 Conventional query processing, 51 Cube implementations Database cluster (DBC), 700–703 Conventional storage subsystem, 1899 – aggregation, 539, 541, 543 Database cluster architecture, 701–702 Convergence, 3453, 3454 – dimension, 539–543 Database fact, 3162 Convertible anti-monotone, 494, 495 – fact table, 539–543 Database integrity, 2972–2986 Convertible constraints, 494–495 – materialized view, 540 Database interfaces, 1162, 1164 Convertible monotone, 494, 495 – measure, 539, 542 Database Language SQL, 2753, 2755, 2760 Convex subset, 243, 2966 Cumulated gain, 1016, 1020, 1021 Database machine, 1551, 1552, 2027, 2028 Coordination, 495, 496 Cumulative event context, 419 Database managed file, 2797 1-Copy correctness, 2385 Curation, 224–228, 816 Database management systems (DBMSs), Copy on write, 2118 Current, 1920–1924 714–718, 1162, 1164, 1165, 2178, 2180, Copyright, 496–500 Current semantics 2181, 2184 – issues in databases, 496–500 – temporal databases, 544 Database repair, 452 – law, 1013 – temporal upward compatibility, Database replication, 1738–1742, – protection, 826, 828 544–545 2392–2396, 2403–2407 Copyright owner’s rights, 498 – timeslice, 544, 545 Database server, 342, 343 Copyrightable elements of a database, 1611 Curse of dimensionality, 545, Database system layers, 3156 1-Copy-serializability, 2854 546, 1439 Database transaction, 3150 1-Copy-SI, 2854, 2856 Cut, 3316–3319 Database tuning using combinatorial search, Co query, 473 Cut criterion, 2749 738–741 CORBA event service, 2210 Cyberinfrastructure, 825 Database tuning using trade-off elimination CORBA notification service, 2210 Cyclic redundancy check (CRC), – tuning, 744–747 Core RBAC, 91–92 327–328, 2823 – workload, 744–747 e-Coresets, 1240–1242 (Lack of) Database use in science CORIE, 2254 D applications, 748–750 Corpora, 938 DAC policies, 864 Database vacuuming, 3023 Corpus, 3041, 3042 DAML+OIL, 2008 Data broadcasting, caching and replication Correlated noise addition, 1911 Daplex in mobile computing Correlation analysis, 89 – functional data model, 547 – data broadcasting, data caching and Correlation clustering, 2873–2875 – query language, 547 replication, 558–560 Cost-based optimization, 1996 DAS, 2824, 2826 – intermittent connectivity, 557–558 Cost-based query optimization, 2290 Data access, 2783–2789 – multi-hop infrastructures, 557 Cost estimation, 506–510, 2548 Data acquisition and dissemination in – single-hop infrastructures, 557 Cougar, 710 sensor networks Data-centric techniques, 2618 Counting triangles, 1273–1274 – data acquisition and dissemination Data cleaning, 561–563, 566, 568, 569, Count-Min sketch, 511–515 protocol, 548 780–784 Coupling, 516, 1661–1662 – wireless sensor networks, 548 Data cleaning and curation, 749 – modes, 33–35 Data aggregation, 2617 Data collection, 564–565 – of system components, 516 Data allocation, 890, 891 Data complexity, 2041 Coverage, 2748 Data architecture, 1516 Data compression, 564–565 Covering index, 516–517 Data authentication, 177, 179 Data consistency, 3442–3444 CPU register, 1707 Database, 257–259, 3018–3023 Data cube, 2014, 2016 CQL, 2521 – auditing, 172–174 Data dictionary, 570–571 Crash, 517–522 – buffer, 277, 280 Data dissemination, 1687–1689 Crash recovery, 517–522, 1643 – buffer pool, 285 Data encryption, 571–573 Crawl-and-index, 785, 787 – design, 708–709 Data encryption standard (DES), 572 Crawler, 1419–1420, 1463, 1464, 1466 – forensics, 174–176 Data error, 565–569 Creation of index files, 1529 – machine, 714 Data estimation, 574 Cross-language information retrieval, – middleware, 719–721 Data exchange, 575–581 523–527 – profile, 604–607 – problem, 575, 578, 580 Cross-language web mining, 523–527 – repair, 722–723 – setting, 575, 576, 578–580 Cross-lingual query suggestion, 525–526 – replica, 188–192 Data expiration, 3023, 3025, 3027 Cross-modal multimedia information – reverse engineering, 723–728 Data exploration, 3342 retrieval (CMIR), 528–532 – state, 36 Data extraction, 3465–3470, 3472, 3569 3728 Subject Index

Data flow, 3555 – measurement, 608–612, 1512–1514 Data warehousing, 679–683 Data formats, 133 – models, 616–620 – for clinical research Data fusion, 1705, 2556, 2558 – policy, 1515, 1516 – healthcare, 680, 682 Data generator, 2339–2343 – roles, 1516, 1517 – research, 679–683 Data grids, 133, 813–815 – tags, 1511 – systems, 684–692 Data inconsistency, 565–569 Data rank/swapping, 620–621 DB&IR integration, 1543–1546 Data independence, 2011, 2754 Data reduction, 421–429, 621–626 DBMS, 1295, 1296, 1901, 1902, 1904, 1905 Data integration, 590–593, 1491–1495, – in database, 622, 623, 625 – component, 755 1564, 1719, 1721, 2055, 2065–2069, Data redundancy, 1917 – interface, 755–756 3332–3339, 3472 Data replication, 626–630, 2383–2387, 2392 DDBS, 894–896 Data integration architectures and Data retrieval, 3472 Deadlock resolution, 900, 902–903 methodology for the life sciences Data sampling, 630–633 Decaying aggregation, 758–760 – data integration, 585–589 Data sketch, 634 Decaying sum, 758–760 – link-based integration, 586–587 Data skew, 634–635 Decision support, 356–358 – materialized integration, 586, 587 Data standards, 1517 Decision table (DT), 761–764 – virtual integration, 586, 587, 589 Data storage, 3438 Decision tree classification, 765–768 Data intensive simulation, 3525 – and indexing in sensor networks, Decision tree classifiers, 341, 765–768 Datalog, 751–754, 1547–1550, 2302–2306 635–637 Decision trees, 769, 2469–2474, 3352–3355 Data management, 107–110 – management, 1814, 1817 Declarative networking, 770–771 – for large graphs, 1262 Data stream(s), 136–139, 340, 341, 378, 380, Declarative query Data manipulation, 2754, 2757, 2758, 2760 382, 2768, 2770, 2834, 2836, 2837, – interface, 488 Data mart, 594, 686, 688–691 3533–3536, 3610, 3634, 3635 – over distributed network state, 770 Data mining, 574, 595–598, 692–695, 986, – algorithm, 1948–1949 Decomposition, 704, 705, 707, 708 1180, 1183, 1291, 2725–2730, 2948–2950, – management, 52–55 De-coupling, 516 3365–3369 – management architectures and Deduction method, 119 – classification, 595, 596 prototypes, 639–643 Deductive data mining using, 772–778 – clustering, 596 – model, 2236 Deduplication, 562, 779, 2558, 3506–3510 – outlier analysis, 595, 596 – processing architecture, 639–643 – an address mapping table, 779 – pattern mining, 595, 598 – summary, 512, 514, 515 – techniques, 779 – predictive modeling, 595, 596 – synopsis, 1143, 3538 Deep web, 784–787, 2519 – process workflow, 1586 Data stream management systems (DSMS), Deferred coupling, 34 – techniques, 2147, 2149 2475, 3538 Deferred view maintenance, 3326, 3327 Data mining process, 1586 Data swapping, 620–621 Definable sets, 453 Data model(s), 1900–1905, 1940, Data types Definition of a view, 3325 2119–2122, 2559–2561, 2571–2574, – in scientific data management Deletion anomaly, 1918 2599–2605, 2932–2935, 2952–2957, – arrays, 644, 646 Demand-driven pipelining, 2117 3132–3139 – finite element meshes, 645 Denial constraints, 458, 459 – for spatial networks, 2714–2718 – graphs, 645–646 Denomalization, 709 Data-oriented models, 616, 620 – time series, 644–645 Dense index, 1433, 1434 Data outsourcing, 2523–2528 – streams, 1063 Dense pixel displays Data partitioning, 599–600, 1292, 1314, Data uncertainty management in sensor – very large multidimensional data sets, 1315, 2024–2026, 3341 networks, 647–651 789 Data patterns, 3557, 3558 Data virtualization, 812–813 Dense time model, 3112 Data perturbation, 2148 Data visualization, 652–657, 2430–2431, Density-based clustering Data placement, 1567 2897, 3410 – efficiency, 795–798 Data privacy, 600–604 Data volume, 3438 – parameters, 795, 797, 798 – the notion of consent, 600 Data warehouse(s), 594, 657–663, 669–674, Dependency(ies), 704–708, 1009–1010 – and patient consent, 600–604 684–692, 1454–1457, 1560–1564, Dependency preservation, 1919 Data profiling, 561–563, 604–607 2731–2735, 3330 Depth-first (DF), 1891 – samples, 606–607 – architecture, 690–692 Derivation of a collection of events, 411–412 Data provenance, 608, 2203, 2205 – life-cycle and design, 658–663 Derivation of an event as a function, 412 – the origin of a piece of data, 608 – maintenance, 664–668 Derived fragmentation, 892 Data quality, 561, 562, 612 – metadata, 669–674 Description, 215–217, 221, 222 – assessment, 608–612 – quality, 2230–2235 Description logics (DL), 799–802 – benchmarking, 609 – security, 675–679 Descriptive lightweigh ontologies, – dimensions, 612–615 – technology, 3525 1614–1616 – environment, 1516, 1517 – versioning, 665–667 Design for data quality, 803–807 Subject Index 3729

Design of effective icons, 1334 Dirty data, 566–569 Distributed hash tables (DHTs), 903–904, Design patterns, 3557, 3558 Disaster recovery, 847–848, 1643, 1644 1627–1630, 2056, 2082 Desktop metaphor, 846, 847, 3387 Disclosure, 2783–2789 – overlay networks, 903, 904 Detail-in-context, 869–871 – metrics, 2138 – peer-to-peer systems, 904 Deterministic algorithm, 1287 – risk, 848, 2512, 2513 Distributed join, 904–907 Dewey decimal classification, 808 – re-identification, 848 Distributed mediator system, 80 DF algorithms, 1893 – uniqueness, 848 Distributed query optimization, 908–911 DHT, 2863–2866 Discounted cumulated gain, 849–853 Distributed query optimization algorithm, Diagrams, 809–810, 3370–3373 Discovery, 853–857, 3366–3368 908–909, 911 – connections, 809 Discovery-and-forward, 785 Distributed query processing, 2592 Dialogue specification, 1329 Discovery and integration (UDDI), 854, – join, 914–916 Dictionaries, 965, 966 855, 857 Distributed recovery Difference, 811 Discrete models, 1853, 1854 – logging, 917, 918 Differential backup, 201 Discrete time model, 3112 – three-phase commit, 917 Differential privacy constraints, 2147, 2148 Discrete uncertainty, 648 – two-phase commit, 917, 918 Digital archives, 811–816 Discrete wavelet, 857–863 Distributed representations, 1847 Digital archives and preservation Discretionary access control (DAC), Distributed source coding, 564–565 – authenticity, 811–813 864–866, 2448, 2450 Distributed spatial index (DSI), 76, 920, – chain of custody, 811–813, 815 Discriminative approaches, 183 921, 923–924 – integrity, 811–813, 815 Disease understanding and treatment, 107 Distributed spatial join, 920–922 – preservation, 811–813, 815–816 Disk, 2799, 2800 Distributed systems, 2066 – provenance information, 811, 812 – drive, 866–868, 1900 Distributed transaction management Digital asset management, 979 – I/Os, 1333 – schedules, 927, 928 Digital curation, 816 – power saving, 867–868 Distributed transactions, 879–883 Digital elevation models (DEMs), 817–821 – scheduling, 1832–1833 Distributed two phase locking, 880, 881 Digital gezetter, 1217 Disk-based index structure, 1222 Distributional statistics, 605 Digital image, 1115, 1116, 1343–1347, 1362, Display advertising, 3458 Distribution database design, 3340 1367 Dissolve, 3316, 3318 Divergence between replicas, 451 Digital information, 816 Distance-based record linkage, 2353 Divergence from randomness (DFR) Digital libraries (DLs), 309–314, 821–825, Distance – framework, 1130 2518–2521 – between streams, 2842–2844 – information retrieval models, 929 – federation initiative, 1636–1637 – function, 1451–1454, 1734 – models, 929–932 – systems, 823–825 – linkage disclosure risk, 2513 DL-based knowledge base, 801–802 Digital rights management (DRM), 825–830 – measures, 374–375 DNA Digital signature algorithm (DSA), 832, 833 – metric, 1379–1383 – microarray, 1218 Digital signatures, 830–835, 1715 Distinct data type in temporal database, – of an organism, 1218 – authenticity, 830, 832, 835 3113 3D objects retrieval, 1125–1128 – integrity, 830, 832, 833, 835 Distinct sampling, 2839–2841 Document(s), 932 – schemes, 252 Distinct-values estimation, 1143, 1146 – clustering, 933–937 Digital video, 466–472, 3271, 3286, 3287, Distinction between telic and atelic data, – criterion function, 934–936 3289 2911 – databases DIG35 specification, 1349 Distortion viewing, 869–874 – document repositories, 938 DIME, 3132–3135 Distributed architecture, 875–879 – text databases, 938 Dimension, 594, 836, 2665, 2666, 2779–2780 Distributed computing middleware, 3510 – exchange, 38 – for the knowledge model, 36 Distributed concurrency control, 879–883 – field, 939–940 – reduction techniques for clustering, Distributed database, 875–879, 896, 898, – footprint, 1253, 1254 838–842 912, 914–916 – formatting systems, 942 – table, 2665, 2779–2780 Distributed database systems (DDBS), – frequency (DF), 1570–1571 Dimensionality reduction, 3042 894–896 – generation models, 2169, 2170 Dimensionality reduction technique, 546 Distributed data fusion, 583 – index, 1425 Dimensional model, 658, 1777–1783 Distributed data streams, 883–889 – layout, 1658 Dimension-extended topological Distributed data warehouse, 2012–2018 – length, 3937–3942 relationships, 843–845 Distributed DBMS, 875–878, 896–898 – length normalization, 940–941 Direct attached storage (DAS), 846 – distributed coordination, 897, 898 – links and hyperlinks, 941 Direct lateral communication, 295 – one-copy semantics, 897 – management, 997 Direct manipulation, 846–847, 3379, 3380 – update propagation, 897 – management systems, 938 Direct-marketing advertising, 3457 Distributed deadlock detection, 901–903 – markup standard, 354 3730 Subject Index

– metadata, 939 Electronic health records (EHRs), 344, ETM, 3559 – relevance, 2514 968–972 European law in databases, 1013–1015 – representations (inclusive of native and Electronic ink indexing, 974–977 Evaluation, 193, 2448, 3479, 3481 relational), 942–946, 3041–3042 Electronic transaction, 960 – of filtering systems, 1483–1484 – structure, 939, 3049 Elementary sketches, 81–83 – of information retrieval systems, Domain, 2967 Element shapes, 809 192–193 – evolution, 2480 Eleven point precision-recall curve, 981–982 – measures, 1016, 2747, 2748 – relational calculus, 2370–2371 Eligibility criteria, 1013 – metrics, 1015–1024 Domain-independent query, 2463, 2464 Embedded dependency(ies), 1156–1158, – and optimization of Datalog, 753–754 Dominance rule, 1473 2489 – of relational operators, 1024–1029 Downward inheritance, 2911, 2913 Embedded functions, 38 Evaluative linguistic expressions, 1213 DP-matching, 3295 Emergent semantics, 982–984, 2056 Event(s), 959, 960, 1041–1043, 1053–1058 DRAM main-memory, 1707 Emerging pattern, 107, 985 – in active databases, 1044–1045 Drift, 2388, 2389 Emerging pattern based classification, 985 – causality, 1033–1034 DTD (Document Type Description), 3572, Encina, 1898 – channel, 1034 3621, 3650–3653 Encoded bitmap index (EBI), 246 – cloud, 1034–1035 D-tree, 73, 74 Encryption, 571–573 – detection, 1035–1039 Duality transformation, 1459, 1461 Encyclopedia, 967 – driven architecture, 1040–1043, 1054 Dublin core, 947–949, 1724 End-user map operations, 2720 – flow, 1044 – encoding scheme, 948 Energy-efficient disk array, 1697 – instances, 1044 – metadata element set, 947, 948 Ensembles, 210 – lineage, 1046 Duplicator, 963, 964 – classifiers, 341 – parameters, 1045 Duration of copyright, 497 – methods, 262, 988–990 – pattern detection, 1029, 1032, Dynamic attribute, 1771, 1772 Enterprise application integration (EAI), 1046–1048 Dynamic graphics, 950–953 991–996 – pipe, 1063 Dynamic integrity constraints, 2976, 2982 Enterprise architecture, 1516, 1518 – prediction, 1048–1052 Dynamic partitioning, 1567 Enterprise content management (ECM), – relation, 1045 Dynamic random access memory (DRAM), 997 – sink, 1058 1668–1669 Enterprise information integration, 1495 – source, 1059 Dynamic revalidation, 3654 Enterprise java beans, 1578, 1579 – specification, 1059–1062 Dynamic web pages, 954 Enterprise privacy authorization language – stream, 1063 (EPAL), 2142 – stream processing, 1029–1032 E Enterprise service bus, 997–1000 – transformation, 1064–1067 Eager propagation, 2856 Enterprise terminology services, 1000–1003 – translation, 1064, 1066, 1067 ECA rules, 35–36, 959–960, 1080, 1404, Entity beans, 1578, 1579 – triggering rules, 959 1405 Entity relationship diagram (ERD), 1004, – types, 1035, 1036, 1059–1062 – action, 959 1005 Event-component information model, 349 – condition, 959 Entity relationship model (ERM), Event-condition coupling, 34 e-Commerce transactions, 960 1003–1009, 1083–1091 Event consumption modes, 35 Eddy operator, 51 Environment stack, 2772 Event detection, 3303–3308 Edge detection, 1390–1395 Epidemic dissemination, 2082 Event detection and recognition, 1477 Edge-server system, 3444 e-prescribing, 434 Event-driven applications, 1041, 1043 Effectiveness involving multiple queries, Epsilon-serializability, 504 Event-driven business process management, 961–963 Equality-generating dependencies, 1068–1071 Effectiveness of IR, 1522 1009–1010 Event driven process chains, 293 Effectivess evaluation, 961 Equality join predicate, 1288 Event-driven programming, 355 Efficient query processing, 1861 Equality predicate, 1427 Event monitoring, 29, 31, 32, 2093 EF-game, 963–964 Equivalent execution plans, 2548 Event pattern, 2431, 2433 Egds, 1009, 1010 Error-correcting code (ECC), 2823 Event probability, 3224 Ehrefeucht-fraisse games, 963–964 Escrow commits and aborts, 1011–1012 Event processing, 1033, 1034 Ehrenfeucht game, 963–964 Escrow transactions, 1010–1012 – agent, 1052–1053

ei, 476 Estimation of term probability, – network, 1033, 1034, 1046, 1052, 1053, Eigenvalue, 2136 2158, 2160 1058, 1059, 1063 Electric power consumption of storage ETL – systems, 1053–1058 devices, 2821 – processes, 1095, 1096, 1098–1101, Event-subscription matching over Electronic dictionary, 965–966 3471–3472 structured p2p networks, 2070 Electronic encyclopedia, 967–968 – systems, 1095 Eventual consistency, 3452, 3453, 3455 Subject Index 3731

Event uncertainty, 3221–3224 F – first-order structures, 1138 Evidence based medicine, 1072–1073 Faceted browsing, 1973, 1976 First-order logic, syntax theorems, Evolution and versioning, 665–667 Faceted metadata, 1103, 1109 1140, 1141 Evolutionary algorithms, 1224–1227 Faceted search, 1103–1108 First-order vocabulary, 1140 Evolutionary computation, 1224–1227 Facility location, 2419–2423 First principal component, 2136 Exactly once application, 100 Factoid question answering, 3486, 3487, Fisheye views, 869, 870 Exactly once execution, 100–103 3489 Five RAID levels, 2359 Exact ranking of the relevant documents Fact-oriented modeling, 1941–1946 Fixed-group microaggregation, 1736 returned, 195 Fact table, 2665, 2666, 2779, 2780 Fixed-parameter tractability, 2041, 2043 Exchangeable image file (EXIF), 1349 Faithful stream operator, 2216 Fixed time span Excluded terms, 2795 False positive probability, 253 – time interval, 1141 Exclusion rights, 496, 497 False positive rate (FPR), 2349–2351 Fixpoint theory, 753 Executable descriptions of distributed Fault tolerance, 2397–2402 Flash, 2798–2800 algorithms, 770 FCP, 2824–2826 Flashback query, 3120 Executable processes, 288 Feature-based approaches, 1125 Flash memory, 286, 287 Execution cost, 506, 507 Feature-based 3D object retrieval, FlexPath, 3638 Execution order dependencies, 1142 1125–1128 Flex transactions, 1142, 1222 Execution plan, 1575 Feature-based object model, 1938 Flux, 1111–1113 Execution skew, 1079 Feature extraction, 161 F-measure, 2776–2778 Experimental data, 132–135 Feature extraction for content-based image – a compromise between precision and Experimental tool, 1737 retrieval, 1115–1119 recall, 1147 Explicit cross-references, 941 Feature selection, 161 – precision, 1147 Explicit event, 1080, 1404, 1405 – clustering, 1119–1124 – recall, 1147 Exploratory data analysis (EDA), – high-dimensionality, 1119, 1124 – weighted harmonic mean, 1147 1080, 2136 Feature space, 1379, 1382 FM synopsis algorithm, 1143–1146 Exploratory stage of data mining, 1080 Feature vector approach, 1126 Focused crawling, 2520 Explortary spatial data analysis Federated search, 2518 Focused crawling using context graphs, (ESDA), 2691 Feedback, 2414–2415 1150–1151 Exponential decay, 758–759 Feedback control, 2553–2554 Focused retrieval, 2867, 2868 Exponential histograms, 759, 760 Feed-forward ANN, 1906 Focused web crawling, 1147–1154 Expressiveness, 1081, 1083 Fellegi–Sunter model, 2354, 2356 Focus-plus-context, 869 Expressiveness of query languages, 406 Fetch as needed, 905 Folding, 2933 Expressive power of query languages, Fiber channel, 2824–2826, 2829 FOL modeling of integrity constraints 1081–1083 Fibre Channel and iSCSI, 2812 (dependencies), 1155–1160 Extended entity-relationship (EER) Field-based information retrieval models For “Connection”: Connection, 2636 – data model, 438, 1083–1091 – combination of field information, Foreign key, 2756, 2758 – schema, 1646, 1647, 1649 1129, 1130 Forever Extended S-reducibility, 2620–2621 – document representation, 1129 – end time, 1161 Extended transaction models (ETMs), 493, Field-based spatial modeling – infinity, 1161 3559 – discrete machines, 1133 – valid timetime value, 1161 Extendible, 1093–1094 – field, 1132–1137 Formal concept analysis, 365 Extensible architecture, 3013–3015 Field-dependent normalization, 1130 Format, 217, 221, 222 Extension, 2936–2937, 2941, 2943 File sharing networks, 2076 Forms-based interfaces, 1162, 1164–1166 0-Extension, 122 File system, 2796, 2797 For “Session”: Session, 2636 1-Extension, 122 Filtering systems, 1482–1484 Fourth normal form (4NF), 1166–1167 Extensionalization, 1923 Filter/refinement query processing, Fractals, 2675 Extensional relational databases (ERDB), 1860–1862 – space-filling curve, 1168–1169 761, 762 Fine-grained provanence, 2203 Fragmentation and replication, 909 Extent (of temporal granularity), 2970 Finite automata, 3635 Fragment of genetic or protein material, 224 External DBMS interface, 756 Finite axiomatizability, 1398 Frame-by-frame comparison by continuous External hashing, 1289–1290 Finite element meshes, 645 dynamic time wraping (DTW), 3295 External quality measure, 3046 The finite implication problem, 1396–1400 Frecpo algorithm, 1189 External storage, 635–637 First committer wins, 2661, 2662 Frequency moments Extraction, 2511 First-order formulae, 1140 – computational complexity of – of metadata from raw video, 3271 First-order incremental algorithms frequency moments, 1170 – transformation, and loading (ETL), First-order logic (FOL), semantics – frequency, 1169–1170 1095–1101 – definability, 1138, 1139 – stream, 1169–1170 3732 Subject Index

Frequency table, 2908 General network connecting storage Google map, 1232 Frequent closed itemsets, 140 devices, 2797 GOPPR, 1728 Frequent elements, 1175–1179 General secure database systems, 2530 Gossiping-based methods, 1688 Frequent graph patterns, 1170–1175 Generative algorithms, 183 Government, 292 Frequent itemset mining, 124–126, 365, Genetic algorithms, 1224–1227 GPS data, 1692–1695 367, 1179–1183 Genetics/Genomics, 1400–1404 Grammar, 1256–1259 Frequent itemset mining with constraints, Genomics algebra, 2262 Grammatical data stream, 2216 1769 Geo coding, 1252–1253 Gramm-Leach-Bliley act (GLB ACT), 2140 Frequent itemsets, 136–139, 1179–1187, Geo crawling, 1252 Grand tour, 950, 951, 953 2051, 2052, 2054 Geographical databases, 2571 Granular computing, 772–778 Frequent items on streams Geographically-distributed crawl, 3465 Granularity, 2968–2973 – heavy hitters, 1175–1179 Geographically referenced data and Granularity of the occurrence time, 2975 – hot items, 1175–1179 information, 1246, 1248, 1249 Granularity of the reference to time, 2975 Frequent pattern, 1188 Geographic data modeling, 1133 Graph, 1260–1263 Frequent subgraph mining, 1170, 1171, Geographic focus, 1252, 1253 – classification, 1749 1173, 1174 Geographic information retrieval (GIR), – clustering, 1749 Frequent subsequence, 2622–2625 1227–1231, 1251, 1254 – connectivity, 1272 Frequent updates, 1458 Geographic(al) Information Systems (GIS), – databases, 1268–1269 Freshness, 2386 1231–1235, 1639–1642, 2571–2575, – kernel, 1748, 1750 Full-text index, 1571 2655–2656 – management 1266–1271 Full-text search extension to the Geographic scope, 1253 – mining, 1749 XQuery 1.0, 3665 Geographic score, 1253 – search, 1749 Fully-automatic web data extraction, Geographic web search, 1251–1255 – XPath, 1265 1200191–1193 Geography markup language (GML), Graphical language, 3400 Functional data model, 1193–1198, 1236–1238 Graphical User Interfaces (GUIs), 847, 1201, 2011 Geometrical primitives, 1374 3379, 3387 Functional dependency(ies) (FD), 1010, Geometric match, 1230 Graphic techniques, 1080 1155–1158, 1199, 1200, 1411, 2960–2962 Geometric mean average precision (GMAP), Graph query languages, 1269–1270 Functional dependency implication, 135 evaluation metric 1256 Gregorian calendar, 304 Functional design, 1973 Geometry-based object model, 1937 Grid and workflows, 1276–1278 Functional expressions, 1194 Geo parsing, 1252–1253 Grid file (and Family), 1279–1282 Functional query language and data model, Geo raster services, 2332, 2333, 2336 Grid-partition index, 74 2007 GEO-RBAC Model, 1244, 1245 Grid quorums, 2314, 2315, 2317 Functional query languages (FQL), 79–80, Georeferencing, 1246–1249 Grid workflow, 1276–1278 1201–1204 Geo search, 1251–1253 Group communication, 2392–2397 Functions, 1194, 1195, 1197 Geospatial, 1249–1251 GUID, 2428–2429 Fundamental requirements of stream – coordinates, 1246 Guideline modeling languages, 1075 processing, 2849 – referencing, 1246–1249 GUIs for web data extraction, Fuzzy generalizations, 1205, 1206 Geo tags, 1251, 1252 1282–1286 Fuzzy IF-THEN rules, 214, 1211, 1213 Geo-targeted search, 1251–1255 Fuzzy/Linguistic IF-THEN rules and Gexetter entries, 1217 H linguistic descriptions, 1214–1215 Gezetter(s), 1217–1218 Haar wavelet, 3446, 3447 Fuzzy logic, 2418, 2419 GIRAS, 3132, 3135, 3136 Hamming code, 2359 Fuzzy models, 1205–1209, 1808, 1812, 1813 GIS operations, 2720 Handwritting recognition, 973, 974 Fuzzy preference relation, 1212 GIS software, 1232, 1234, 1235 Hard disk, 866–867 Fuzzy relations, 1210 Global and Local as View (GLAV), 338, Hard disk drives, 2821 Fuzzy set, 1209–1210 2489, 3332, 3333 Hardware architecture, 127–131 Fuzzy set theory, 1207, 2418 Global as View (GAV), 1492, 2489, Hardware tuning, 2114 3332–3334 Hash-based index, 1289–1290, 1707 G Global concurrency control strategies for Hash-coding methods, 252 Gazetteer, 1252 replicated databases, 2391 Hash functions, 1287–1288 Gene expression arrays, 1218–1220 Global features, 1379–1381 Hashing, 1093–1094, 1619–1622 Gene ontology, 1960–1962 Global positioning system (GPS), 1639 Hash join, 1026–1028, 1288–1289 Generalization, 989, 990, 1913, 2746–2747, Global recoding, 1912, 1913 Hash partitioning, 2025, 2026 3018 Global serializability, 926–928 Hash structures, 1433, 1434 Generalized ACID, 1091–1092 Global transaction, 1142 Healthcare, 292–293, 358, 359 Generalized search tree (GiST), 1222–1224 Google earth, 1854 Health insurance, 2140 Subject Index 3733

Health Insurance Portability and Human-based computation, 1324 Incremental maintenance of views with Accountability Act (HIPAA), 2364 Human-centered computing (HCC), aggregates, 1421–1424 Health level seven (HL7), 354 1323–1326 Incremental query computation, 1414, Health Level 7 (HL7) standards, 1558 Human expressions, 1880, 1881 1415, 1417 Heap, 1434 Human factors and ergonomics, Incremental view maintenance, 1414, Heavy hitters, 511, 513, 1305–1307 3247, 3248 1417, 3326 Heavy hitters on data streams, 1305 Human visualmeans, 1335 Independent parallelism, 1566 Heterogeneity, 1704–1706 H.26x, 3297, 3298, 3301, 3302 Index, 244–248, 2877, 2879, 2894 Heuristic microaggregation, 1736 Hypercube, 538–539 Index, B+-tree, 1433 Hidden markov models, 398 Hypergraph, 2043 Index creation and file structures, Hidden web, 784, 1466, 2519, 2520 Hyperlink analysis, 84 1425–1427 Hierarchical clustering, 380, 381 Hyperlink relevance, 3499 Indexed sequential access method Hierarchical data format (HDF), 1777 Hypertext, 268, 269, 941 (ISAM), 197 Hierarchical data model, 715 Hypertext interfaces, 3376–3378 Indexing (or Text indexing), 257, 258, Hierarchical data summarization (HDS), Hypertexts, 1331–1332 788–789, 1309–1313, 1437, 1448–1450, 1300–1304 Hypothesis generation, 3065, 3068 1458–1462, 1467–1471, 2643, 2646, Hierarchical deadlock detection, 900–902 HyTime, 3124 2680–2681 Hierarchical entity-relationship model, Indexing 1083–1091 I – granularity, 1468–1471 Hierarchical heavy hitters, 1304–1307 Icon, 1334 – data warehouses, 1454–1457 Hierarchical memory system, 1707, 1708 Iconic displays, 1335–1342 – schemes, 2109 Hierarchical model, 1295, 1298, 1299 Identification, 176–180 – units, 1467–1471 Hierarchical RBAC, 91–92 Identifier, 1735 Index intersection techniques, 517 Hierarchical relationship, 2606, 2608 Identity-based relationship, 1936 Index join, 1427–1428 Hierarchical storage management Identity disclosure, 848 Index-only execution plan, 516 (HSM), 1499 IDF weight, 1571 Index sequential access method Hierarchical task analysis (HTA), 1329 IDMS, 1901 (ISAM), 2681 Hierarchichal data, 836 Image, 1343–1348 Index structures, 1453 Hierarchy, 1308–1309 Image (of temporal granularity), 2970 Index structures for biological sequences, High availability, 2397–2402 Image acquisition, 1344–1345 1428–1432 High dimensional datasets, 838, 1309, Image annotation, 1358–1361 Index 1310, 1313 Image compression, 1375, 1378 – term, 3259–3262 High-dimensional feature vectors, 1806 Image content modeling, 1349–1353 – structures, 1453 High-dimensional indexing, 837, 2571, Image database, 1353–1361 – tuning, 1433–1435 3314, 3315 Image database schema, 1354–1355 Indices, 1454–1457 Higher-order entity-relationship, Image metadata, 1358–1360, 1362–1368 Indices for multi-dimensional points, 1083–1091 Image processing, 229, 230 2703–2704 High Performance Computing (HPC), Image processing and analysis, 1345, 1347 Individualism, 2136 2816, 2817, 2820 Image representation, 1345, 1348, Individually identifiable data, 1471–1472 Hilbert curve index (HCI), 75 1374–1379 Induction, 1256–1259 Hilbert’s spaces, 3260 Image retrieval, 85–88, 1384–1388 INEX, 1545, 1876–1879 Histogram intersection, 1380–1383 Image segmentation, 1370, 1373 Inference, 705–706, 1256–1259 Histograms, 1315–1318, 2898 Image similarity, 1379–1383 – control in databases, 1472 HITS, 3484, 3485 Immediate coupling, 34 – problem, 1789–1791 HL7 reference information model (RIM), Immediate view maintenance, 3326, 3327 INFO-D, 2210 349, 355, 1558 Implementation, 2893, 2895 Information Hold-out validation, 534 Implementation abstraction, 6, 7 – architecture, 1103, 1104, 1109 Homomorphic encryption schemes, 1320, Implicit event, 1404–1405 – browsing, 3376 2535–2537 Improving storage availability, 2798 – extraction, 233, 234, 397–400, Homomorphic property, 1320 IMS, 1294–1299 1476–1481, 1595–1600, 3472–3478, Homotopy, 2652, 2653 Inclusion dependencies, 1156–1158 3486, 3487, 3569 Horizontal partitioning, 599–600 Incomplete information, 1405–1410, 1876 – extraction function, 1649 Horizontal fragmentation, 892 Inconsistent databases, 452, 1410–1414 – filtering, 1481–1484 Horizontal partitioned data, 1321–1322, Incremental backup, 201 – foraging, 267, 1485–1490 3264, 3341 Incremental computation of transitive – hiding, 826, 829–830 Horizontal replication, 2409, 2411, 2412 closure, 1417 – integration techniques for scientific Huffman Coding, 1375, 1377, 3047, 3048 Incremental maintenance, 2549 data, 1496–1498 3734 Subject Index

– lifecycle, 2364 Instantaneous event, 143 Inverted index compression, 3052, 3054 – lifecycle management, 1499 Instant relation, 1045 Inverted list, 1571–1574 – loss, 2512, 2513 Integrated data store (IDS), 1901 Inverted list compression or inverted – losslessness, 1919 Integrated temporal reasoning file, 3052 – loss measures, 1499–1501 approaches, 2227 Invisible data mining, 597 – modeling, 1941, 1942 Integration across enterprises, 991 Invisible web, 2519 – navigation, 1501–1502 Integration of rules and ontologies, I/O computation, 1333 – network analysis, 595, 596 1546–1550 I/O model of computation, 1333–1334 – theoretic models, 1524, 1525 Integrity, 730–731 IP storage, 1574–1575 Information product (IP) approach, 1502, – and authenticity of a message, 1715 IR effectiveness, 849, 851 1503, 1505–1508, 1515, 1516 – constraints, 722–723, 1410–1412, IR evaluation metrics, 849, 853 Information product map (IP-MAP), 616, 1414, 2972–2986 IR relevance ranking algorithms, 3497 618–619 Intelligent disk, 37–38 ISAM file (a static tree), 3173 Information quality (IQ), 1502–1511 Intelligent storage systems, 38, 1551–1553 iSCSI, 2824–2826 – dimensions, 1503–1505, 1507, 1508 Interaction, 3366, 3368, 3369 iSCSI target, 1575 – managing information as a product, – between molecules, 220 ISO/IEC 11179, 1724–1727 1502–1508 – styles, 3529 Isolation property, 144 – measurement, 1512, 1514 Interactive analysis, 3343 Isomorphism, 2603–2604 – policy, 1515–1519 Interactive browsing, 377 ISO standard, 2754, 2755, 2759 Information queries, peer-to-peer, 111–113 Interactive graphics, 1866, 1869 Iterator, 1575–1576 Information retrieval (IR), 233–235, 266, Interactive integration, 1498 375–378, 849, 1016–1019, 1022–1024, Interactive layout, 3382 J 1519–1528, 1703, 2127–2129, 2377, 2875, Interactive query-driven analysis, 3388 Java application server, 104 3072, 3075, 3472, 3506–3508 Interactive retrieval, 1384, 1386, 1388 Java Database Connectivity (JDBC), 449 – operations, 1528–1530 Interactivity, 78 – connectivity, 1577 – system effectiveness, 1528 Interface, 955, 957, 1553–1557 Java enterprise edition (JEE), 1578–1579 Information retrieval systems, 962, Interface engines in healthcare, 1557–1560 Java metadata facility, annotation 1520, 1521 Interfunctional integration of business types, 1580 Information-seeking behavior, 1485 processes, 295 Java program elements, 1580 Information seeking process, 3410, Internal quality measure, 3046 J2EE, 1578 3411, 3413 Internet SCSI (iSCSI), 1574, 1575 JMS, 2210 Information theoretic models, 1524, 1525 Internet transactions, 3523 Join, 1580–1582, 2592–2595, 2673–2674, Information visualization, 2506 Interoperability, 1560–1564 3544–3545 Information visualization and visual Inter-operator Join dependency(ies)(JD), 1156–1158, analytics, 3388, 3390, 3392 – load balancing, 2269–2271 1581–1582, 1865 Informedia, 466, 469 – parallelism, 1566, 1982 Join index, 1582 Infrastructure independence, 812, 813 Interpolation-function, 2995 Join order, 1582–1583 Initial nodes in the event processing Interpolation-granularity, 2994, 2995 Join ordering, 2273, 2275–2277 network, 1059 Inter-query parallelism, 702, 1566–1567, Juke box, 2799 INitiative for the Evaluation of XML 2038–2040 retrieval (INEX), 1531–1537, 2191–2194, Interval encoding, 246 K 2197 Interval preservation, 2620, 2621 k-anonymity, key attribute, 1585 Initiator, 143, 1537–1538 Intra-operator KDD process, organisational scheme, 1586 In-memory – load balancing, 2269–2272 Kerberos, 2828 – buffers, 1800 – parallelism, 1567 e-Kernel, 1240, 1242 – DBMS, 1669 Intra-query parallelism, 1567–1568, Kernel estimation, 758 In-network 2038–2040, 3340, 3341 Key attribute, 1735 – indexing, 635–637 Intrinsic skew, 635 Key dependency, 1200 – processing, 884, 888, 889 Intrusion detection, 89–90, 1568–1570 Keyframe extraction, 3281, 3284 – processing of aggregates, 1540–1541 Invariance, 3362 Key range locking, 273–277 – storage, 635–637, 1757 Inverse distance weighting, 2737 k-fold cross-validation, 533, 534, 536 In-Network Query Processing, 1538–1542 Inverse Document Frequency (IDF), K-means, 1588, 1589 Insertion anomaly, 1918 1570–1571, 3937–3942 K-means clustering, 3045 Insertion-deletion technique, 1423 Inverse-rule algorithm, 2438, 2440, 2441 κ-Medoid, 1588, 1589, 2419, 2420, Instance-based learning, 1886–1888 Inverted file, 3058, 3059, 3061 2422, 2423 Instance-driven storage, 3628–3630 Inverted index, 1425–1427, 1571, k-nearest neighbor query (kNN), 1890 Instances of roles, 1245 3051–3055 K-nearest neighbors, 1371 Subject Index 3735

Knowledge, 356–359 Life science data management, 1960–1962, Logical database design: from conceptual to – acquisition, 1966 3519 logical schema, 1645–1649 – base, 3472 Life sciences, 1266–1271 Logical definition of relevance, 1652 – discovery, 3065 Lifespan, 98–99 Logical foundations of web data extraction, – management process, 297–298 – existence time, 1612 1649–1651 – representation, 1074, 2914, 2915, 2920 – valid time, 1612 Logical models of information retrieval, – representation languages, 799, 802, Lightweight ontologies, 1613–1619 1652–1657 2427 Linda, 495, 496 Logical observation identifiers names and Knowledge discovery in databases (KDD), Linear, 1619–1622 codes (LOINC), 364 3061–3065 Linear content, 1825 Logical organization of the content, 1658 Linear dimension reduction, 838–842 Logical schema, 708, 709, 1645–1649 L Linear hashing, disk-based, 1619 Logical storage, 2830 Label (of temporal granule), 2971 Linearizability, 1743 Logical Story Unit, 3303 Labeled graph, 1170–1172 Linear regression, 1622, 2044, 2045 Logical structure, 1658, 2376 Laboratory information management Linear regression analysis, 1622 Logical uncertainty principle, 1652, system, 1402 Linear speed-up, 2031, 2032 1653, 1656 Lamport-Diffie one-time signature Linguistic descriptions, 1214–1215 Logical unit number (LUN), 1658–1659 scheme, 1715 Link analysis, 3485 Logical unit number mapping, 1659 Language(s), 257–260, 3370–3373 Linking, 1623–1626 Logical volume (LV), 1659, 1660, 3438 Language model(s), 1090, 3058, 3069 Linking and brushing, 1623–1626 Logical volume manager (LVM), 1659–1660 Large scale scientific experiments, 2816 Links between document fragments, 1331 Logical WORM, 3570 Large-scale text retrieval, 3479 LinQ, 3606 Logic-based wrapping, 1649 Latch coupling, 273–277 List comprehension, 420–421 Logic programming, 2302, 2304 Latches, 273–275 List or file compression, 3051–3055 Logic programming language Prolog, 2011 Latent Semantic Indexing (LSI), 3076, 3078, Literature-based discovery and exploration, Log-linear regression, 1660 3260–3262 3065 Long-duration transaction, 2588–2589 Latin hypercube sampling, 2900 Load-balancing, 719–721, 1627–1632, 2637 Long-lived transaction, 493, 494 0–1 laws, 3683 Load balancing problems, 2269, 2271 Long-running processes (macroflows), 3166 Layer, 3018–3023 Load shedding, 54–56, 1632–1635 Long running simulation, 734, 737 Layered, 3012–3015 Local advertising, 1251, 1254, 1255 Loop, 1661 Layers of DBMS, 2179–2180 Local as View (LAV), 1492, 3332, 3333, 3336 Loose coupling, 1661–1662 L1 cache, 2195–2196 Local features, 1380, 1383 Lossless join, 1581 L2 cache, 2195–2196 Locality, 59, 1637–1638, 1713–1714 Low-power modes, 2822 Learning distance measures Locality-preserving mapping, 2675, 2679 LRU (least recently used), 283 – classification, 1601–1604 Local split decision tree (LSD-tree), – replacement, 278–280 – clustering, 1601–1604 2703–2704 LRU-K, 747 – nearest neighbor methods, 1603 Local storage, 635–637 LUN masking, 1659 – semi-supervised clustering, Local suppression, 1912, 1913 1604–1605 Location and time based RBAC (LoT- M – support vector machines, 1604 RBAC), 1245 MAC Learning environment, 1517 Location-based services (LBS), 2718 – for database, 1685 Learning from unbalanced data, 1664 – privacy, 1640 – functions, 1715 Learning to rank, 3481 Location – for networks, 1685 Least recently used (LRU), 1800 – predictions, 2695–2698 Machine learning, 262, 988–990 Leave-one-out cross-validation, 534 – transparency, 2416, 2417 – based IE, 1478 Legacy software, 2936, 2937, 2943 Locking granularity and lock types, – in computational biology, 1663–1667 Legacy system, 1299, 1901 1641–1642 – methods, 1885, 3041 Lexical analysis of documents, 1528 Lock manager, 445 Magnetic disk, 866–867 Lexical relations, 3036 LOC METS, 1636–1637 Magnitude table, 2908 Lexicographic information, 965 Log component, 1645 MAID disk, 1697 Library of Congress (LOC), 1636 Log data, 517, 519 Mainframe, 2511 – classification, 808 Logging, 1957 Main memory and cache optimization, Licensing and contracting issues in – methods, 519 128–129 databases – and recovery, 1643–1644 Maintenance of recursive views, 1674–1679 – contract, 1610–1612 Logging/recovery subsystem (LSR), Majority quorum system, 2314 – database license, 1610–1612 1644–1645 Management of physical and logical storage – license, 1610–1612 Logical connectives, 1928 resources, 2827 3736 Subject Index

Management policies, 134 Message, 1716 – transactions, 1743, 1747, 1748 Management virtualization, 812 – broker, 2212–2214 Minimal key, 1587, 1588 Managing compressed structured text, – router, 2209 Minimum bounding rectangle (MBR), 1679–1684 – translation, 1064 2453–2456 Mandatory access control (MAC) models, Message authentication code (MAC), 1287, Minimum confidence, 140 1684–1685, 2448, 2450 1288, 1715–1716 Minimum support, 140 MANET Databases, 1685–1690 Message-oriented middleware (MOM), Minkowski-form distance, 1381 Map operations, 2719–2724 47, 1716 Min-wise hashing, 2845 Mapper, 1706 Message systems, 1716 Mirrored disk, 2359 Mapping between the XML view and the Messaging queueing system, 719, 721 Mirroring, 1420 underlying data, 3656–3657 Meta-class, 2918 Misuse detection, 1569 Mappings, 1760–1763 Metadata, 215–222, 401, 939, 979, 980, MLS systems, 2540 MapQuest, 1232 1249–1251, 1362–1368, 1717–1721, Mobile ad-hoc sensor network (MANET), Margin, 262 1724–1727, 2497, 3286–3292 1685–1690 Markup language, 1696 – interchange, 401–404 Mobile data, 428, 429 Mashup, 1696–1697 – management, 215–219, 1718–1720 Mobile database, 1751 Massive array of Idle disks (MAID), 1697 – repository, 570, 571, 670–672, 674 Mobile devices, 1751 Massively parallel processor (MPP), 2638 – standards, 215–219, 673–674 Mobile e-Commerce transaction, 960 Master-slave replication, 1738 Metadata encoding and transmission Mobile interfaces, 1751–1754 Matching type, 1371, 1372, 2561–2566 standard (METS), 1636–1637 Mobile sensor network (MSN) data Materialization, 2117 Meta data interchange specification (MDIS) management, 1755–1759 Materialization of dynamically generated – interchange, 1717–1718 Modality, 1838, 1840–1842 HTML fragments, 3524 Metadata registry (MDR), 1724–1727 Model-based querying, 1764–1768 Materialized views, 1670–1673, 3324, 3325, Meta model, 1719, 1720 Modeling, 1777–1783 3328–3331, 3340 Meta object facility (MOF) Model management Materialized web views, 3524 – interchange, 1722–1723 – mappings, 1760–1763 Mathematical dimension reduction – metadata, 1722–1723 – meta data, 1760 technique, 1784 Metaphor, 3387–3388 – meta model, 1760–1763 Mathematical model of approximate Metasearch, 1730–1734 – schema integration, 1760–1762 reasoning, 120 Metasearch engines, 1730–1734 – schema matching, 1760–1762 Mathematical model of meaning, 1215 Metasearcher, 2520 Models of information foraging, 1485, 1489 Matrix masking, 1698 Method of concurrency control, 2672 Modification, 98–99 Maximal patterns, 1699–1702 Methods for video shot-cut detection, 3309 MOF, 1729 Maximal set of tuples, 92 Methods of data analysis, 2691 Momolingual dictionary, 966 Maximum distance to average vector Metric, 1734–1735 MonetDB, 1669 (MDAV), 1736 – index, 1439 Monitoring data streams, 492 MDS models, 1784 – space, 1451–1454, 1734–1735 Monolithic architecture, 3014, 3015 MDX, 1952, 1953 MGED ontology, 1960, 1962 Monotone constraints, 1769 Mean average precision (MAP), 192–193, Microaggregation, 1736 Mosaicplots, 1868, 1869 1691–1692 Microarchitecture optmizations, 129 MOST model, 1772, 1774 Meaning, 3051–3055 Microarray gene expression data, 107 Moving object(s), 1458–1462, 1770, 2682, Measure, 1703–1704, 2665–2666, 2779, 2780 Microbenchmark, 1737 2683, 2685 Mechanism for information hiding, 2789 Microdata, 1735 Moving Picture Expert Group (MPEG), Media content analysis, 429–431 – masking, 1474 3287, 3290–3292, 3297–3299, 3301, 3302 Media content annotation, 429, 430 – protection, 1473, 1474 Moving point, 1770, 1771, 1773–1775, Media (crash) recovery, 1644 – rounding, 1737–1738 2730–2731 Media production, 429–431 Middleware, 1705, 1706 Moving region, 1770, 1771, 1773, 1775, Mediation, 1704–1706 – systems, 2408, 2409 2730–2731 Mediator, 720, 1704–1706 – technologies, 501, 1899 MPEG–7, 1349–1353 Medical record, 968–970 Middleware support for database replication Multidimensional, 1950–1952 Membership degree, 1209–1210 and caching, 1738–1742 – cube, 538 Membership function, 1209 Middleware support for precise failure – data, 1776–1777, 2253–2254, 2679 Membership query, 1436, 1438, 1707 semantics – data formats, 1776–1777, 2024 Memory – consistency, 1743, 1746, 1747 – data warehouse, 664, 665 – hierarchy, 1707–1713 – failure(s), 1743–1748 – indexing scheme, 1279 – locality, 1713–1714 – linearizability, 1743 – information, 789 Mergepurge, 780 – serializability, 1743 – model, 2780, 3526, 3527 Subject Index 3737

– modeling, 1777–1783, 2024 Multi-pathing, 1659, 1843 Navigation, 941, 1928 – points, 2703–2704 Multi-pathing software, 1843 – space, 1501–1502 – range query, 2325 Multi-perception, 1844 – tasks, 1501, 1502 – temporal aggregation, 2925 Multiple class labels, 1885 Nearest neighbor classification, 1885–1889 Multidimensional scaling (MDS), 840, Multiple client-server architecture, 343 Nearest neighbor classifiers, 341 842, 1784 Multiple CQ scheduling, 2476 Nearest neighbor (NN) of a query Multigranulity locking, 1642 Multiple distance learning, 183 point, 1891 Multi-label classification, 1664 Multiple imputation, 2899 Nearest neighbor query, 1890 Multi-layered architecture, 1862–1864 Multiple versions of a database Nearest neighbor query in spatio-temporal Multi-level grid file, 1281 schema, 2499 databases, 1891–1894 Multi-level recovery, 1784–1788 Multi-processor cache (MPC) machine, 714 Negative Tuple, 3535, 3536 Multilevel secure database management Multiprocessor Negotiation based methods, 1688 systems (MLS/DBMS), 1789–1791 – database management, 2026–2029 Nested loop join, 1026, 1895 Multilevel secure (MLS) databases, – data placement, 2024–2026 Nested loop join using index, 1427, 1428 2540–2543 Multi-query optimization, 1849–1852, 3609 Nested transaction, 1222, 1896–1898 Multilevel secure relational data Multi-relational data mining, 596 Network attached secure device (NASD), model, 1791 Multi-representation, 1845–1847 1899–1900 Multilevel transaction protocols, 273, 274, Multi-resolution, 1853–1857 Network attached storage (NAS), 1900, 1792–1796 – models, 1853, 1857 2798–2800, 2824, 2826 Multi-master replication, 1738, 1740 – terrain modeling, 1853–1857 Network common data form Multimedia, 1825–1829 Multi-scale, 1844–1848 (NetCDF), 1777 – asset, 1825, 1826 Multi-step query processing, 1860–1862 Network data model, 715 – data, 1800–1804 Multi-stream query, 2475 Network distance, 2442–2446 – alphanumeric, 1798–1800 Multi target applications, 1753–1754 Network file system (NFS), 1900 – audio, 1797–1800 Multi-tier architecture, 1862–1864 Network formation and communication, – buffering, 1800–1804 Multivalued dependency (MVD), 1539 – querying, 1808–1814 1581, 1865 Network model, 1901, 1904, 1905 – storage, 1814–1817 Multi-version concurrency control, Network Voronoi, 2443, 2445 – video, 1797–1800 2659, 2660 Network with blocked I/O services, 2797 – database(s), 2244 Multi-version databases, 1870–1872 Neural networks, 1906–1909 – audio, 1818, 1819 Multi-version schedule, 1870, 1871 Neurons, 1906–1908 – image, 1818, 1819 Multi-version serializability, 502–504 Newspapers, 978–981 – video, 1818–1820 – and concurrency control, 1870–1872 NEXI, 1545, 1876–1879 – documents, 1821, 1824 Multi-version serialization graph (MVSG), NFS, 2824, 2826, 2827 – metadata, 1825–1829 2662 NiagaraCQ Project, 1634 – mining, 595, 596 Music metadata, 157–160 NIST text retrieval conference (TREC), – objects, 1830 1692 – presentation databases, 1829–1831 N Node in the edge of the event processing – presentations, 1829–1831 Naive Bayes, 207 network, 1058 – resource scheduling, 1832–1835 Naı¨ve document representation, 943–945 Node in the event processing network, 1052 – retrieval, 837 Naive tables, 1407–1410, 1875–1876 Noise addition, 1911 – systems, 1834 n-Ary relations, 2372 Noise tolerant support, 121–122 Multimedia data indexing National Institute of Standards and Non-blocking concurrency, 1010 – metric indexes, 1807 Technology (NIST), 2776 Non-clustering index, 1434, 2522 Multimedia information retrieval (MIR) Natural human-computer interface Non-confidential outcome attribute, 1735 model, 528–532, 1820–1824, 2566–2567, (NHCI), 1880–1884 Non-copyrightable data, 1611, 1612 2570 Natural interaction, 1880–1884 Non-linear content, 1825 Multimedia retrieval evaluation Natural interface systems, 1881–1883 Non-metric temporal constraints, 2225 – laboratory test, 1836 Natural join, 1581 Non-parametric data reduction – operational test, 1836 Natural language generation (NLG), 3048, (NDR), 2044 – precision, 1836, 1837 3049 Non-perturbative masking, 1474, – recall, 1836 Natural language information analysis 1912–1913 Multimodal, 1838–1843 method (NIAM), 1941–1946 Non-pipelineable operator, 2794 – interfaces, 958, 1838–1843 Natural language processing (NLP), 234, Non-profit trade association, 2815 – streams, 3304, 3305 1564, 3072, 3074, 3075 Non-redundant rules, 365–368 – systems, 1842 Navigating and searching in compressed Non-schematic integration, 1497 Multimodality based approaches, 3304 form, 1681 Nonsequenced, 1913–1915 3738 Subject Index

Non-standard database, 1860, 1861 Ontologies, 216–218, 222, 360, 1546–1550, P Nontemporal, 1914, 1915 1613–1619, 1960–1965, 2579–2582, 3472 Page-level recovery, 1785, 1786 Normal form, 1915–1920 – definition language, 1973, 1974, 1976 Page-oriented representation, 943, 945 Normalization, 709, 1010, 1917–1920, 2498 – elicitation, 1966–1971 PageRank, 3484, 3485 Normalized cut criterion, 2749 – engineering, 1965, 1972–1973 Page replacement policy, 286 Normalized schema, 2498 – life cycle, 1972 Panning, 3684–3686, 3688 Now relative, 1922–1924 – matching, 2561–2562, 2565 Parallel and distributed data warehouses, n-tier architecture, 1862–1864 – visual querying, 1973–1977 2012–2018 Null values, 1405–1408, 1876 OO7 Benchmark, 99 Parallel composition, 419, 420 Numerical fact, 1703–1704 Open Archives Inititiative, 2519 Parallel coordinate plots, 1866, 1867, 1869 Open database connectivity (ODBC), 449 Parallel coordinates, 2018–2023 O Open EHR reference information Parallel databases, 2264–2268 OAI, 2520, 2521 model, 349 Parallel database systems, 2036 OAI-PMH, 2520 Open nested transaction, 1792–1796, Parallel data warehouse, 2012–2018 OAIS model, 132 1978–1980 Parallel DBMS, 2638 OASIS, 1927 Operator failures, 100 Parallel hash join, 2029–2030 Object constraint language (OCL), 1729, Operator-level parallelism, 1981–1985 Parallel join algorithms, 2029–2030 1927–1928 Opinion mining, 1986–1990 Parallel merge join, 2029–2030 Object database (ODB), 1929–1935 Optical storage, 2798, 2799 Parallel nested loops join, 2029–2030 Object data model(s), 411, 1936 Optimal foraging theory, 1485, 1487 Parallel query execution algorithms, Object identification, 2556, 2557 Optimal join order, 1583 2030–2035, 2268 Object identifier, 1935–1936 Optimal location, 2419–2943 Parallel query optimization, 2035–2037 Object Modeling Technique (OMT), 3232 Optimal microaggregation, 1736 Parallel query processing, 2038–2040 Object-model transactions, 1792–1796 Optimal partitioning, 388 Parallel SCSI, 2824–2826 Object-oriented database (OODB), Optimal sequenced route (OSR) query, Parallel versions of the traditional serial join 1929–1933, 2771, 2772 2443–2444 algorithms, 2029 Object-oriented encapsulation, 105 Optimistic concurrency control (OCC), Parametric data reduction (PDR) Object-oriented programming languages, 2391, 3148, 3149 techniques, 2044–2045 1553–1555 Optimistic replication, 1991–1995 Parents, 1308–1309 Object query language (OQL), 2003–2004 Optimization, 47, 2550, 2552–2553 Partially ordered graph, 1044 Object recognition, 1936–1939 – of multiple queries, 1849 Partially ordered set of events, 1034 Object-relational database (ORDB), – problems, 790–793 Partial order, 1187–1190 1929–1931, 1933, 1934, 2293–2296 – techniques for OQL, 2003 Partial replication, 188–192, 2045–2046 Object-role modeling (ORM), 1941–1946 – and tuning in data warehouses, Participatory design, 1329 Object storage device (OSD), 1552 1995–2002 Partitional Clustering, 933, 934 Observation, 359–360 OQL expressions, 2003 Partition-based spatial merge join, 2710 Observe-predict-react, 2552 Oracle, 3162 Partitioning, 2030–2035 ODYSSEY, 3132 Oracle DBMS, 3120 Partition skew, 635 Office automation, 997 Orchestration, 2004–2005 Passage retrieval, 2867, 2868 Office information systems, 290 Order relation, 1063 Passive standby, 1110–1114 Offline View Maintenance, 3327 Order statistics of data, 2235 Password-based authentication, 177–179 OIL, 2008 Organizational links, 941 Pathfinder, 3671–3673, 3675 Okapi BM25, 255 Organizational theory, 1661 Path index, 2857, 3586, 3588–3590 OMG data dissemination service, 2210 Orientation and directional relationships, Patient registry, 346, 348 On-chip parallelism, 129–131 305–308 PATRICIA tree One-copy serializability, 1947–1948, 2397 OR-join, 2006 Pattern based clustering, 2873–2874 One-pass algorithm, 1948–1949 OR-split, 2006, 2752 Pattern detection, 1046–1048 Online algorithms, 741–744 OSQL data model, 2007 Pattern matching based IE, 1477–1478 Online analytic(al) processing (OLAP) Outer join, 1581, 1670–1673 Pattern relaxation, 3638 databases, 539, 594, 1949–1953, Outlier detection, 88–90 Patterns as queries, 2433 2297, 2298, 2300, 2755, 2758, Out-Of-Vocabulary (OOV), 523 Patterns of events, 1035 2880, 2883 Overflow, Hash-key, 1289–1290 Pattern types, 1046, 1047 Online communities, 2667 Overlap, 2187–2191 Peer data management system, 2863 Online recovery, 1954–1959 Overlay networks, 2008, 2056–2060, 2081, Peers, 2081, 2082 On-line transaction processing (OLTP), 2576–2579 Peer-to-peer (P2P), 2061–2064, 2415, 2578, 2297–2299 Ownership and transfer of copyright, 2863–2866 Online View Maintenance, 3327–3328 497–498 – computing paradigm, 2066, 2082 Subject Index 3739

– data integration, 2056, 2065–2069 Pixel-oriented visualization techniques, Privacy, 91, 1472, 2136–2137, 2140, 2142, – storage systems, 2060, 2075–2077, 789–794, 3355 2783, 2784, 2788, 2789 2080–2082 Pixels, 1116 Privacy-enhancing technologies (PETs), – systems, 875, 876, 2008, 3241–3243 Point-in-time copy (PiT copy), 2118–2119 2142–2147 – transaction, 3241–3243 Point-To-Point mediation, 1706 Privacy metrics, 2137–2139 – web search, 2082–2085 Polytransaction(s), 2123–2124 Privacy policy, 2140–2142 Perception, 3395–3399 POLYVRT, 3134–3135 Privacy-preserving data mining, 2147–2150, Perception-based logic deduction, 120 Portability and accountability act, 2140 2535, 2537 Perceptual similarity, 1116 Portals, 1696–1697 Privacy-related legislative provisions, 601 Performance differences, 194 Position snapping, 1692–1695 Proactive functionality, 1052 Performance enhancing technique, 2116 Positive relational algebra, 2124–2125 Probabilistic counting with stochastic Performance monitoring tools, 2093–2094 Possible answers averaging (PCSA), 1145 Periodic events, 3004, 3007 – certain answers, 2125 Probabilistic data, 2150–2155 Period-stamped temporal models, – conditional tables, 2125 Probabilistic databases, 3227, 3230, 3478 2094–2098 – incomplete information, 2125 Probabilistic disclosure risk, 2513 Permission-role assignment (PRA97) – naive tables, 2125 Probabilistic inference, 152 model, 57 – null values, 2125 Probabilistic latent semantic indexing, Persistent stored modules (PSM), 2755, Possible worlds, 2151–2153 3076, 3078 2759 Post-competition analysis, 194 Probabilistic model(s), 1524, 1527, 1764, Persistent uniform resource locator Post-randomization method (PRAM), 2126 1765, 1808, 1813, 3058 (PURL), 2429 Post-triggers, 738 Probabilistic range query (PRQ), 2161, 2162 Personal autonomy, 2136 Power modes of modern disk drives, 868 Probabilistic record linkage, 2353 Personal digital assistants (PDAs), Power of first-order (FO) logic, Probabilistic retrieval, 2649–2650 1751–1753 1081–1083 Probabilistic retrieval models, 1130, Personal information protection and Power-of-two choices, 1627 2156–2160 electronic documents act (PIPEDA), 2140 Powerset of items, 2876 Probabilistic spatial query, 2160–2164 Personalization, 981, 2100–2102 Practical schema versioning, 2500 Probabilistic spatio-temporal Personalized user interfaces, 46–47 PRAM Matrix, 2126 reasoning, 2168 Personalized web search, 2099–2103 Precedes relation, 1035 Probabilistic temporal databases, 2165–2168 Perturbative masking, 1474 Precision, 192–193, 981–982, 1522, Probability driven caching (PDC), 3502 Petri nets, 3551 2126–2127, 2348, 2386, 2776–2778 Probability ranking principle, 2168–2169 – concurrency, 2104 Precision-oriented effectiveness measures Probe phase, 1288, 1289 – firing rule, 2104, 2105, 2107 – evaluation, 2128, 2129 Process definition, 3545 – places, 2104, 2105 – precision-oriented evaluation, Process evolution in workflow management – transitions, 2104–2107 193, 266, 1703, 2128, 2129, systems, 3540, 3541 – workflow management, 2104, 2107 2453, 2876 Processing of continuous data streams, 2847 P/FDM, 2011–2012 Precision-recall, 1016, 1022 Processing of queries, 1529 PFL, 1201, 1203, 1204 Precision-recall curve, 981–982 Process life cycle, 2170–2171 Pharmacogenomics, 1403 Predicate window, 3533, 3535–3536 Process manager, 755 2 Phase commit (2PC), 3164–3166 Predictive approach, 279–281 Process mining, 3551 Physical clock, 2108 Preimage resistance property, 1287 – conformance checking, 2172 Physical database design for relational Pre-processing of text, 1529 – event logs, 2171, 2172 databases, 2108–2113 Present, 1920, 1921, 1923 – process discovery, 2172 Physical data independence, 3340 Presentation Process optimization Physical layer tuning, 2114–2115 – layer, 2511 – business processes, 2173–2177 Physical operators, 1024, 1025, 1575, 1576 – techniques, 654, 655 – quality of service, 2173, 2177 Physical placement of data, 2135 Presenting structured text retrieval results – web service composition, 2173–2177 Physical schema, 708, 709 – result presentation, 2130 – workflow, 2173, 2177 Physical storage devices, 2830 – retrieval task, 2130–2134 Process-oriented models, 616, 618–619 Physical volume, 3438 Pre-triggers, 738 Processor-per-disk (PPD) machine, 714 Physical WORM, 3570 Primary (clustering) index, 2523 Process structure of a DBMS, 2178–2186 Pipeline, 2116–2117 Primary index, 2135 Production workflows, 3548 Pipelined parallelism, 1566 Primary key, 1587, 2756, 2758, 2759 Programming in the large, 288 Pipelined query execution, 1025 Primary memory, 1668–1669 Projected clustering, 2873–2875 Pipeline stage(s), 2116 Primitive event, 1045 Project indices, 1454–1456 Pipelining, 2031–2033, 2035, 2116, 2117 Principal component analysis (PCA), Projection, 2196–2197, 2737 Pivoted normalization, 940–941 838, 2136 Proof system, 1140, 1141 3740 Subject Index

Proof-theoretic approach, 752 Quasi-identifier, 1735 Querying semi-structured data, Propagation, 64, 65, 70 Quasi serializability, 504–505 2867–2868 Propagation-based structured text retrieval, QUEL Querying temporal indeterminacy, 2975 2197–2201 – relational database query Query-language model, 1522 Propositional logic, 1140 language, 2244 Query languages, 1–5, 406–411, 710–713, Protection of the database right, 1014 – tuple relational calculus language, 2244 1877, 1879, 2047–2057, 2762–2768, Protein-protein interaction graph, 220 Query, 368–373 2771–2772, 2958, 3659, 3660 Provenance, 2202, 2827, 2829 – camouflage, 1473, 1474 – data manipulation statements, 2261 – of an output data, 2202 – capability, 2309 – and evaluation techniques for – of scientific databases, 2202–2206 – compiler, 2288, 2290 biological sequence data p-Sensitive k-anonymity, 1585 – concept learning, 2567–2568 – biological sequence data, Pseudonymity, 2142, 2143, 2207 – containment, 2249–2252 2261–2264 Pseudonyms, 2207 – aggregation, 61–62 – sequence similarity, 2262 Pseudo-relevance feedback, 2382 – and equivalence, 93 – for the life sciences p-stable distributions, 2843–2845 – equivalence, 2249–2251 – scientific objects, 2264, 2267 Publication data model, 464, 465 – execution engine, 2117, 2282 – a scientific query language, Publication-event processing with complex – expansion, 3492 2264, 2266 predicates, 2070, 2071 – automated query expansion – specialized programming Public-key cryptography, 142 (AOE), 2258–2259 language, 2261 Public-key encryption, 142, 572, 573, 1320, – blind feedback (BF), 2256 Query processing, 113–119, 912–916, 2535–2536 – manual query expansion, 2258 1572–1574, 2278–2280, 2288–2293, Publish/subscribe, 464–466, 2208–2211, – pseudo-relevance feedback, 2301–2306, 2675–2680 2780–2782, 2871, 2872, 3608–3612, 3634 2255–2257 Query processing and optimization in – message broker, 2209 – relevance feedback (RF), object relational databases – over streams, 2211–2215 2254–2257 – four phases of query processing, 2294 – expressiveness – object relational databases, Q – aggregation, 59–63 2293–2296 Quadtrees, 1300–1302, 1304, 2219–2224, – footprint, 1253, 1254 – query execution plan (QEP), 2703–2706 – generation models, 2169 2293, 2294 Qualitative data, 3416 – graph, 2290, 2291 Query processing in data warehouses Qualitative relations between time intervals, – heterogeneity, 2309–2311 – materialized views, 2298, 2299 78–79 – language for relations, 2372 – multi-query optimization, 2299 Qualitative spatial relationships (QSR), 306 – load balancing in parallel database Query processor Qualitative temporal reasoning, 2225–2228 systems, 2264–2268 – query executor, 2307, 2308 Qualitative temporal relationship, 2377 – minimization, 2251 – query parser, 2307 Quality and trust of information content – optimization, 2272–2281, 2304, 2900, – query rewriter, 2307, 2308 and credentialing 2902, 2905 Query rewriting, 2273, 2438, 2440, 2441, – accuracy, 2229 – optimizer, 1583 3491–3493 – completeness, 2229 – parallelism, 1567–1568 – the goal of query rewriting, 2308 – credentialing, 2229 – perturbation, 1473 – query rewriter, 2308 – transparency, 2229 – plan, 2282 – responsibilities of the query Quality metrics, 2230 – plan explainer, 2093 rewriter, 2308 Quality of data, 803–807 – reconciliation, 2310 Query term frequency (qtf), 2169 Quality of retrieval results, 3493 – restriction, 1473, 1474 Question answering (QA), 3485–3490 Quality of schema, 804, 806, 807 – routing tree, 1757 Queues, 1716 Quantification of variables, 1140 – shipping, 2864–2866 Quilt, 3637 Quantiles, 513 – translation, 523–526, 2309–2312 Quorum system, 2313–2317 Quantiles on streams, 2235–2239 – over data streams, 3533, 3536 Quantitative association rules Queryable database protection, 1472–1473 R – distributional rules, 2240, 2242 Query-by-example, 1451 RAID (Redundant array of inexpensive – frequent rules, 2240, 2241 Query by image context (QBIC) disks), 2823, 2824, 3438 – special type of association rules, 2240 system, 1354 Random access memory (RAM), 1668–1669 Quantitative data, 2024, 3437–3438 Query-dependent hyperlink features, 3499 Randomization methods to ensure data Quantitative techniques, 1080 Query-document matching functions, privacy Quantitative temporal relationship, 2377 1519, 1523 – input randomization techniques, 2320 Quantum mechanics, 3260 Query execution plan (QEP), 506, 2293, – local randomization techniques, Quasi-copy, 3454 2294, 2595, 2598 2319, 2320 Subject Index 3741

– output randomization techniques, Registry metamodel, 1725–1726 Repository, 356–359 2320 Regression coefficients, 1622 Representation information, 132 – privacy preserving randomization Regression tree, 2469 Representation of medical evidence, 1072 method, 2319 Regular expression, 1264–1265 Reputation, 2414–2415 Randomized algorithms, 2770–2771 Regular square grids (RSGs), 817, 818 Reservoir sampling, 2467, 2838–2841 Randomized summary, 80 Relational algebra, 308, 811, 2124–2125, Residuated lattice, 2418–2419 Range partitioning, 2025, 2026 2196, 2369–2370, 2547, 3239, 3240 Resolution, 1374, 1375, 1378 Range predicate, 1427 Relational-algebra incremental algorithms, Resource Range query, 1437, 1438, 2324–2325 1415, 1416 – allocation, 2419–2423 Ranked XML processing, 2325–2331 Relational calculus, 2370–2371 – classification, 217 Ranking, 2647–2651 Relational calculus and algebra, 406, 407 – composition, 221, 222 Ranking function, 255 Relational database, 265–266 Resource description framework (RDF), Ranking model, 1371–1373 Relational database scheme, 265–266 2423–2425 Rank swapping, 620–621 Relational data model, 715, 2753, 2754, 2759 Resource discovery, 218 Rapid serial visual presentation (RSVP), 267 Relational expression, 2967 Resource patterns, 3557, 3558 Raw storage, 2796–2797 Relational Interval Tree (RI-tree), 3256 Respondent privacy, 1472 Rayleigh quotient, 2750, 2751 Relational model, 2372–2375 Restore, 200–201 RBAC96, 2448–2451 Relational operator, 1575, 1576, 2282 Restriction on free variables, 3016 RBAC models, 1245 Relational query processor, 755 Resubstitution validation, 534 RDF, 1724, 2425–2428, 2579 Relational storage for XML Result presentation, 3506 RDF graph, 2424 documents, 3631 Retrieval of multiple streams RDFS, 2425–2428 Relation detection and recognition, 1477 – on multiple disks, 486–487 RDF schema, 2424 Relationship type, 1915–1917, 1940–1941 – on a single disk, 486 Read/write model, 3158–3161 Relative atomicity, 2627, 2630–2631 Retrieval of single stream Real-time analytics, 25 Relative error, 83 – on multiple disks, 485–486 Real-time applications, 2344, 2347 Relaxed atomicity or extended atomicity, – on a single disk, 485 Real-time data warehousing, 21–26 145 Retrieval process, 1528, 1529 Real-time transaction processing, Relax NG, 3650–3652 Retrieval status value (RSV), 1521 2344–2348 Relevance, 1652–1656, 2648–2650 Retrieval techniques for handwritten Recall, 981–982, 1522, 2126–2127, 2348, Relevance dimension, 2747, 2748 data, 973 2776–2778 Relevance feedback, 1384–1388, 2378–2382, Retrospective context, 2431–2432 Receiver anonymity, 91 3493–3497 Retrospective event processing, 2431–2433 Reconciliation, 1991–1995 Relevance propagation method, 2197 Reverse engineering, 723–728 Record extraction, 397–400 Relevance score of an element, 2197, Reverse engineering tools, 727–728 Record linkage, 2353–2354 2199–2201 Rewriting queries using views, 2438–2441 Record matching, 780–784, 2354–2357 Reliability, 350 Rewritings, 93–97 Records management, 997 Relicated databases, 1947 Rhetorical relationships, 1331 Record trail, 608 Relicated history (RH), 1947, 1948 Road networks, 1692–1695, 2442–2446 Recover data from backups, 478 Remote invocation, 2415 Robertson and Sparck-Jones (RSJ) model, Recovery, 917–919, 3150, 3151 Renaming, 811, 3239, 3240 2169 Recovery component, 1645 Repair, 722–723 Rocchio’s formula, 2447 Recovery manager, 1645 Replacement policy, 283–285 Rocchio’s relevance feedback Recovery point objective (RPO), 848 Replica control, 626–628, 1947, 1948, 1957, algorithm, 2447 Recursive query(ies), 2304, 2758 1958, 2383–2387, 3144–3147 Role, 46 Recursive view definition, 1674–1676 Replica control component of the replicated Role based access control (RBAC), 91–92, Reducer and full reducer, 2596–2597 system, 2391 2447–2452 Redundancy, 2075–2081 Replica placement, 3443 Role hierarchy, 2448–2450 Redundant arrays of independent disks Replicated database concurrency control, Role schema, 1245 (RAID), 2359 2390–2391 Root, children, 1308 Reference information model (RIM), 360 Replicated databases, 2390–2391 Rough set theory (RST), 761–764 Reference knowledge, 2360 Replicated MDS, 1784 Rounding, 1737–1738 Reference knowledge base, 2360 Replication, 1071, 1991–1995, 2045–2046, Rounding set, 1737 Reference monitor, 9, 10 2391–2392, 2397–2402 Round-robin partitioning, 2025 Reference reconciliation, 780 – for high availability, 2397–2402 Routing vehicle in event processing Referential transparency, 1201 – in multi-tier architectures, 2408–2413 network, 1034 Region, 2360–2363 – for performance, 3442 ROWA, 928 Region growing, 1389, 1390, 1392, 1394 – techniques, 2392 Row-level triggers, 738 3742 Subject Index

R-precision, 195 – matching, 1760–1762, 1973, Security, 728–732 RSA, 832, 833 2494–2497, 2562 – in data sources, 676–677 R-tree joins, 2709 – tuning, 2497–2499versioning, – in data warehouse modeling, 677–678 R-trees, 241, 368–373, 1439–1441, 1891, 2499–2502 – in extraction-transformation-loading 1893, 1894, 2453–2459, 2703–2705, 2707 Schema-driven storage, 3630 (ETL) processes, 677 Rule action execution, 959 Schema evolution, 2479–2481 – mechanisms, 728, 731, 732 Rule based data grids, 134 – in workflow management systems, – in OLAP tools, 678–679 Rule-based information extraction, 3474 3540, 3541 Security requirement in secure data Rule-based optimizer, 1996 Schema mapping, 1492–1494, 2481–2493 outsourcing, 2524–2525, 2528 Rule evaluation, 29–32 – semantics, 2482 Security services, 2546–2547 Rule induction, 2459–2461 – types, 2483–2487 Security services (No. 1481), 2546–2547 Rule ranking, 2459–2461 Science application, 748–750 Segmentation, 1389–1395 Russian calendric system, 305 Scientific data, 2506, 3225–3227, 3230 Selection, 2547 Scientific databases, 2202–2206, 2339, Selective dissemination of information S 2502–2505 (SDI), 1482 Safe plan, 2154, 2155 Scientific query, 2264 Selectivity, 2739–2741 Safe query, 2151–2153, 2463 Scientific query language, 2264, 2266 Selectivity estimation, 2548, 2739–2741 Safety and Domain Independence, Scientific simulations, 733–738 Self describing, 2607 2463–2466 Scientific workflows, 2507–2510 Self-describing data, 1265 Saga(s), 1222, 1979, 2466–2467, 2824, 2826 Scientific workflow tasks, 2507 Self-monitoring, 2552, 2554 – compensation, 2466 Scope of rights, 1014 Self-organizing map (SOM), 3356 – transaction, 2466–2467 Scraper (-ing), 2511 Self-tuning histograms, 743 Sample and count, 2839 SCSI, 2512 Semantic(s), 132, 2576–2579, 3017 Sampling, 630–633, 1912, 2467 – block level protocol, 1538 – atomicity, 2588–2590 – methods, 631–632 – bus cables, 2812 – data models, 1193, 1194, 1197, – with replacement, 263 – initiators, 1537, 1538 2559–2561 – synopsis, 631–633 – interfaces, 846 – dimensions, 473 SAN File System, 2467–2468 – protocol, 1537, 1658 – distributed system, 982 SAN islands, 1575 – storage devices, 846 – gap, 3361 SAN management in multi-vendor SD-Rtree, 921, 923, 924 – heterogeneity, 1496–1497, 2561 environments, 2806 Searchable compressed format, 1442, 1447 – indexing, 429–431 Sarbanes-Oxley Act, 2364 Search advertising, 3458 – information processing (SIP), 1821 SAS, 2824–2826 Search algorithms, 739–741 – integration, 2557–2558 SATA, 2824–2826 Search engine metric, 2513–2518 – labels, 149 Satisfiability problem, 1397, 1398 – BLEU score, 2514 – map, 3124 SAX/DOM, 3598–3600 – precision, 2514–2518 – matching, 2561–2566 SBQL, 2771–2772 – recall, 2513–2517 – model, 2559–2561 SCA assembly model, 2632 – TREC, 2514, 2516–2518 Semantic/syntactic information, 939 SCA component, 2632 Search engines, 1251–1254, 1463–1466, Semantic web, 1546, 1547, 1550, 2579–2587, Scalability, 133, 2045, 2403–2407 2513–2518, 3462, 3464 3076–3079, 3472 Scalable Decision Tree Construction, Search engine selection, 1730–1732, 1734 – approach, 2580 classification, 2469–2473 Search space, 739, 740 – query languages, 2583–2586 Scale-out, 2403–2407 Search tasks, 3480 Semantic web services (SWS), 2586–2587, Scale-up, 2031, 2032 Secondary index, 2522–2528 3513–3519 Scatterplots, 1335, 1338 Secondary storage, 1707 Semi-automated web data extraction Scene(s), 3309, 3311 Second chance (replacement policy), 283 tools, 1283 – boundary detection, 3311–3313 Second normal form (2NF), 2522 Semijoin, 904, 906, 1581, 2592–2595 – detection, 3303–3308 Second principal component, 2136 Semijoin program, 2595–2598 – grouping, 3281–3284 Secret-key encryption, 572, 2897 Semiology, 1335 Scheduling, 719–721 Secure database development, 2528–2534 Semiotics, 1334 Scheduling Strategies for Data Stream Secure database development using Semi-streaming model, 1271–1274 Processing, 2475–2479 patterns, 2530–2531 Semi-structured, 1915, 2599–2600 Schema, 1940–1941, 2494–2497 Secure data outsourcing, 2523–2528 – data, 1198–1200, 2601–2610 – changes, 2479, 2480 Secure multiparty computation (SMC), – query language (No. 339) – integration, 1760–1762, 2494, 2497 2148, 2149, 2535–2539 – searching, 1876, 2191, 2192 – manipulation statement, 2831 Secure transaction processing, 1789, 1791, – text retrieval, 463, 2187 – mapping, 2494, 2497 2540–2545 Semi-supervised clustering, 393–396, 2613 Subject Index 3743

Semi-supervised learning, 393, 2613–2615 Shot(s), 3308–3311, 3316–3320 Sort-Merge join, 1026, 1027, 2673–2674 Sender anonymity, 91 – boundary detection, 467 Source-to-target dependency, 576 Sender pseudonymity, 2207 – detection, 3281, 3282 Space-filling curves (SFC), 2674–2680 Sensor databases, 107–110 Side-effect free translation of view update, Space partitioning index, 1439, 1440 Sensor data model, 489–490 2639, 2641 Spam detection, 3520–3523 Sensor network indexing, 636–637 Side-effect-free view updates, 2639–2642 Sparse index, 1433, 1434 Sensor networks, 574, 710–713, 1538–1540, Side-effects, 2639–2642 Spatial, 2725–2729 1542, 2278–2281, 2616–2619 Signal detection theory, 2349 – access method, 368, 373, 2454, 2459 – aggregation, 552–556 Signatures, 2642–2646 – anonymity, 2685–2690 – approximation, 554–556 Signature unblinding, 252 – data, 3132 – continuous queries, 553, 555, 556 SilkRoute, 3614, 3615 – data analysis, 2691–2695 – model-based querying Similarity, 1451, 1452, 2647–2651 – databases, 71–77, 368, 369, 372, 373, – storage, 635–637 – function, 699 1639, 2459 Sensor selection, 583 – search, 3115–3118 – data management system (SDMS), Sensory gap, 1115, 1116, Simple metadata model, 947 3684, 3685 3361–3363 Simplicial complex, 2651–2656 – data mining, 2691, 2692, 2695–2698 Sentence segmentation, 3072, 3073 Simulation, 3525–3528, 3551 – data structures, 2219–2224 Sentiment analysis, 1986–1990 Single client-server architecture, 342 – data type, 2681–2683, 2685, 2698–2702 SEQUEL, 2753, 2754, 2760 Single instruction multiple data (SIMD) – extenders, 3142 Sequence database, 2621–2623 instructions, 129 – hash joins, 2710 Sequence matching, 837, 3315 Single-link clustering, 3045 – histogram, 2740 Sequenced, 2619–2621 Single query optimization, 1849 – hotspots, 2695, 2696, 2698 Sequential composition, 419, 420 Single-site illusion, 451 – indexing, 2224 Sequential I/O, 1333 Single stream query, 2475, 2476 – indexing techniques, 2702–2707 Sequential pattern and sequential Singular value decomposition (SVD), 2045, – join, 2707–2714 association rules, 140 2657–2658 – join methods, 2708 Serializability, 1642, 2383, 2385, 2591, Situational applications, 593 – k-anonymity (SKA), 2686–2688, 2690 2626–2631, 2761, 2762 Situation reinforcement, 2431, 2432 – locality, 1713–1714 – theory, 927–928 Sketch, 511–515, 2898, 2899 – monitoring method, 479 – graph, 1947, 1948 Sketching, 89 – network, 2698 Server-side scripting languages, 954 Skewed distribution, 634 – network databases, 2714–2719 Service component architecture (SCA), Sliding versus predicate windows, 3533 – objects, 2719, 2720, 3140, 3141 2632–2633 Sliding windows, 137, 138, 2845–2846 – operation(s), 2699–2701, 2719–2724 Service composition, 1697 SMI-S (Storage Management Initiative- – outliers, 2695, 2696, 2698 Service consumers, 2634, 2635 Specification), 1552 – partition, 2699–2701 Service oriented architecture (SOAs), Snake model, 1390–1393 – pattern families, 2695 328–329, 414, 997–999, 2004, Snapshot(s), 2383, 2385, 3328 – projection, 2737 2633–2636 – isolation, 2383, 2385 – queries, 3383, 3386 Service outsourcing, 2523 – reducibility, 2621, 2983 – range query, 2325 Service producers, 2634, 2635 Snippet, 2664–2665 – SQL, 3142, 3143 Session beans, 1579 SOAP (Simple Object Access Protocol), – and spatio-temporal data models, Session consistency, 2636 2666–2667, 3572 2681–2685 Session property, 2856, 3452, 3453 – messages, 2666–2667 – uncertainty model, 2161, 2162 Set abstraction, 420–421 – specification, 2666 Spatio-temporal, 2725–2730, 2736–2738 SGML, 3124 SOA systems, 2634–2636 – benchmarking, 2339–2343 Shared-disk, 2637 Social applications, 2667 – data, 421–429 – architecture, 2028, 2637 Social network analysis (SNA), 2668, 2669, – database(s)1448–1450, 1462 – file system, 2467, 2468 2672 – data generator, 2339–2343 Shared-memory, 2638 Social networks, 2415, 2667–2672 – data mining, 595 Shared-memory architecture, 2028, Social tagging, 1522 – data type(s), 1770–1773, 2682, 2683, 2638–2639 Soft hardware failures, 100 2730–2731 Shared nothing partitioning, 2109, 2112 Software layer within a database – graph, 3097 Ship whole, 904–907 management system, 2807 – networks, 3097, 3098 Short-range wireless communication Software measurement, 2232 – predicate, 2684, 2685 protocols, 1751 Software non-determinism, 100 – test datasets, 2340, 2342 Short running processes (microflows), 3166 Software transactional memory (STM), Spatio-temporal distance join query Shot-cut detection, 3309–3311 2672–2673 (STDJQ), 2740, 2741 3744 Subject Index

Spatio-temporal trajectories, 2742–2746 Static dynamic caching (SDC), 3502 STORM, 2782 – moving point, 2742, 2743, 2746 Static random access memory Story identification, 3281, 3283, 3285 – moving region, 2742 (SRAM), 1669 Streambased versus operation-based Spatiotemporal window query (STWQ), Stationary MSN, 1756 windows, 3533 2739–2740 Statistical database, 2467 Stream ciphers, 572 SPC algebra, 449 Statistical data management, 2782 Stream fault-tolerance, 1109–1114 SPCU-algebra, 2124–2125 Statistical disclosure control (SDC), 1472, Stream high availability, 1109–1114 Special case of range query, 1707 1473, 2357 Stream incremental evaluation, 3533 Specialization, 2746–2747, 3017 Statistical disclosure limitation, 1698 Streaming algorithm, 1948–1949 Specificity, 2747–2748 Statistical disclosure limitation for data Streaming applications, 2847–2848 Spectral feature, 161 access, 2783–2789 Stream mining, algorithms, 2831–2833 Speed-up, 2031, 2032, 2035 Statistical estimation, 634 Stream-oriented Query Languages and Spider, 1418 Statistical method, 263 Operators, 2848–2853 SPJRU-algebra, 2124–2125 Statistical test, 318–321 Stream-oriented representation, 943–944 Split Statistics, 236–238 Stream processing, 1633, 1635, 2837–2838 – attribute and split point selection, Statistics databases, 2333 Stream processing enginer (SPE), 639–641 767–768 Steganographic techniques, 2789 STREAM project, 1634 – mirror, 2118 Steganography, 826, 2789–2790 Stream query language, 2849 – policies, 2456 Steganography vs. watermarking, 2789 Stream query processing, 3533, – transaction, 2752uˆ2753 Stemming, 1610, 2790–2793, 3492–3493 3536, 3537 Spoiler, 963 Stop-&-Go operator, 2794 Stream replication, 1110, 1113, 1114 SQL, 2753–2760, 2762–2768, 3018–3023 Stoplists, 2794–2796 Stream scheduling (session scheduling), SQL isolation levels, 2761–2762 Stopwords, 2794, 2795 1832–1834 SQL standard, 1925 Storage access model, 2796–2797 5S (Streams, Structures, Scenarios, Spaces, SQL/temporal, 3192, 3193, 3197 Storage and management, 344–348 and Societies) framework, 268 SQL/XML, 3606, 3614, 3615 Storage area network (SAN), 2467–2468, String similarity, 2355, 2357 SQuery languages, 2583–2586 2797–2798 Structural relationship, 2376 SRAM, 2195, 2196 Storage consolidation, 2798 Structural summaries, 606, 2858–2860 S-reducibility, 2620–2621 Storage device, 1574, 1575, 1900, 2798–2800 Structure, 2377, 2862, 3036, 3037 SRU, 2519, 2521 Storage grid, 2800–2802 Structured document retrieval, 2867–2868 SSD, 2799, 2800 Storage layer concepts, 2808 Structured overlays, 1628–1630 Stack-based architecture, 2772 Storage management, 2802–2806 Structured Query Language, 2753 Staged database, 2773–2776 – implementation, 2804 Structured text retrieval, 2867–2868 Staleness, 2388, 2389 – initiative-specification, 2806–2807 – models, 2868–2871 Standard effectiveness evaluation in IR, – technologies, 2802 – system, 2130–2134 2776 Storage manager, 2807–2812 Structure indexing, 2857–2861 Standard effectiveness measures, 2776–2779 Storage mapping strategies, 3627 Study of signs, 1334 Standard generalized markup language Storage network architecture (SAN), 1574, Subgraph isomorphism, 1170–1171 (SGML), 1927 1575, 2812–2815 Subject space, 2871–2872 Standard storage management Storage Networking Industry Association Subscription language, 465 interface, 2806 (SNIA), 1499, 1552, 2806, 2807, Subscription processing with complex Standardized metadata set, 947 2815–2816 predicates, 2071 Standards for obtaining copyright, 497 Storage networks, 1552 Subshot segmentation, 3281, 3284, 3285 Stand-by mode, 2821, 2822 Storage of Large Scale Multidimensional Subtransactions, 1142, 2588–2590 Star index, 2779 Data, 2816–2821 Succinct constraints, 2876 Star or snowflake schema, 2779 Storage power management, 2821–2823 Suffix, 2790–2793 Star schema, 658, 661, 2014 Storage protection, 2823–2824 – removal, 1610 State-based publish/subscribe, 2780–2782 Storage protocol, 2824–2827 – trees, 2876–2880, 3059–3061 Statechart, 3554, 3555 Storage resource management, 2827 – trie, 2876–2878 State diagram, 41, 42, 45 Storage resource management software Summarizability, 2880–2883 State equivalence, 1071 tools, 2827 Summarization, 2884–2889 Stateful methods, 1688 Storage security, 2827–2829 – systems, 2884–2889 Stateless methods, 1688 Storage virtualization, 1659, 2830 – techniques, 2884, 2885, 2888 State-machine replication, 2392, 2393 – software, 1659 Summary database, 2880 Statement-level triggers, 738 – technologies, 2830 Summary graph, 2857 Statement replication, 1740–1741 Storage volume identifier, 1658–1659 Summary statistics, 2882 State transition, 355 Stored procedure, 2831 Superkey, 1587, 1588 Subject Index 3745

Supervised learning, 1664 – database(s), 99, 142–143, 241, 242, Term weight, 3036 Supply chain management process 2892, 2893, 2896, 2957–2960, 3028, Terrain, 817–821 engineering, 296–297 3258, 32359 Terrain models, 818, 820, 821 Support, 124–126 – database system architecture, 3013, Tertiary storage media, 2817–2820 – vector machine, 2890–2892 3015 Test collections, 3481, 3482 – vector regression, 2890 – data models, 329, 2098, 2119–2122 Test datasets, 2339–2343 Support of a graph, 1171 – data semantics, 2941, 2942, 2944 Text analytics, 3473 SVM, 2890–2892 – dependencies (i.e. the title of the Text categorization, 3041–3044 SVR, 2890 entry), 2960–2966 Text classification, 3044–3046 SWS framework, 2587 – evolution, 1319 Text clustering, 3063 Symbolic representation, 2897 – feature, 161 Text document formatting systems, 1696 Symmetric multiprocessors (SMP), 2638 – functions, 1915 Text generation, 3048–3051 Synchronization protocols, 445 – granularity, 2962, 2965 Text indexing, 3055–3058, 3937–3942 Synchronous propagation, 2856 – homogeneity tuple timestamping, Text indexing and retrieval, 3055–3058 Synopsis, 634, 2898–2899 2973 Text mining, 235, 595, 693–695, 3061–3063, Syntactic structures, 982, 983 – indeterminacy, 79, 2973–2982 3065–3068 Synthetic microdata, 1475, 2899–2900 – index, 3167, 3254, 3258 Text preprocessing, 3062 System configuration, 2551–2552 – integrity constraints, 2960, 2965, Text processing, 979 System dynamics, 3527 2972–2986 Text retrieval, 3055–3058 System R, 2289, 2290, 2293, 2754, 2760, – join, 2982–2987 Text segmentation, 397–400 2900–2905 – join evaluation, 2984, 2986. Text streaming model (TSM), 3078–3079 System (crash) recovery, 1643–1644 – join operators, 2982, 2985 – bag of words model (BOW), 3078 Systems biology, 1266–1270 – locality, 1713–1714 – vector space model (VSM), 3078 Systems biology ontology, 1960 – logic, 2945–2948, 2958, 2976–2978 Text summarization, 3079–3083 Systems medicine, 360 – logical models, 2992–2996 – an abstract-summary, 3080 – normalization, 2965 – an extract-summary, 3080 T – object data models, 3000 – query-oriented summary, 3080 Tabular data, 2908 – object-oriented databases, 2998–3008 – supervised methods, 3081–3082 Tabular data protection, 1472 – object query languages, 3002 – unsupervised methods, 3080–3081 Tabular storage of trees, 3630 – periodicity, 3004–3008 Text summarizer, 3063 Tags, 1696 – periodic pattern of repetition, 3004 Textual annotation, 180, 181 Tape, 2798–2800 – predicates, 1915 Textual summaries, 605–607, 2884 Task, 41 – probabilistic aggregates, 2168 Text visualization, 3083–3085 Taxonomy: biomedical health informatics, – query languages, 2762–2768, 2958 – information visualization, 3083 2908–2911 – relation, 243–244 – natural language processing, TelegraphCQ project, 1634 – relational calculus (TRC), 3015–3016 3084, 3085 Telic distinction in temporal databases, – role based access control model, – term frequency (TF), 3084 2911–2914 2920–2922, 2924 TF*IDF, 3085–3086 Telos, 1728, 2914–2920 – SQL, 2762–2768 – document length, 3086 Temporal, 2736–2738, 2762–2768, – type, 2968 – inverse document frequency, 3085 2932–2935 – visual languages, 3027–3033 Thematic map, 3086–3087 – access control, 2920–2924 Temporal Cartesian product, 2983 – coropleth map, 3086–3087 – algebra basics, 2929–2930 Temporal query language extending the – dasymmetric map, 3087 – algebras, 2929–2932 relational calculus, 3015 – dot map, 3087 – and derived data authorization model, Tentative update, 1991–1994 – isarithmic map, 3087 2920, 2922 Term dependence, 3036 – proportional symbol map, 3087 – aspect, 3253 Term-document matching functions, 929 – topographic map, 3087 – assignment, 3008 Term-document model, 1522 Theory of indexability, 1223 – authorization model, 2921–2922 Term frequency (tf), 2169, 3937–3942 Theta join, 1581 – coalescing, 2932–2935 Term frequency-inverse document Third Normal Form (3NF), 3087–3088 – compatibility, 2936–2945 frequency weighting scheme (tf*idf), Three-Dimensional GIS and Geological – conceptual models, 2940–2945 1529 Applications, 3088–3091 – consistency, 2344, 2345, 2347 Termination, 37 Three-level memory hierarchy, 1707 – constraints on sets of time points, 2946 Terminator, 143 Three-Phase Commit, 3091–3097 – constraints on time intervals, 2946, Terminology data model, 1002 – atomic commit protocols (ACPs), 2947 Terminology systems, 1000, 1003 3092, 3097 – constraints on time points, 2945, 2947 Term proximity, 3036–3037 – voting protocols, 3094, 3096 3746 Subject Index

Thresholding, 1389, 1390 TinySQL, 711–713 Transaction models-the read/write approach

TIGER, 3132, 3133, 3135–3139 Tjtj, 477 – commutativity (of operations), 3160 Tight coupling, 2211, 2212, 3097–3098 t-norm (Triangular norm), 3177–3178 Transaction models-the read/write approach – loosely coupled approach, 3097 Tokenization, 3062 – schedule, 3158–3160 – strong dependency between software Top/bottom coding, 1912, 1913 – transaction, 3158–3161 components, 3097 Topic-based publish/subscribe, – transaction history, 3159 TIGRIS, 3132 3127–3128 Transaction performance council (TPC), 99 TIMBER, 3637 – publish/subscribe, 3127–3128 Transaction processing, 3163 Time, 2914, 2915, 2919, 2920, 2992–2996, Topic Detection and Tracking (TDT), Transaction processing monitors (TPM), 3018–3023 3121–3124 3163 Time and information retrieval Topic map, 3124–3126 Transaction pseudonym, 2207 – document exploration, 3099 Top-k queries, peer-to-peer, 111–113 Transaction recovery, 1643 – document retrieval, 3100–3101 Top-κ query processing for XML Transaction replication, 1740–1741 – temporal expression, 3098–3102 data, 2325 Transactions, 1142, 1947–1948, 1954–1958, – timeline, 3098–3102 Top-K selection queries on multimedia 2626–2631 Time-based profilers, 2093 datasets Transaction scheduling, 443–444, 3153 Time-cognizant behavior, 2344 – multimedia, 3129–3131 Transaction-time, 2892–2896, 3252 Time decay, 758–759 – query processing, 3129–3131 Transaction-time databases, 3167, 3169, Time-dependent geometry, 1770 – ranking, 3129, 3131 3254, 3255 Time-dependent graphs, 3097 Top-k summary, 2898 Transaction-time indexing, 239, 240, Time domain, 1161, 3103–3106 Top-k XPath Query Processing 3167–3171 Time granularity, 2968, 2969, 2972, Topological data model, 3132–3139 Transducer networks, 3635–3636 2994, 2995 Topological invariants, 843, 845 Transductive learning, 2613 Time in Philosophical Logic Topological predicate, 2701–2702 Transformation and loading (Web ETL), – A.N. Prior, 3108–3110 Topological relationships, 843–845, 3471–3472 – branching time, 3108–3110 3140–3143 Transitive reduction, 1189 – J.E. McTaggart, 3108 Topology, 2652, 2653 TREC (Text REtrieval Conference), 2776, – philosophical logic, 3107–3111 Tours, 950, 951, 953 3041, 3042 – temporal logic, 3108, 3109, 3111 TPR-tree, 1458–1461 TRECVid, 470, 472 – tense logic, 3109, 3111 Tracking, 1693, 1695 Tree, 2599–2600 – tenses, 3107–3110 Traditional concurrency control for Tree-based indexing, 3172–3173 Time interval, 3113 replicated databases Tree-based indices, 2135, 2522 – convex subset, 3112 – locking, 3146, 3149 Tree-like indexing structure, 197 – duration, 3112, 3113 – replication, 3144–3146, 3148 Tree-like models, 1853–1855 – SQL, 3113 Traditional sequential algorithms with Treemaps, 3173–3177 – time duration, 3112, 3113 multiple threads, 2031 – treemaps algorithm, 3174 (convex) Time interval, 78–79 Trajectory, moving point, 3150 – treemaps visualizations, 3174 Time-line clock, 2108, 3120 Transaction, 1091–1092, 2761, 2762, Tree pattern query, 3637–3639 – physical clocks, 3120 3150–3151 Tree quorums, 2314, 2315 – synchronization point, 3120 Transactional ACID property, 144 Tree-structured data mining model, Time period, 3113 Transactional interface, 2673 2469 Time period set, 2966 Transactional processes, 3166 Tree structures, 2219 Time-referenced fact, 1 Transactional storage manager, 755 Trellis plots, 1866, 1868 Time-references, 2957 Transaction chopping Triangular norm (t-norm), 3177–3178 Time series, 2245–2247, 2952, 3114–3118 – chopping, 3151–3152 Triangulated Irregular Network (TIN), Time slice, 2736–2738 – locking, 3151 3178–3179 Timeslice operator, 2659, 3455–3456 – performance, 3151 – delaunay triangulation, 3179 Time span – serializability, 3152 – terrain, 3178, 3179 – data type, 3119 – transaction, 3151–3152 Trie, 2877–2879, 3179–3182 – duration, 3119 Transaction database (TDB), 2876 – automaton, 3179 – interval, 3119 Transaction management, 3153–3156 – PATRICIA tree, 3181, 3182 – time, 3119 – recovery, 3153–3156 – prefix tree, 3179 Timestampe ordering (TO), 2541–2542 Transaction manager (TxM), 3157 Trigger, 1979, 1980, 2754, 2755, 2757, Timestamping, 2895 – ACID transactions, 3157 2758, 2760 Timestamps, 2932–2935, 2966 – active transactions, 3157 Trigram, 1910 TimesTen, 1669 – state transition, 3157 True positive rate (TPR), 2349–2351 TinyDB, 710–713 Transaction models, 3158–3161 Trust, 2414–2415 Subject Index 3747

Trust and Reputation in Peer-to-Peer Two-phase locking (2PL), 443–444, 2541, Updates through Views, 3244–3247 Systems, 3183–3187 3214–3217 Upstream backup, 1110–1113 – reputation, 3183, 3184, 3186, 3187 – conflict-serializability, 3215 Upward and downward inheritance, – trust, 3183–3187 – a locked transaction, 3214–3216 142–143 – trust management system, 3183 – a locking policy, 3214, 3215 Upward compatibility, 2937 Trusted hardware, 3191–3192 – a safe locking policy, 3214, 3216, 3217 Upward inheritance, 2911, 2912 – tamper-proof hardware, 3191 Two-Poisson Model, 3218–3219 Usability, 955, 958, 3247–3251 – Trusted Platform Module (TPM) – a linear combination of two Poisson User-centered approach, 3247 specifications, 3191 distributions, 3218 User defined functions (UDFs), 2831 Trust in Blogosphere, 3187–3191 – a probabilistic model of indexing, 3218 User-defined temporal periodicity, 3005 – blogosphere, 3187–3091 Type-based Publish/Subscribe, 3220 User interface architecture, 1329, 1330 – distrust, 3189, 3190 – publish/subscribe, 3220 User-level parallelism, 1566 – social network, 3187–3191 Type-checking, 3646–3649 User model, 2100, 2102 – trust, 3187–3191 Type of evidence, 1072 User profile(s), 2099, 2100, 2102 Trust virtualization, 812, 813 Types for temporal dimensions, 2999–3001 User queries over XML views, 3657 TSQL2 (Temporal Structured Query Types of locality, 1713 User-role assignment (URA97) model, 57 Language), 3192–3197 Types of schema evolution, 2500, 2502 User updates over XML views, 3657–3658 – SQL/Temporal, 3192, 3193, 3197 Using parity and striping, 2359 – temporal extension of SQL–92, U UTF–8 (a 8-bit, variable-width encoding), 3192, 3194 UCC-user created content, 466, 467, 469, 3231 t1,t2,td, 477 470 UTF–16 (a 16-bit, variable-width Tuning application interface, 105–106 Unbalanced hierarchy, 1308 encoding), 3231 Tuning concurrency control, 3198–3201 Uncertain event inference, 3221–3223 UUID, 2428–2429 – the concurrencycontrol, 3198 Uncertainty, 1924 – serializability, 3199, 3200 – in events, 3221–3225 V – tuning by Leveraging Application – or impresion of data, 1808 Validity region, 3439 Semantics, 3198–3199 – management, 3225–3231 Valid time, 3252 Tuning in operating system, 2114–2115 – in sensor data, 647–651 Valid-time database, 3254–3256 Tuning time, 72, 74, 76 Uncorrelated noise addition, 1911 Valid-time index, 3254, 3255 Tuple-based algebras for Xquery, 3640 Undirected graphs, 1261 Valid-time indexing, 240, 3254–3258 Tuple-count versus time-sliding Unicode, 3231–3232 Value equivalence, 3258–3259 windows, 3533 Unicode standard, 3231 Value-List index, 244–247 Tuple equivalence, 2659, 3455 Unified Data Model (UDM), 3641 Value reduct, 761–762, 764 Tuple-generating dependencies, Unified modeling language (UML), 1927, Variable database, 1922, 1923 3201–3202 3232–3239, 3371–3373, 3552 Variable group-size microaggregation, 1736 – normalization, 3201, 3202 – activity diagrams, 293 Variable time span – schema mapping, 3201, 3202 – class diagrams, 438, 439, 441, 442, – calendar, 3259 – tgds, 3201, 3202 3233–3236, 3239 – time interval, 3259 Tuple-generating dependency, 2489 – model, 3597 Vector graphics, 1374, 1376 Tuple relational calculus, 2370–2371 – modeling language, 41 Vector space model, 1571, 3059 Turing machine, 495 Uniform resource identifier (URI), Vendor neutral technology Twig index, 3589, 3590 2428–2429 center, 2816 Twig query, 3637–3639 Unigram, 1910 Venn, 3370–3372 Two-dimensional shape retrieval, Union, 3239–3240 Verbosity hypothesis, 940 3202–3203 Uniqueness constraint, 1587 Verification, 3551 – 2D shape, 3202 Universal decimal classification, 808 Vertical fragmentation, 891, 892 Two-level hierarchical scheduling policy, Universal description, discovery and Vertical partitioned data, 3263–3265 1832, 1834 integration (UDDI), 854, 855, 857 Vertical partitioning, 599–600 Two-level serializability, 505 Universal models, 324, 327 Vertical replication, 2409, 2412, 2413 Two-phase commit, 3204–3209 Universe, 1209–1210 Vertical search, 592 – atomic commit protocols, 3204, Unobservability, 2142, 2143, 2145 Vertical web search, 1154 3206–3208 Unrestricted implication problem, 1396 Video application, 3265, 3266, 3268 – commit optimizations, 3204 Unsupervised learning, 1664 Video clips, 3320, 3321, 3323 – commit protocol, 3209–3213 Update anomaly, 1918, 1920 Video compression, 3298, 3301, 3302 Two-Phase Commit Protocol, 3209–3213 Update semantics, 99 Video content analysis, 468–472, – commit protocol, 3209–3213 Update through views problem, 3246 3271–3276, 3321 – distributed, 3209, 3210, 3213 Updates on the views, 2639, 2642 Video content analysis algorithms, 3271 3748 Subject Index

Video data, 3292–3295 Visual on-line analytical processing (OLAP), – 2.0 applications, 2667 Video data model, 3277, 3278 3388–3395 – 3.0 applications, 3457 Video format, 3296, 3297 Visualization, 3352–3354, 3366–3368 – application server, 104 Video history, 3265 – of association rules, 3348, 3351 – browsing, 268 Video indexing, 3360 – of data, 749 – characteristics, 3460–3462 Video metadata, 3286–3292 – for information retrieval, 3410–3414 – characteristics and evolution, Video querying, 3292–3296 – methods, 655, 656, 3411 3460–3462 Video representation, 3265, 3266, 3270 – pipeline, 3414–3416 – crawler, 1147, 3462–3465 Video retrieval, 3365 – process, 3414 – crawler architecture, 3462–3465 Video scene, 3303 – of spatial data, 3382 – crawling, 1600 Video scene and event detection, – task, 3414, 3415 – data extraction, 590–593, 1595–1600, 3303–3308 Visualization models for multiple reference 3465–3470 Video search engine(s), 468–470 points, 3412 – data extraction system, 3465–3470 Video segment, 3292–3294, 3296 Visualizing, 2019, 2020, 2022, 3416–3417, – directory, 1463, 1464 Video (temporal) segmentation, 3308 3437–3438 – documents, 1191 Video shot detection, 3316–3320 – clustering results, 3417–3425 – 2.0 enabling technologies, 3457 Video summarization, 3320–3324 – clusters, 3417–3425 – evolution, 3460–3462 View(s), 92–97, 1674–1679, 2639–2642, – hierarchical data, 3425–3432 – extraction, 3471–3472 3244–3247, 3326–3328, 3339–3340 – network data, 3432–3437 – forms, 1162 – adaptation, 3324–3325 Visual metaphor, 3387–3388 – graph, 1274 – definition, 3325 Visual on-line analytical processing (OLAP), – index, 1463, 1465, 1466 – dependencies, 1396, 1399–1400 3388–3395 – intelligence, 592–593 – maintenance, 1670, 1672, 2549, Visual perception, 3395–3399 – marts, 3377 3326–3331 Visual query, 3399–3404 – mashups, 3378, 3482–3483 – recomputation, 3326 – formulation, 3028, 3033 – mining, 595, 693–695, 3472 – self-maintenance, 2548–2550 – query language, 3399–3404 – ontology language (OWL), 2008–2009 – update, 3326–3328 Visual query systems (VQSs), 3375, – page cleaning, 1191 – update translations, 3245, 3246 3376, 3399 – question answering, 3485–3490 – View-based data integration, Visual representation, 3405–3410 Web search, 1251–1255, 2082–2085 3332–3339 Visual summaries, 3384 – engines, 3497–3500 Virtual data integration, 2481 Visual system, 3395, 3396, 3398 – relevance feedback, 3493–3497 Virtual medical record (VMR), 970 Visual wrapping, 1649, 1651 – relevance ranking, 3497–3500 Virtual memory (VM), 278–279 Voronoi cell, 3439 – result caching, 3501–3505 Virtual relations, 3325, 3339 – Voronoi diagram, 1892, 3438–3440 – result prefetching, 3501–3505 Vision, 3396–3398 – Voronoi edges and voronoi Web service discovery, 857 Visual analytics, 3341–3346 vertices, 3439 Web service standards, 3510 Visual association rules, 3346–3351 – Voronoi neighbor, 3439 – spam, 3520–3523 Visual clustering, 3355–3360 VP-trees, 1439–1441 – spam detection, 3520–3523 Visual data exploration, 1623 Vulnerable edge, 2662 – transactions, 3523–3524 Visual data mining, 3355, 3360 – views, 3524–3525 Visual distances and visual sangles of a W – wrappers, 1595–1600, 3565 document, 3413 Wait-for graph (WFG), 899–902 Web service description language (WSDL), Visual exploration, 405 WAN data replication, 3441–3445 854, 2587 Visual features, 1379, 1380 Watermarking, 825–829, 2827, 2829 Web services business process execution Visual information retrieval system, 1379 Wavelet, 857–863, 2898, 2899, 3446–3451 language (WS-BPEL), 413–418 Visual interfaces, 267–268, 3379–3382 – based approximation, 1303 Weight, 2862 – metaphor, 3387–3388 – synopsis, 860, 862, 863 Weighted MDS, 1784 – perception, 3395–3399 – transform, 3446, 3447 Weighting schemes, 3937–3942 – query, 3399–3404 W3C (World Wide Web consortium), 3441 What-if analysis, 3525–3528 – formulation, 3028, 3033 – initiatives, 3441 Wide-area database, 3442 – language, 3399–3404 – operations, 3441 Wide-area data replication, 3443 – systems (VQSs), 3375, – XML recommendation, 3584 Wikipedia, 967, 968 3376, 3399 Weak consistency, 1072 Wikipedia article, 1537 – representation, 3405–3410 Weak temporal relation, 2659, 3455 WIMP interfaces, 3529–3532 – summaries, 3384 Web 2.0/3.0, 3456–3457 Window, 1064, 1065, 1067 – system, 3395, 3396, 3398 – advertising, 3457–3459 – aggregates, 3538 – wrapping, 1649, 1651 – application, 1696–1697 – based query processing, 3533–3537 Subject Index 3749

– joins, 3538 XML (eXtensible Markup Language), XML language extensions, 3602, – query, 3533 2047–2050, 2187, 2188, 2191, 2290, 2298, 3605, 3606 Wipe, 3316, 3318 2599–2600, 2932–2935, 3571–3572, XML manipulation language, 3654 Wireless broadcast channel, 73 3576–3579, 3585, 3591, 3598–3600, XML Metadata Interchange (XMI), 3597

ωj tj, 477 3608–3612, 3623–3626, 3634–3636, XML parser, 3598–3600 wmix(q, e), 477 3646–3649, 3659–3665 XML parsing, validation, 3600 Workflow(s), 1077–1078, 1276–1278, 3539, – absolute constraints, 3593 XML process definition language (XPDL), 3545–3549, 3551–3557 – access control, 3573–3575 3558, 3601 – activity cycle, 1661 – access control policy, 3573 XML programming interface, – branching, 2006 – algebra, 3640, 3641 3598–3599 – control data, 494 – API, 3602 XML publishing, 3613–3616 – engine state data, 494 – attribute, 3576 XML-QL, 3614, 3637 – evolution, 3540–3544 – benchmarking, 3576–3579 XML queries, 2326 – generation, 3514 – cardinality, 3623, 3626 XML relative constraints, 3593 – join, 3544–3545 – estimation, 3623–3626 XML retrieval, 463, 2376, 2867, 2868, 3036, – management, 289–293, 3545, 3557, 3558 – graph synopsis, 3624–3626 3037, 3616–3620 – management and workflow – histograms, 3624–3626 XML schema, 3621–3622, 3650 management system, 3545–3549 – measurement, 3577, 3578 XML scripting, 3607 – management coalition, 3550 – performance, 3576, 3578 XML signature, 832–834 – model, 3550–3551 – selectivity, 3623–3626 XML storage, 3627–3633 – provenance, 2202–2204 – synopsis, 3623–3626 XML tree pattern, 2050 – schedule, 2474 – synthetic data generators, 3577–3579 XML tuple algebra, 3640–3645 – schema, 3558 XML-based integration framework, 3597 XML typechecking, types, 3646–3649 – step, 41 XML benchmark, 1737 XML types, 3646, 3648, 3649 – transaction, 3559 XML compression – regular expression, 3651–3653 Workflow management coalition – compression, 3579–3583 – validation, 3652 (WfMC), 1276 – data compression, 3580, 3583 XML updates, 3654–3655 Workflow management systems (WFMS), – decompression, 3580 XML views, 3656–3659 3547–3548 – homomorphic compression, XML vocabulary, 1236 World Wide Web, 1417, 1418 3580, 3582 XPath, 1876–1879, 3634–3636 WORM, 2798–2800 – structure compression, 3581 XPath languages, 3665, 3666 WORM storage, 3570 XML databases, 1564 Xpath/Xquery, 2047–2049 Wrapper(-ing), 1282–1286, 2511, XML data reduced (XDR), 3614 XPDL, 3550 3472–3473, 3565–3568 XML document, text document, 3584 XPERANTO, 3613–3615 – generation, 3465–3469 XML element, element, 3585 Xquery, 3591, 3665–3670 – induction, 3560–3568 XML filtering, 3608–3612 XQuery Full-Text, 3665–3670 – induction algorithms, 3563–3564 XML foreign keys, 3592, 3593, XQuery processors – learning, 3565–3567 3595–3596 – DB2 XML, 3672, 3674–3675 – programming languages, 1649 XML full-text search, 1544, 1545 – timber, 3672–3675 – reinduction, 3566–3567 XML functional dependencies, XSL (eXtensible Stylesheet Language), – repair, 3566–3568 3592–3594 3676–3680 – robustness, 3569 XMLHttpRequest, 78 XSLT (eXtensible Stylesheet Language – verification, 3566–3568 XML inclusion dependencies, 3592, 3593, Transformations), 3676–3680 Write ahead log (WAL), 517, 519 3595–3596 XSLT programming, 3676–3678 Write once read many (WORM), 2364, XML information integration XSL/XSLT, 3676–3680 2365, 3570 – data integration, 3591 XTM, 3125 Write Skew (WS), 2661 – enterprise information integration, – brokered notifications, 2210 3591 Z – eventing, 2210 XML information item, 3585 Z39.50, 2519, 2521 – notifications, 2210 XML Information Retrieval (XML IR), Zero-One laws, 1081, 1082, 3683 – topics, 2210 1531–1534, 1536 ZF-expression, 420–421 XML information set, 3584 Zoomable user interface (ZUI), X XML integrity constraint, 3592–3597 3684–3689 XACML, 2142 XML-IR, 1545, 1546 Zooming, 3684–3689 XJoin, 904, 906, 907 XML keys, 3594 Zooming techniques, 3684–3689 http://www.springer.com/978-0-387-49616-0