
Advances in Databases
Beschreibung
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
Weitere Details
Weitere Ausgaben
Andere Ausgaben

Inhalt
- Title
- Preface
- Organization
- Table of Contents
- Evolving the Web into a Global Data Space
- Data Integration in a Networked World
- Reliable Provenance Information for Multimedia Data Using Invertible Fragile Watermarks
- Introduction
- Background
- Data Provenance
- Watermarking
- Invertible Watermarking Techniques
- Fingerprint Pattern Data - A Motivating Example
- Using Watermarking for Data Provenance
- Architecture and General Data Flow
- A Hybrid Watermarking Approach
- Verifying the Watermark Information
- Extension of the Watermarking Scheme of Merkel et al.
- Implementation of the Hybrid Approach with Postgres 8.4
- Discussion
- Advantages
- Disadvantages
- Related Work
- Conclusion
- References
- ECOS: Evolutionary Column-Oriented Storage
- Introduction
- Problem Statement and Motivation
- Evolutionary Column-Oriented Storage
- Table-Level Customization
- Column-Level Customization and Storage Structure Hierarchies
- Evolution and Evolution Paths
- Implementation and Empirical Evaluation
- Micro Benchmark Details
- ECOS Performance Improvement
- Related Work
- Conclusion and Future Work
- References
- X-HYBRIDJOIN for Near-Real-Time Data Warehousing
- Introduction
- Related Work
- Index-Based Hash Join Architecture: HYBRIDJOIN
- X-HYBRIDJOIN
- Difference between X-HYBRIDJOIN and HYBRIDJOIN
- Algorithm
- Cost Model
- Memory cost.
- Processing cost.
- Experiments
- Experimental Setup
- Experimental Results
- Performance comparisons:
- Role of the non-swappable part in stream processing.
- Cost validation.
- Conclusions and Future Work
- References
- Achieving High Freshness and Optimal Throughput in CPU-Limited Execution of Multi-join Continuous Queries
- Introduction
- Preliminaries
- Background
- Problem Definition
- The JDA Technique
- The Proposed JAQPOT Approach
- Optimizing Throughput in Multi-join Queries
- Path Productivity-Based Join Adaptation
- Satisfying Freshness in Multi-join Queries
- The Integrated JAQPOT Algorithm
- Experimental Evaluation
- Throughput Production in Synthetic Data
- Evaluating Result Freshness
- Related Work
- Conclusion
- References
- Mining Image Databases by Content
- Introduction
- Content-Based Image Retrieval by Colour
- Conclusions
- References
- Searching for Complex Patterns over Large Stored Information Repositories
- Introduction
- Pattern Specification and Detection
- Pattern Specification
- Pattern Detection
- Inverted Index
- Pattern Detection Graphs
- Pattern Operator Processing
- The NEAR Operator
- Design and Implementation of InfoSearch
- Implementation
- Experimental Results
- Related Work
- Conclusions
- References
- Using the Euclidean Distance for Retrieval Evaluation
- The Euclidean Distance
- Investigation Objectives and Methodologies
- Experiments
- Experiment 1
- Experiment 2
- Experiment 3
- Conclusions
- Appendix
- Expanding Sensor Networks to Automate Knowledge Acquisition
- Introduction
- Motivation
- Contribution
- Structure
- User Requirements and Operating Architecture
- The EventSense Architecture
- Sensor Enablement.
- Contextual Enrichment.
- Integration.
- Query Interface.
- Context Profiles and Event Mining
- Sensor, Activity and Participant Profiles
- Event Definition
- Experiments and Evaluation
- Related Research
- Conclusions
- References
- Utilising the MISM Model Independent Schema Management Platform for Query Evaluation
- Introduction
- Background
- Query Language
- Query Rewriting
- SMql Query over Supermodel into XQuery over XML
- SMql Query over Supermodel into SQL Query over Relational Model
- Related Work
- Conclusions
- References
- Mining Sequential Patterns from Probabilistic Databases by Pattern-Growth
- Introduction
- Problem Statement
- Pattern-Growth Approach
- Pattern-Growth Step
- Experimental Evaluation
- Conclusions and Future Work
- References
- Smile: Enabling Easy and Fast Development of Domain-Specific Scheduling Protocols
- Introduction
- Banking Scenario
- Smile: Declarative Scheduling Middleware
- Oshiya Scheduling Model
- Smile Architecture
- Example: Use Case Implementation
- References
- On Integrating Data Services Using Data Mashups
- Introduction
- Database Oriented Mashups
- Data Mashups Using XQuery
- Conclusion
- References
- Executing In-network Queries Using SNEE
- References
- Extracting Data Records from Query Result Pages Based on Visual Features
- Introduction
- Fundamentals and Overview
- Visual Representation of Query Result Pages
- Overview of Our Approach
- Identifying Data Sections
- Removing Noisy Blocks
- Grouping Data Units of Data Records
- Experimental Results
- Related Work
- Conclusions
- References
- Updates on Grammar-Compressed XML Data
- Introduction
- Sharing Similar Trees
- The Paper's Example Document
- The Idea Behind Sharing Similar Trees
- Node Selection by Grammar Paths
- Parallel Updates on the Compressed Data
- Basic Update Concepts and Parallel Update Problem Definition
- First Step of the Parallel Update Process: Constructing an Update DAG(UD)
- Second Step of the Parallel Update Process: Isolating UD from GD
- Performing the Updates
- Sharing Identical Nodes
- Evaluation
- Related Work
- Summary and Conclusions
- References
- Reverting the Effects of XQuery Update Expressions
- Introduction
- Preliminaries
- XML Document Representations
- Update Operations and PULs
- PUL Streaming Application
- PUL Inverse
- Operation Inversion
- PUL Inversion
- Inversion Algorithm
- Completed PULs
- Evaluation
- Related Work
- Concluding Remarks
- References
- TraCX: Transformation of Compressed XML
- Introduction
- Motivation
- Contributions
- Query Language
- Example Being Used in This Paper
- Paper Organization
- Our Solution
- Basic Idea
- XPath Evaluation
- Copying Compressed Sub-Trees
- Evaluation of Our Prototype Implementation
- Related Works
- Summary and Conclusions
- References
- Satisfiability of Simple XPath Fragments under Fixed DTDs
- Introduction
- Definitions
- NP-Completeness
- Satisfiability Problem without Upward Axis
- Glushkov Automaton
- Polynomial-Time Algorithm
- Using Upward Axes under Fixed DTDs
- Conclusion
- References
- Computing Compressed XML Data from Relational Databases
- Introduction
- Motivation
- Contributions
- Paper Organization
- The Concept
- Considered Subset of SQL/XML
- This Paper's Example
- The Basic Idea
- Retrieving Compressed XML Data from a Relational Database
- Generating the XML Schema for the SQL/XML Query Result
- Computing the SQL Query for Generating the Compressed XML Document
- Computing the Compressed Structure and the Text Data of the Compressed XML Document
- Evaluation
- Related Work
- Conclusions
- References
- Data Mining Project: A Critical Element in Teaching, Learning and Assessment of a Data Mining Module
- Introduction
- Data Mining Mini-project: A Specification
- Project Aim, Objectives and Scope
- Project Content and Deliverables
- Related Issues
- Administration of the Project
- Assessment Framework of the Project
- Case Studies: The Good, the Bad and the Ugly
- Project One: The Bad
- Project Two: The Good
- Project Three: The Ugly
- Discussions
- Concluding Remarks
- References
- Author Index
Systemvoraussetzungen
Dateiformat: PDF
Kopierschutz: Wasserzeichen-DRM (Digital Rights Management)
Systemvoraussetzungen:
- Computer (Windows; MacOS X; Linux): Verwenden Sie zum Lesen die kostenlose Software Adobe Reader, Adobe Digital Editions oder einen anderen PDF-Viewer Ihrer Wahl (siehe E-Book Hilfe).
- Tablet/Smartphone (Android; iOS): Installieren Sie bereits vor dem Download die kostenlose App Adobe Digital Editions oder die App PocketBook (siehe E-Book Hilfe).
- E-Book-Reader: Bookeen, Kobo, Pocketbook, Sony, Tolino u.v.a.m.
Das Dateiformat PDF zeigt auf jeder Hardware eine Buchseite stets identisch an. Daher ist eine PDF auch für ein komplexes Layout geeignet, wie es bei Lehr- und Fachbüchern verwendet wird (Bilder, Tabellen, Spalten, Fußnoten). Bei kleinen Displays von E-Readern oder Smartphones sind PDF leider eher nervig, weil zu viel Scrollen notwendig ist. Mit Wasserzeichen-DRM wird hier ein „weicher” Kopierschutz verwendet. Daher ist technisch zwar alles möglich – sogar eine unzulässige Weitergabe. Aber an sichtbaren und unsichtbaren Stellen wird der Käufer des E-Books als Wasserzeichen hinterlegt, sodass im Falle eines Missbrauchs die Spur zurückverfolgt werden kann.
Weitere Informationen finden Sie in unserer E-Book Hilfe.