
Database and Expert Systems Applications
Description
Alles über E-Books | Antworten auf Fragen rund um E-Books, Kopierschutz und Dateiformate finden Sie in unserem Info- & Hilfebereich.
More details
Other editions
Additional editions

Content
- Intro
- Titlepage
- Preface
- Program Committee
- Table of Contents
- Keynote Talks
- Principles of Distributed Data Management in 2020?
- Introduction
- Principles of Distributed Data Management
- New Challenges for Distributed Data Management
- Scientific Data Management
- Cloud Data Management
- Emerging Solutions
- Conclusion
- References
- The Science of Conceptual Modelling
- The Triptychon of Model as an Artifact, Modelling as an Activity and Modelling as an Art and Science, Thus as a Culture
- Differences between `Model', `To Model' and `Modelling'
- The Simultaneity of Art, Culture, Technology and Techniques in Modelling
- Orientation of This Paper
- The World of Models
- The World of Models
- The Model as a Physical or Virtual Artifact
- The Purpose Dimension
- The Language Dimension
- The Context Dimensions
- The World of Modelling Activities
- Workflows Applied in the Model Development and Deployment Process
- Modelling Acts
- Models Serving Both as a Description of an Application (Domain and Problem) and as a Prescription for Construction (of Systems)
- The Construction Workflow Based on Information Systems Models
- Duties and the Task Spectrum in Conceptual Modelling
- The Design Science Approach to Tasks in Conceptual Modelling
- CMM and SPICE for Conceptual Modelling
- The Duty Portfolio of Modelling
- Conclusion
- References
- Probabilistic Logics in Expert Systems: Approaches, Implementations, and Applications
- Introduction
- Approaches
- Propositional Approaches
- Relational Approaches
- Systems
- SPIRIT and Probabilistic Reasoning under Maximum Entropy
- Alchemy
- ProbCog
- KReator
- Applications
- Knowledge Processing with the MEcore System
- Diagnosis of Lung Cancer
- Predicting Allergic Diseases of Children
- Summary and Conclusion
- References
- Query Processing
- Multi-objective Optimal Combination Queries
- Introduction
- Related Work
- Algorithms
- Lower Bound Reduction
- Upper Bound Reduction
- Experiments
- Performances on Different Data Distributions
- Performances on Different Data Sizes
- Performances on Different Numbers of Attributes
- Performances on Different Cardinality
- Conclusions
- References
- NEFOS: Rapid Cache-Aware Range Query Processing with Probabilistic Guarantees
- Introduction
- Preliminaries
- NEFOS
- Building NEFOS
- Complexity Analysis
- Experimental Evaluation
- Synthetic Data
- Real-World Spatial Data
- Conclusions
- References
- Reuse-Oriented Mapping Discovery for Meta-querier Customization
- Introduction
- Modeling of Mappings
- Ontology-Based Mapping Modeling
- Change-Oriented Mapping Modeling
- Reuse-Oriented Mapping Discovery
- Mapping Reuse through MO-Repository
- Mapping Reuse through M-Ontology
- Validating and Correcting Mappings
- Experiments
- Related Work
- Conclusions and Future Work
- References
- Database Semantics
- Attribute Grammar for XML Integrity Constraint Validation
- Introduction
- Functional Dependencies in XML
- Finite State Automata for XFD
- XFD Validation: Attribute Grammar Approach
- Algorithm Analysis and Experimental Results
- Conclusions
- References
- Extracting Temporal Equivalence Relationships among Keywords from Time-Stamped Documents
- Introduction
- Preliminary Definitions
- Temporal Equivalence Partitioning
- Experiments
- Related Work
- Conclusions
- References
- Codd Table Representations under Weak Possible World Semantics
- Introduction
- Related Work
- Codd Tables and Table Constraints
- The Implication of Constraints over Codd Tables
- Axiomatic Characterization
- Algorithmic Characterization
- Logical Characterization
- Armstrong Tables
- Characterization
- Computation
- Conclusion
- References
- Skyline Queries
- Efficient Early Top-k Query Processing in Overloaded P2P Systems
- Introduction
- P2P System Model
- System Model
- Top-k Queries
- Peer Description
- Problem Definition
- Preliminaries
- Problem Statement
- Quat Top-k Query Processing
- Query Initialisation
- Query Forwarding
- Local Query Execution
- Bubbling Up Results
- Distributed Routing Indices
- Routing Indices Construction
- Maintaining Routing Indices
- Performance Evaluation
- Setup
- Dataset
- Metrics
- Baseline Approaches
- Performance Results
- Related Work
- Conclusion
- References
- Top-k Query Evaluation in Sensor Networks with the Guaranteed Accuracy of Query Results
- Introduction
- Preliminaries
- System Model
- Query Structure
- Accuracy of Top-k Query Results
- Robust Top-k Query Evaluation Algorithm
- Local Information Collection
- Query Evaluation Algorithm
- Determination of Non-appointed Sensors
- The Extension of the Algorithm
- Performance Study
- Performance Comparison with Equal Link Failure Rates
- Performance Comparison with Different Failure Rates
- Conclusion
- References
- Learning Top-k Transformation Rules
- Introduction
- Related
- The Local-Alignment-Based Algorithm
- Preprocessing the Input Data
- Segmentation
- Local Alignment
- Obtaining Top-k Rules
- Experiment
- Experiment Setup
- Quality of the Rules
- Execution Time
- Conclusions
- References
- Security and Privacy
- Privacy beyond Single Sensitive Attribute
- Introduction
- Related Work
- CODIP: A General Solution
- Naïve t-Closeness Approach
- CODIP: Overcoming the Shortcomings
- Choosing Better Plans
- Evaluating Projection Plans
- Association Loss Ratio
- Information Exposure Ratio
- Evaluation of Plans
- CODIP*: A Heuristic for CODIP
- Discussion of Possible Attacks on CODIP
- Intersection Attack
- Minimality Attack
- Experiments
- Relationship of and
- Closeness and Anonymity
- Conclusion
- References
- Privacy-Aware DaaS Services Composition
- Introduction
- Related Work
- Privacy Aware-Data Modeling
- Privacy Aware-Composition
- Privacy Description Model
- Privacy Level
- Privacy Rule
- Privacy Assertion
- Privacy Policy
- Privacy Requirements
- Privacy Compatibility
- Privacy Subsumption
- Privacy Compatibility Matching Algorithm
- Privacy-Aware DaaS Composition
- Fetching DaaS Annotations
- Checking Privacy within Composition
- Evaluations
- Conclusion
- References
- An Empirical Study on Using the National Vulnerability Database to Predict Software Vulnerabilities
- Introduction
- Data Source - National Vulnerability Database
- CPE (Common Platform Enumeration)
- CVSS (Common Vulnerability Scoring System )
- Our Approach
- Data Preparation and Preprocessing
- Feature Construction and Transformation
- Machine Learning Functions
- Experimental Results
- Evaluation Metrics
- Experiments
- Results
- Parameter Tuning
- Summary
- Discussion
- Related Works
- Conclusions
- References
- Spatial and Temporal Data
- Similar Subsequence Search in Time Series Databases
- Introduction
- Preliminaries
- Conservation of Energy
- Storage Scheme
- Envelope Haar
- Reading the Coefficients
- Subsequence Matching Using eHaar
- Pruning
- Proof for Correctness of Pruning
- DTW Based Matching
- Sorting of Matching Subsequences
- Experimental Results
- Datasets
- Performance Measures
- Results
- Related Work
- Discussion
- Conclusion
- References
- Optimizing Predictive Queries on Moving Objects under Road-Network Constraints
- Introduction
- Related Work
- The RD-Tree
- The Index Structure
- Algorithms for Predictive Line Queries
- Insertion and Deletion in the RD-Tree
- Performance Study
- Effect of the Number of Moving Objects
- Effect of the Predictive Time Length
- Effect of the Road Topology
- Update Cost
- Conclusion and Future Work
- References
- Real-Time Capable Data Management Architecture for Database-Driven 3D Simulation Systems
- Introduction
- Related Work
- Simulation Database
- External Database
- Synchronization Mechanism
- Schema Synchronization
- Data Synchronization
- Current Work
- Applications
- Conclusion
- References
- Collecting and Managing Network-Matched Trajectories of Moving Objects in Databases
- Introduction
- Overview of the EuNetMOD Mechanism
- Modeling Network-Matched Trajectories of Moving Objects
- Sampling and Generating Network-Matched Trajectories
- Sampling Euclidean-Based Motion Vectors from the Moving Object Side
- Generating Network-Matched Trajectories at the Server Side
- Performance Evaluation and Conclusion
- References
- On Guaranteeing k-Anonymity in Location Databases
- Introduction
- k-Anonymity Techniques, M3AR Algorithm and Problems
- Definitions and Values Calculation for Proposed Algorithm
- Definitions
- Values Calculation
- Proposed Algorithm
- Evaluations
- Conclusion and Future Works
- References
- Semantic Web Search
- Smeagol: A ``Specific-to-General" Semantic Web Query Interface Paradigm for Novices
- Introduction
- Related Work
- The Smeagol User Interface Paradigm
- User Interface
- Example
- Architecture
- Query Topologies
- Usability Experiment
- Results
- Conclusions and Future Work
- References
- Browsing-Oriented Semantic Faceted Search
- Introduction
- Data, Query and Facet Model
- Browsing-Oriented Facet and Facet Value Spaces
- Browsing-Oriented Facet Ranking
- Intuitions and Metrics for Browsing-Oriented Facet Ranking
- A Browsing-Oriented Ranking Function
- Evaluation
- Extended Facet Tree
- Browsing-Oriented Ranking
- Conclusion
- References
- An Efficient Algorithm for Topic Ranking and Modeling Topic Evolution
- Introduction
- Related Work
- Topic Detection and Clustering
- Phrase Extraction and Keyword-Set Formation
- Closed Frequent Keyword-Sets as Topics
- Clustering Research Papers Based on Topics
- Ranking of Topics
- Evolution of Topics
- Experiments and Results
- Dataset Description
- Results of Topic Ranking
- Evolution of Topics
- Conclusion and Future Works
- References
- Sampling the National Deep Web
- Introduction
- Background: Deep Web Characterization
- Our Approach
- Host-IP Cluster Sampling
- Dataset Preparation and Sampling
- Crawling Strategy
- Deep Web Site Identification
- Estimates for Total Number of Deep Web Sites and Databases
- Experiments
- Comparison: Host-IP Clustering Method vs. rsIP Method
- Related Work and Discussion
- Conclusions
- References
- A Bipartite Graph Model and Mutually Reinforcing Analysis for Review Sites
- Introduction
- Related Work
- ProposedMethod
- Bipartite Graph Model for Review Analysis
- Mutually Reinforcing Analysis
- Computing Feature Amounts
- Experiment
- Dataset
- Result
- Conclusion
- References
- Storage and Search
- Genetic Algorithm for Finding Cluster Hierarchies
- Introduction
- Related Work
- GACH - Genetic Algorithm for Finding Cluster Hierarchies
- Chromosomal Representation of Cluster Hierarchies
- Initialization of GACH
- Reproduction
- Fitness Function
- Selection
- Algorithmic Description
- Experimental Evaluation
- Evaluation of Genetic Parameters
- Competitive Performance of GACH
- Application of GACH on Real World Data
- Conclusion
- References
- A File Search Method Based on Intertask Relationships Derived from Access Frequency and RMC Operations on Files
- Introduction
- Related Work
- Proposed Approach
- Task Mining
- Intertask Relationship
- Keyword-Based File Search
- Experiments
- Experimental Environment
- Experimental Setup
- Evaluation of Task Mining
- Evaluation of Intertask Relationships
- Evaluation of SUGOI
- Summary of Experiments
- Conclusion and Future Work
- References
- A General Top-k Algorithm for Web Data Sources
- Introduction
- Related Work
- The BreadthRefine Algorithm
- Experiments
- Conclusion
- References
- Improving the Quality of Web Archives through the Importance of Changes
- Motivation
- Related Works
- Concepts
- Web Archive Model
- Assumptions
- Notation and Definitions
- Quality Measures
- Completeness
- Coherence
- Pattern-Based Web Crawling
- Experimental Evaluation
- Conclusion and Future Work
- References
- Web Search
- Alternative Query Generation for XML Keyword Search and Its Optimization
- Introduction
- Related Work
- Preliminaries
- Classification of Search Results with Witness Patterns
- Generation of Alternative Queries
- Naive Generation of Approximate Alternative Queries
- Optimized Generation of Approximate Alternative Queries
- Experiments
- Performance
- Conclusion
- References
- K-Graphs: Selecting Top-k Data Sources for XML Keyword Queries
- Introduction
- Overview of Approach
- Data Models and Queries
- Overview of Approach
- Keyword Correlation Graph (K-Graph)
- Keyword Correlation at Specific Distance d
- Keyword Correlation
- Reducing Size of K-Graphs
- Top-k Data Source Selection
- Estimating Relevant Scores of Data Sources
- Selecting Top-k Data Sources
- Experimental Evaluation
- Evaluation Metrics
- Results and Analysis
- Related Work
- XML Keyword Search over Single Data Source
- Query Result Ranking
- Collection Selection for Un-structured Data
- Conclusions
- References
- Detecting Economic Events Using a Semantics-Based Pipeline
- Introduction
- Related Work
- Economic Event Detection Based on Semantics
- Evaluation
- Conclusions and Future Work
- References
- Edit Distance between XML and Probabilistic XML Documents
- Introduction
- Motivation
- Probabilistic XML
- Organization
- Related Work
- Probabilistic XML Models
- Similarity
- Proposal
- Edit Distance
- Enumeration Algorithm
- Multidimensional Algorithm
- Stack Algorithm
- Performance Evaluation
- Experimental Setup
- Experiments
- Conclusion
- References
- Towards an Automatic Characterization of Criteria
- Introduction
- The Synopsis Approach
- General Presentation
- Characterization Criteria
- Resolve Candidate Words
- Experiments
- System Performance
- Comparison with Two Standard Tools in the Context of Segmentation: C99 and TextTiling
- Related Work
- Conclusion
- References
- Data Integration, Transactions and Optimization
- A Theoretical and Experimental Comparison of Algorithms for the Containment of Conjunctive Queries with Negation
- Introduction
- Preliminaries
- Methods for Testing Containment
- The Completion Space
- Sufficient Conditions for Concluding
- Exploration Heuristics of the Completion Space
- Comparison of Methods and Algorithms
- Breadth-First and Depth-First Traversals
- Experimental Comparison
- Relationships with Existing Algorithms
- Conclusion
- References
- Data Integration over NoSQL Stores Using Access Path Based Mappings
- Introduction
- Related Work
- Background
- Document Oriented Databases
- Column-Family Databases
- Data Integration Framework
- Mapping Language
- Dealing with Conflicting Data Using Attribute Preferences
- Query Processing
- Architecture
- Bridge Query Language
- Implementation
- Conclusions
- References
- An Energy-Efficient Concurrency Control Algorithm for Mobile Ad-Hoc Network Databases
- Introduction
- Related Work
- Proposed Architecture
- Mobile Node Functionality
- The Basis of Our Clustering Algorithm - MEW
- Cluster Formation
- Cluster Maintenance
- Proposed Concurrency Control Algorithm: SODA
- How SODA Works in a Centralized Database
- How SODA Works in a Clustered MANET Database
- Performance Evaluation
- Simulation Parameters and Performance Metrics
- Simulation Results
- Conclusion and Future Research
- References
- Web Applications
- An Ontology-Based Method for Duplicate Detection in Web Data Tables
- Introduction
- Preliminaries
- The Domain Termino-Ontological Resource
- Semantic Annotation of Web Data Tables Driven by a Domain TOR
- Reference Reconciliation Method (N2R)
- Duplicate Detection Method
- Definitions of Simple and Composed Concept Instances
- Two Similarity Measures to Compare Fuzzy Sets
- The Duplicate Detection Algorithm
- An Illustrative Example of Our Duplicate Detection Method
- Experimentation
- Conclusion
- References
- Approaches for Semantically Annotating and Discovering Scientific Observational Data
- Introduction
- Semantic Annotation and Discovery Framework
- Semantic Annotation
- Data Discovery Queries
- Implementation Strategies
- Query Evaluation over In-Place Database
- Query Evaluation over Materialized Database
- Executing Complex Discovery Queries
- Experimental Evaluation
- Related Work
- Conclusion
- References
- A Scalable Tag-Based Recommender System for New Users of the Social Web
- Introduction
- Related Work
- Clustered Social Ranking
- Clustering of Leaders
- Answering Users' Queries
- Simulation Setup
- Metrics
- Dataset
- Benchmarks
- Parameters Tuning
- Results
- Evaluation of Effectiveness: Precision and Recall
- Evaluation of Efficiency: Computational Complexity Analysis
- Conclusion
- References
- Author Index
System requirements
File format: PDF
Copy protection: Watermark-DRM (Digital Rights Management)
System requirements:
- Computer (Windows; MacOS X; Linux): Use the free software Adobe Reader, Adobe Digital Editions, or any other PDF viewer of your choice (see eBook Help).
- Tablet/Smartphone (Android; iOS): Install the free app Adobe Digital Editions or another reading app for eBooks, e.g., PocketBook (see eBook Help).
- E-reader: Bookeen, Kobo, Pocketbook, Sony, Tolino and many more (only limited: Kindle).
The file format PDF always displays a book page identically on any hardware. This makes PDF suitable for complex layouts such as those used in textbooks and reference books (images, tables, columns, footnotes). Unfortunately, on the small screens of e-readers or smartphones, PDFs are rather annoying, requiring too much scrolling.
This eBook uses Watermark-DRM, a „soft” copy protection. This means that there are no technical restrictions to prevent illegal distribution. However, there is a personalised watermark embedded in the eBook that can be used to identify the purchaser of the eBook in the event of misuse and to provide evidence for legal purposes.
For more information, see our eBook Help page.