Database and Expert Systems Applications

Name: Database and Expert Systems Applications | 26th International Conference, DEXA 2015, Valencia, Spain, September 1-4, 2015, Proceedings, Part II
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

26th International Conference, DEXA 2015, Valencia, Spain, September 1-4, 2015, Proceedings, Part II

Qiming Chen Abdelkader Hameurlain Farouk Toumani Roland Wagner Hendrik Decker(Editor)

Springer (Publisher)

Published on 10. August 2015

XXVI, 538 pages

E-Book

PDF with digital watermarking

System requirements

978-3-319-22852-5 (ISBN)

€53.49incl. 7% vat

System requirements

for PDF with digital watermarking

E-Book Single Licence

Available for download

Description

More details

Other editions

Content

Intro
Preface
Organization
Organization of the Special Section Globe 2015(8th International Conference on Data Management in Cloud, Grid and P2P Systems)
Contents - Part II
Contents - Part I
Knowledge Management and Consistency
A Logic Based Approach for Restoring Consistency in P2P Deductive Databases
1 Introduction
2 Background
3 P2P Systems: Syntax and Semantics
3.1 Syntax
3.2 The Minimal Weak Model Semantics
3.3 Prioritized Programs and Preferred Minimal Models
4 Computing the Minimal Weak Model Semantics
5 Complexity Results
References
Expert System with Web Interface Based on Logic of Plausible Reasoning
1 Introduction
2 Related Research
3 Outline of the Logic of Plausible Reasoning
4 LIIS System
5 Experimental Results
6 Conclusions and Further Works
References
Extending Knowledge-Based Profile Matching in the Human Resources Domain
1 Introduction
2 Profile Matching in Description Logic
3 Representation of Profile Knowledge
4 Matching Theory
4.1 Aggregates on Filters
4.2 Aggregates on Categories
4.3 Over-Qualification in Profile Matching
4.4 Blow-Up Operators
5 Conclusion and Further Work
References
Sensitive Business Process Modeling for Knowledge Management
Abstract
1 Introduction
2 Related Works
3 Sensitive Business Process
3.1 SBP Fundamentals
3.2 Representation Approaches for SBP
4 Proposition of a Business Process Meta-model for Knowledge Identification
5 A Practical Example
6 Conclusion and Future Works
References
Mobility, Privacy and Security
Partial Order Preserving Encryption Search Trees
Abstract
1 Introduction
2 Fully Order Preserving Encryption Schemes and Their Main Disadvantages
3 Relaxing the Full Order Preserving Property
3.1 Dealing with Duplicates
3.2 Supporting Limited Range Queries on Encrypted Data
3.3 Securing the Scheme Against a Strong Adversary
4 Conclusions
Acknowledgment
References
mobiSurround: An Auditory User Interface for Geo-Service Delivery
Abstract
1 Introduction
2 Previous Work
2.1 Location-Based Services
2.2 Mobile Spatial Interaction
3 mobiSurround
3.1 Geodata Mapping and Delivery Matrix
3.2 Content Modelling
4 Conclusions and Future Work
References
A Diversity-Seeking Mobile News App Based on Difference Analysis of News Articles
1 Introduction
2 Related Works
3 Entity-Oriented Ranking Measures of News Articles
3.1 Extraction of Entities and Entity-Related Descriptions
3.2 Ranking Measures
4 Diversity-Seeking Mobile News App
4.1 News Server: Gathering and Analyzing News Articles
4.2 News Client: Presenting News Articles
4.3 Context-Aware Re-ranking
5 Experiments
5.1 Crowdsource Experiment on Ranking
5.2 Experiment on Context-Aware Re-Ranking Method
6 Conclusion
References
KUR-Algorithm: From Position to Trajectory Privacy Protection in Location-Based Applications
Abstract
1 Introduction
2 Related Work
3 Preliminaries
4 The Proposed Solution
4.1 The Whole Scheme
4.2 KUR-Algorithm
5 Privacy Analysis
6 Summary
References
Data Streams, Web Services
Candidate Pruning Technique for Skyline Computation Over Frequent Update Streams
1 Introduction
2 Related Work
3 Preliminaries
3.1 Data Model and Its Update Model
3.2 Summarizing Consecutive Data Snapshots with Minimum Bounding Rectangles (MBRs)
3.3 Dominance Region and Anti-dominance Region
3.4 Pruning Candidates for Skyline Calculation Using MBRs
3.5 Changes of MBRs When Considering a New Data Snapshot
4 Proposed Algorithms
4.1 Overview
4.2 Intialization (t=0)
4.3 Data Updates at Snapshot t&0
4.4 Post-computation Maintenance
5 Performance Evaluation
5.1 Datasets
5.2 Comparison Methods
5.3 Results of the Synthetic Datasets
5.4 Results of the Real Datasets
6 Conclusion
References
Mining Frequent Closed Flows Based on Approximate Support with a Sliding Window over Packet Streams
1 Introduction
2 Related Work
3 ACL-SWin: Closed Flows Mining Over a Sliding Window
3.1 The Estimation Mechanism
3.2 The Data Structures of ACL-SWin
3.3 The ACL-SWin Algorithm
4 Experimental Results
5 Conclusion
References
D-FOPA: A Dynamic Final Object Pruning Algorithm to Efficiently Produce Skyline Points Over Data Streams
1 Introduction
2 Preliminaries
3 Motivating Example
4 Our Approach
4.1 D-FOPA: The Dynamic Final Object Pruning Algorithm
4.2 Lazy+: The Modified Lazy Strategy
5 Experimental Study
5.1 Experiment Configuration
5.2 Experiment Results
6 Related Work
7 Conclusions and Future Work
References
GraphEvol: A Graph Evolution Technique for Web Service Composition
1 Introduction
2 Related Work
3 GraphEvol
3.1 Graph Building Algorithm
3.2 Mutation
3.3 Crossover
3.4 Fitness Function
4 Experiments
5 Conclusions
References
Distributed, Parallel and Cloud Databases
Can Data Integration Quality Be Enhanced on Multi-cloud Using SLA?
1 Introduction
2 Data Integration Challenges: Classification Scheme
2.1 Searching and Screening Papers
2.2 Defining Classification Facets
3 Quantitative Analysis
4 Conclusion and Final Remarks
References
An Efficient Gear-Shifting Power-Proportional Distributed File System
1 Introduction
2 Related Work
3 System Description
3.1 NDCouplingHDFS Architecture
3.2 Accordion Data Placement
3.3 Gear Controller
3.4 Updated Data Reflection Process
4 Experimental Evaluation
4.1 Experimental Method
4.2 Framework of the Experiments
4.3 Experimental Results
5 Conclusion and Future Work
References
Highly Efficient Parallel Framework: A Divide-and-Conquer Approach
1 Introduction
2 The EM Algorithm
2.1 Hierarchical PMM
2.2 Parallelization Approach
3 Related Work
3.1 Shared Memory
3.2 Distributed Shared Memory
4 Load Balancing
4.1 FIFO Scheduler
4.2 Work-Stealing Scheduler
4.3 Divide and Conquer EM
4.4 Joint Spatial Database
5 Experimental Results
6 Discussion
7 Conclusion
References
Ontology-Driven Data Partitioning and Recovery for Flexible Query Answering
1 Introduction
1.1 Organization of the Article
2 Background and Example
2.1 Query Generalization
2.2 Ontology-Driven Partitioning
2.3 Derived Partitioning
3 Ontology-Driven Query Answering
3.1 Metadata and Test Dataset
3.2 Identifying Matching Clusters
3.3 Query Rewriting Strategies
4 Query Answering with Derived Partitions
5 Insertions
6 Deletions
7 Recovery
8 Related Work
8.1 Flexible Query Answering
8.2 Data Partitioning and Replication
9 Conclusion and Future Work
References
Information Retrieval
Detecting Near-Duplicate Documents Using Sentence Level Features
Abstract
1 Introduction
2 Related Work
3 Proposed Approach
3.1 Generating Surrogates of Two Documents
3.2 Finding Common Sentence Blocks in Two Documents
3.3 Validation
3.4 Similarity Calculation
3.5 Complexity Analysis
4 Experiments
4.1 Effectiveness
4.2 Efficiency
5 Conclusions
References
A Dwell Time-Based Technique for Personalised Ranking Model
Abstract
1 Introduction
2 Related Studies
3 Personalised Ranking Model
3.1 Pereliminaries
3.2 Problem Definition
4 Experiment Results and Discussions
4.1 Data Set
4.2 Data Analysis and Relevance Estimation Evaluation
5 Conclusions
References
An Evaluation of Diversification Techniques
1 Introduction
2 Diversification Techniques
3 Benchmark Methodology
3.1 Framework
3.2 Datasets
3.3 Evaluation Procedure
3.4 Benchmarking Tool
4 Experimental Evaluation
4.1 Computation Time
4.2 Effect of Number of Displayed Items
4.3 Stability of the Algorithms
4.4 Effects of #subtopics
4.5 Effects of Dissimilarity Distribution
4.6 Effects of Relevance Distribution
4.7 Effects of Subtopic Density Difference
5 Conclusions and Future Work
References
XML and Semi-structured Data
TOIX: Temporal Object Indexing for XML Documents
1 Introduction
2 Related Work
3 Index Structure Definitions
4 Temporal Twig Query Evaluation
4.1 TOIX Algorithm
4.2 Optimization
5 Experiments and Results
6 Conclusion
References
Expressing and Processing Path-Centric XML Queries
1 Introduction
2 SPath: Extending XQuery for Path-Centric Queries
2.1 SPath Expressions
2.2 XQuery Extension
3 Intra-path Aggregation: A Practical Case
3.1 Expression
3.2 Execution
4 Experiments
5 Related Work
6 Conclusion
References
A Logical Framework for XML Reference Specification
1 Introduction
2 Motivating Example
3 XHyb: Hybrid Logic for XML Reference Constraints
3.1 Syntax
3.2 Semantics
4 From XML to XHyb
5 Expressing XML Constraints by XHyb
6 Conclusions
References
XQuery Testing from XML Schema Based Random Test Cases
1 Introduction
1.1 Example
2 Test Case Generation
3 Property-Based Testing
3.1 Examples
4 Evaluation
5 Conclusions and Future Work
References
Data Partitioning, Indexing
Grid-File: Towards to a Flash Efficient Multi-dimensional Index
1 Introduction
2 Related Work
3 Background
3.1 Grid File
3.2 R-tree
4 Grid-File Implementation
4.1 Bucket Buffering and Replacement Policy
5 Performance Evaluation
5.1 Methodology
5.2 Results
6 Conclusions
References
Supporting Fluctuating Transactional Workload
1 Introduction
2 Related Works
3 Bundle Identification
4 System Overview and Data Grouping Process
4.1 System Overview and Notations
4.2 Grouping Data for Transaction Processing
5 Experimental Validation
5.1 Evaluating the Data Grouping Strategy
6 Conclusion
References
Indexing Multi-dimensional Data in Modular Data Centers
1 Introduction
2 Related Work
3 System Overview
3.1 Indexing Space
3.2 Mapping Scheme and Potential Index Range
3.3 Two-Layer Index Architecture
4 Index Construction
4.1 Dimension Selection
4.2 Publishing Scheme
4.3 Cost Model
5 Query Processing
5.1 Point Query
5.2 Range Query
5.3 KNN Query
6 Performance Evaluation
7 Conclusion
References
Data Mining IV, Applications
A Modified Tripartite Model for Document Representation in Internet Sociology
1 Introduction
2 Multipartite Models
2.1 Tripartite Model
2.2 Bipartite Model
2.3 Unipartite Model
3 Experiments
3.1 Model Construction
3.2 Opinion Mining
3.3 Clustering
4 Conclusion and Future Work
References
Improving Financial Time Series Prediction Through Output Classification by a Neural Network Ensemble
1 Introduction
2 Related Work
3 Proposed Ensemble
4 Evaluation
4.1 Experimental Setup
4.2 Experiments and Results
5 Conclusion and Future Work
References
Mining Strongly Correlated Intervals with Hypergraphs
1 Introduction
2 Related Work
3 Discovering Strongly Correlated Intervals with Hypergraphs
3.1 Hypergraph and Average Commute Time Distance
3.2 Hypergraph Representation of Numerical Data
3.3 Algorithm Description
4 Experimental Results
5 Conclusions
References
WWW and Databases
Diagnosis Model for an Organization Based on Social Network Analysis
1 Introduction
2 Related Work
3 Multi-facet Diagnosis Model
3.1 Survey
3.2 Generating Social Networks
4 Experiment
5 Conclusion and Future Work
References
Integration Method for Complex Queries Based on Hyponymy Relations
1 Introduction
2 Related Work
3 Web Page Clustering
4 Integrated Keywords from Complex Queries
4.1 Hyponymy Relation Database
4.2 Extracting Integrated Query Candidates
4.3 Integrated Query Detection
5 Experiments
5.1 Evaluation of Candidate Selection
5.2 Evaluation of Integrated Query Detection
6 Conclusions
References
An Expertise-Based Framework for Supporting Enterprise Applications Development
1 Introduction
2 Related Work
3 Motivating Scenario
4 Linked Data Model for Integrating Public and Enterprise Knowledge
4.1 Vocabularies Definition
4.2 Descriptors for Expert Finding
4.3 Descriptors Similarity
5 Collaboration Requests
5.1 Specializing Collaboration Requests
6 Architecture and Tool for Expert Finding
7 Simulation and Preliminary Evaluation
8 Conclusions and Future Work
References
Data Management Algorithms
A Linear Program for Holistic Matching: Assessment on Schema Matching Benchmark
1 Introduction
2 Related Works
3 A Linear Program for Holistic Matching: LP4HM
3.1 LP4HM Input Data
3.2 Description of LP4HM
4 Experimental Assessments
4.1 Average Results
4.2 Detailed Results
5 Conclusion
References
An External Memory Algorithm for All-Pairs Regular Path Problem
1 Introduction
2 Definitions
3 Overview of Our Algorithm
4 Details of the Algorithm
4.1 Processing Node List
4.2 Processing Contracted Graph
4.3 Pruning Edges
4.4 Correctness and I/O Cost
5 Experimental Results
6 Conclusion
References
Special Section Globe 2015 -- MapReduce Framework : Load Balancing, Optimization and Classification
An Efficient Solution for Processing Skewed MapReduce Jobs
1 Introduction
2 FP-Hadoop
2.1 Job Execution Model
2.2 IR and FR Functions
2.3 Dynamic Construction of IR Splits
2.4 Scheduling of Intermediate Tasks
3 Performance Evaluation
3.1 Setup
3.2 Scalability
3.3 Effect of Cluster Size
3.4 Overhead of IR Phase for Balanced Jobs
3.5 Comparison with SkewTune Using Different Queries
4 Related Work
5 Conclusion
References
MapReduce-DBMS: An Integration Model for Big Data Management and Optimization
Abstract
1 Introduction
2 Related Work
3 MapReduce Process
4 MapReduce-PostgreSQL Integration Model
4.1 Pushed Analysis of a Query's Execution
4.2 Queries Cost Estimation
4.3 Analysis: OLAP Queries Processing Smart Model
5 Experimental Results
6 Conclusion
References
A Travel Time Prediction Algorithm Using Rule-Based Classification on MapReduce
Abstract
1 Introduction
2 Related Work
2.1 Travel Time Prediction Method on Road Network
2.2 Hadoop MapReduce
3 Travel Time Prediction Algorithm on MapReduce
3.1 TMS-Based Classification Rule Generation
3.2 Velocity Class Measurement
3.3 Grid-Based Rule Indexing
3.4 Query Processing for Travel Time Prediction
4 Performance Analysis
5 Conclusion
References
Special Section Globe 2015 -- Security, Data Privacy and Consistency
Numerical SQL Value Expressions Over Encrypted Cloud Databases
Abstract
1 Introduction
2 THE Scheme
2.1 High-Level Architecture
2.2 Paillier Cryptosystem
2.3 THE Kernel Cryptosystem
2.4 Scalar Function Tables
2.5 Real Number Representation
2.6 Storage of SFTs and of EAD
2.7 Rewrite Rules for Operators
2.8 Rewrite Rules for Aggregate Functions
2.9 Security of THE Scheme
3 Performance Analysis
3.1 Processing Time
3.2 Storage for SFTs
3.3 SFT Upload and Update
3.4 Variants
4 Conclusion
Acknowledgements
References
A Privacy-Aware Framework for Decentralized Online Social Networks
1 Introduction
2 Related Work
3 Privacy-Aware Allocation of Users' Profiles on DOSN
3.1 Privacy Policy and Reference Examples
4 The Framework Architecture
5 Evaluation
6 Conclusion and Future Works
References
CaLibRe: A Better Consistency-Latency Tradeoff for Quorum Based Replication Systems
1 Introduction
2 LibRe
2.1 Targeted System
2.2 LibRe Registry
2.3 LibRe Messages
2.4 LibRe Protocol
2.5 LibRe Reliability
2.6 LibRe Cost
3 CaLibRe: Cassandra with LibRe
3.1 CaLibRe Performance Evaluation Using YCSB
4 Related Works
5 Conclusion and Future Works
References
Special Section Globe 2015 -- Query Rewriting and Streaming
QTor: A Flexible Publish/Subscribe Peer-to-Peer Organization Based on Query Rewriting
1 Introduction
2 Background and Problem Statement
2.1 System Organization Based on Query Rewriting
2.2 Problem Statement
3 QTor System
3.1 Graph of Communities
3.2 Building the Whole System
3.3 Participants' Spreading Over Communities
3.4 Inner Organization of a Community
4 QTor Flexibility
5 Experiments
6 Related Work
7 Conclusion and Perspectives
References
Model for Performance Analysis of Distributed Stream Processing Applications
1 Introduction
1.1 Motivation
1.2 Objectives
1.3 Related Work
2 Model
2.1 Workflow Model
2.2 System Model
2.3 Deployment Model
3 Performance Analysis
3.1 Colored Petri Nets
3.2 Model to CPN
4 Experiments
4.1 Experiment #1
4.2 Experiment #2
5 Conclusion
References
Author Index

System requirements

Save as PDF Copy link into clipboard

Schweitzer Fachinformationen

Database and Expert Systems Applications

Description

More details

Other editions

Additional editions

Content

System requirements