Database Systems for Advanced Applications
17th International Conference, DASFAA 2012, Busan, South Korea, April 15-18, 2012, Proceedings, Part I
Published on 5. April 2012
XXII, 595 pages
978-3-642-29038-1 (ISBN)
Description
This two volume set LNCS 7238 and LNCS 7239 constitutes the refereed proceedings of the 17th International Conference on Database Systems for Advanced Applications, DASFAA 2012, held in Busan, South Korea, in April 2012.
The 44 revised full papers and 8 short papers presented together with 2 invited keynote papers, 8 industrial papers, 8 demo presentations, 4 tutorials and 1 panel paper were carefully reviewed and selected from a total of 159 submissions. The topics covered are query processing and optimization, data semantics, XML and semi-structured data, data mining and knowledge discovery, privacy and anonymity, data management in the Web, graphs and data mining applications, temporal and spatial data, top-k and skyline query processing, information retrieval and recommendation, indexing and search systems, cloud computing and scalability, memory-based query processing, semantic and decision support systems, social data, data mining.
The 44 revised full papers and 8 short papers presented together with 2 invited keynote papers, 8 industrial papers, 8 demo presentations, 4 tutorials and 1 panel paper were carefully reviewed and selected from a total of 159 submissions. The topics covered are query processing and optimization, data semantics, XML and semi-structured data, data mining and knowledge discovery, privacy and anonymity, data management in the Web, graphs and data mining applications, temporal and spatial data, top-k and skyline query processing, information retrieval and recommendation, indexing and search systems, cloud computing and scalability, memory-based query processing, semantic and decision support systems, social data, data mining.
More details
Other editions
Additional editions
Sang-goo Lee | Zhiyong Peng | Xiaofang Zhou
Database Systems for Advanced Applications
17th International Conference, DASFAA 2012, Busan, South Korea, April 15-18, 2012, Proceedings, Part I
Book
03/2012
1st Edition
Springer
€53.49
Shipment within 7-9 days
Content
- Title
- Preface
- Organization
- Table of Contents
- Keynote Talks
- Enabling Real Time Data Analysis
- A New Paradigm of Thinking and Architecture for Real-Time Information Processing at Fingertips
- Query Processing and Optimization
- Improving the Accuracy of Histograms for Geographic Data Objects
- Introduction
- Sketch of the Proposed Technique
- A Bichromatic Bucket Construction Algorithm
- Estimating the Selectivity Using a Bichromatic Bucket
- Application to Existing Histogram Methods
- The MinSkew Method
- The STHist Method
- Performance Evaluation
- Related Work
- Conclusion
- References
- Improving Online Aggregation Performance for Skewed Data Distribution
- Introduction
- Related Works
- Effect of Skewed Data Distribution
- Partition-Based Online Aggregation System
- System Overview
- Data Preprocessor
- Data Management
- Query Engine
- Estimators and Confidence Intervals for SUM, COUNT and AVG
- Queries for Single Relation
- Queries for Multi-relations
- Experiments
- Experimental Setup
- Performance Comparison
- Effect of Error Rate and Confidence
- Precision of Estimation
- Effect of Partition Size
- Preprocessing Performance
- Conclusions
- References
- A Relational-Based Approach for Aggregated Search in Graph Databases
- Introduction
- Preliminaries
- Graph Query Processing Algorithms
- Approximate Graph Matching
- Graph Aggregation for Query Processing Problem
- Relational-Based Approach for Aggregated Search in Distributed Databases
- Relational Encoding Schemes
- Common Edge Search
- Query Graph Decomposition
- Aggregated Search for Anonymous Query Graphs
- Performance Evaluation
- Conclusion
- References
- Data Semantics and Interoperability
- Discovery of Keys from SQL Tables
- Introduction
- Related Work
- The SQL Table Model
- Discovering Keys from Armstrong Tables
- Key Concepts
- Structure of Armstrong Tables
- Computation of Armstrong Tables
- Complexity Considerations
- Mining Keys from SQL Tables
- Mining by Pairwise Comparison of Rows
- Mining by Exploration of Hyper-Graph Transversals
- Empirical Measures of Usefulness
- Conclusion and Future Work
- References
- A Framework for Realizing Artifact-Centric Business Processes in Service-Oriented Architecture
- Introduction
- Artifact-Centric Approach to Business Process Modeling
- ACP Realization Framework
- Artifact-Centric Business Process Model
- ACP Executable Model
- Run-Time ACP Instances
- Implementation and Evaluation
- ACP System Architecture and Its Components
- Run-Time Execution
- Technical Evaluation
- Related Work and Discussion
- Conclusion and Future Work
- References
- Appearance-Order-Based Schema Matching
- Introduction
- Feature Matrices
- Scoring Functions and Search Algorithm
- Scoring Functions
- Search Algorithm
- Experimental Evaluation
- Related Work
- Conclusion
- References
- XML and Semi-structured Data I
- Fast Result Enumeration for Keyword Queries on XML Data
- Introduction
- Background and Related Work
- Result Enumeration
- Insight into the MaxMatch Algorithm
- The Tightest Matched Subtree
- The Algorithm
- Experimental Evaluation
- Experimental Setup
- Performance Comparison and Analysis
- Conclusions
- References
- Stars on Steroids: Fast Evaluation of Multi-source Star Twig Queries in RDBMS
- Introduction
- Related Work
- Multi-source Star Twig Pattern
- Multi-source Twig Pattern
- Star Twig Pattern
- Star Twig Query Evaluation
- Experimental Results
- Query Evaluation Times on Real Datasets
- Query Evaluation Times on Synthetic Datasets
- Conclusions and Future Work
- References
- Updating Typical XML Views
- Introduction
- Preliminaries
- View Definition Language
- The Update Language
- The View Update Problem
- Update Translation When Lt/t = and xc=xt
- Update Translation When Lt/t = and xc=xt
- Conclusion
- References
- XML and Semi-structured Data II
- Partitioned Indexes for Entity Search over RDF Knowledge Bases
- Introduction
- Related Work
- Partition-Based Entity Search
- The Entity Search Problem
- Schema-Valid Entities and Tables
- Schema-First Entity Search
- Efficient and Effective Entity Partitioning
- Entity Clustering
- Updates of Partitioned Indexes
- Experimental Study
- Experimental Setup
- Experiments on Analysis Clustering Results
- Query on BTC
- Conclusion
- References
- SINBAD: Towards Structure-Independent Querying of Common Neighbors in XML Databases
- Introduction
- Related Work
- Node Locality
- Intuition
- Defining Node Locality
- Neighborhood Axis
- Evaluation of Neighborhood Axis
- Evaluation of Locality
- Algorithm SINBAD
- Performance Study
- Conclusions and Future Work
- References
- Top-Down SLCA Computation Based on List Partition
- Introduction
- Preliminaries and Related Work
- Data Model
- Query Semantics and Related Algorithms
- Notations
- List Partition
- The Algorithm for SLCA Computation
- Experimental Evaluation
- Experimental Setup
- Performance Comparison and Analysis
- Conclusions
- References
- Efficiently Identifying Contributors for XML Keyword Search
- Introduction
- Preliminaries
- Definitions
- MaxMatch
- Data Structure
- kwMatch
- Dmatch-Range
- Algorithms
- Algorithm FindNextChild
- PruneMatch
- Analysis
- Experiments
- Conclusion
- References
- Data Mining and Knowledge Discovery I
- Semi-supervised Clustering of Graph Objects: A Subgraph Mining Approach
- Introduction
- Related Work
- Problem Formulation
- Semi-supervised Subgraph Mining
- Objective Function
- Subgraph Mining with Branch-and-Bound Pruning
- Redundancy-Aware Subgraph Features
- Semi-supervised Graph Object Clustering
- K-Means
- Semi-supervised Kernel-Kmeans
- Experimental Study
- Datasets
- Clustering Methodology and Evaluation Measure
- Performance on Graph Clustering
- Subgraph Mining Efficiency
- Conclusions
- References
- Plink-LDA: Using Link as Prior Information in Topic Modeling
- Introduction
- Problem Definition
- Methodology
- 1Intuition of Plink-LDA
- Our Model
- Experimental Design
- Datasets
- Tasks and Evaluation
- Related Work
- Conclusion
- References
- AnyOut: Anytime Outlier Detection on Streaming Data
- Introduction
- Related Work
- Detecting Outliers in Streaming Data
- AnyOut : Overview over Our Method
- Outlier Detection Using a Cluster Hierarchy
- AnyOut Confidence Measure for Constant Streams
- Experiments
- Level Analysis
- AnyOut Performance on Various Stream Settings
- Comparison to Baseline Methods
- Evolving Data Streams: Drift and Novelty
- Conclusion and Future Work
- References
- Data Mining and Knowledge Discovery II
- Ensemble Based Positive Unlabeled Learning for Time Series Classification
- Introduction
- LCLC Algorithm and Its Weakness
- The Proposed Technique En-LCLC
- Probabilistic Soft Labeling Using Diverse Classifiers
- Combining Classifiers Using Adaptive Fuzzy Nearest Neighbor Method
- Empirical Evaluation
- Experimental Data, Settings and Evaluation Metric
- Experimental Results
- Conclusions
- References
- Efficient Mining Regularly Frequent Patterns in Transactional Databases
- Introduction
- Background
- Proposed Model
- RF-tree: Design, Construction and Mining
- Structure of RF-tree
- Construction of RF-tree
- Mining Regularly Frequent Patterns
- Experimental Results
- Compactness of the RF-tree
- Execution Time of the RF-tree
- Scalability of the RF-tree
- Conclusions
- References
- Fast Tree-Based Mining of Frequent Itemsets from Uncertain Data
- Introduction and Related Work
- Background
- Our CUF-growth Algorithm and CUF-tree Structure
- Construction of the CUF-tree
- CUF-growth: Mining Frequent Itemsets from the CUF-tree
- Our CUF-growth* Algorithm: An Improvement to CUF-growth
- Experimental Results
- Compactness of the CUF-tree
- Runtime
- Number of False Positives
- Conclusions
- References
- Data Mining and Knowledge Discovery III
- On the Decidability and Complexity of Identity Knowledge Representation
- Introduction
- Related Work
- Formal Framework
- Minimising Knowledge Pattern
- The Containment Problem
- Complexity Analysis
- Conclusion
- References
- Privacy Preserving Mining Maximal Frequent Patterns in Transactional Databases
- Introduction
- Related Works
- Problem Definition
- Maximal Frequent Pattern Mining Problem
- Privacy Preserving Frequent Pattern Mining
- Proposed Approach
- The Privacy Preserving Framework
- Database Transformation and Decoding Technique
- Mining Maximal Frequent Pattern with Privacy Preserving
- Experimental Results
- Conclusion
- References
- Data Privacy against Composition Attack
- Introduction
- Problem Description and Motivation
- Contributions
- Fundamental Definitions
- Cases of Privacy Breach in Composition Attack
- Pros and Cons of Sampling in Composition Attack
- Pros and Cons of Generalization in Composition Attack
- (,)-Anonymization Model
- Privacy Analysis of (,)-Anonymization
- m-Invariance: Similar Model But Not Good in This Scenario
- Composition Based Generalization
- Phases
- Experiments
- Failure of Conventional Generalization Schemes
- (,)-Anonymization Evaluation
- Related Work
- Conclusion
- References
- Privacy and Anonymity
- Protecting Sensitive Relationships against Inference Attacks in Social Networks
- Introduction
- Motivation
- Challenges and Contributions
- Related Work
- Preliminaries and Problem Definition
- Preventing Link Inference Attacks
- A General Framework
- Preventing One-Step Link Inference Attacks
- Avoiding Cascaded Link Inference Attacks
- Experimental Evaluation
- Performance of Link Inference Preventing v.s. SimCN,
- Re-identification Power and Information Loss in CLIP
- Conclusion
- References
- You Can Walk Alone: Trajectory Privacy-Preserving through Significant Stays Protection
- Introduction
- Related Work
- Problem Statements
- Proposed Solutions
- Solutions Overview
- Stay Points Extraction
- Places Reconstruction
- Zones Construction
- Trajectory Anonymization
- Privacy and Utility Analysis
- Experiments
- Experimental Setup
- Measure of Data Utility
- Measure of Efficiency
- Conclusions
- References
- Semi-Edge Anonymity: Graph Publication when the Protection Algorithm Is Available
- Introduction
- Problem Description
- Safety Condition for Clustering
- Semi-Edge Anonymity Model
- Generation Algorithm
- Utility Analysis
- Experiments
- Utilities
- Clustering-Based Models
- Results
- Related Works
- Conclusion
- References
- Data Management in the Web
- On-the-Fly Generation of Facets as Navigation Signs for Web Objects
- Introduction
- Related Work
- Facets
- Definition of Facet and Object Sets for Classification
- Dynamic Facet Generation
- Effective Facets
- Problem Definition
- Presentation of Facets
- Generating a Facet Set
- Finding Facet Names
- Validation of Facets
- Scoring Facets
- Experiments
- Effectiveness of Generated Facets
- Evaluation of Faceted System for Image Search Results
- Faceted Navigation for Other Search Queries
- ``Multiple-Words''-Based Facets
- Conclusions
- References
- Searching for Quality Microblog Posts: Filtering and Ranking Based on Content Analysis and Implicit Links
- Introduction
- Related Work
- Tweet Quality Analysis
- Preliminaries
- Goal Definition: Defining Tweet Quality
- Quality-Based Tweet Filtering
- Classification Method
- Characterizing Tweets with Features
- Ranking Tweets by Quality
- Ranking Method
- Features for Ranking
- Experimental Evaluation
- Dataset
- Filtering Evaluation
- Ranking Evaluation
- Conclusion
- References
- HotDigg: Finding Recent Hot Topics from Digg
- Introduction
- Related Work
- Preliminaries
- Problem Formulation
- Our Generative Model for Digg
- Our Probabilistic Model
- The Likelihood of a Digg Article Collection
- The Maximum Likelihood Estimate
- Estimation of Model Parameters
- Finding Top-k1 Topics and Top-k2 Digg articles
- Experiments
- Implemented Algorithms
- Data Sets
- The Result of Topical Clustering
- Finding Top-k1 Popular Topics and Top-k2 Digg Articles
- Conclusion
- References
- Assessing Web Article Quality by Harnessing Collective Intelligence
- Introduction
- Related Work
- Building Alternative Context
- Training LDA Models Offline
- Determining Alternative Articles
- Extracting Dimension Baselines in Alternative Context
- Extracting Semantic Corpus for Each Alternative Article
- Synthesizing Quality Dimension Baselines
- Computing Quality Dimensions
- Computing Accuracy
- Computing Completeness
- Experiment Results
- Precision of Quality Ranking
- Comparison with Previous Work
- Conclusion and Future Work
- References
- Graphs and Data Mining Applications
- Context Sensitive Tag Expansion with Information Inference
- Introduction
- Related Work
- Image Tag Expansion
- Information Inference
- Preliminaries
- Conceptual Space Construction
- Concept Combination
- Information Inference
- Context Sensitive Tag Expansion
- Image Conceptual Space
- Tag Expansion with Information Inference
- Experiments
- Experimental Setup
- Experimental Results
- User-Involved Assessment
- Conclusion
- References
- Efficient Subgraph Similarity All-Matching
- Introduction
- Preliminaries
- Problem Statement
- A Hierarchical Framework
- Local Matching Algorithm
- Estimating Intermediate Matches
- Effective Search Order
- Efficient Local Matching
- Global Matching Algorithm
- Enumerating Global Patterns
- Matching Minimal Patterns
- Matching Non-minimal Patterns
- Effective Query Decomposition
- Performance Evaluation
- Varying Error Threshold and Query Settings
- Varying Data Graph Settings
- Comparison with SAPPER
- Related Work
- Conclusions
- References
- Efficient Algorithm for Mining Correlated Protein-DNA Binding Cores
- Introduction
- Related Work
- Problem Statement
- The Algorithm
- Frequent Sequence Tree
- Construction of FS-Tree
- Generating Association Rules
- Experimental Result
- Comparative Performance
- Applicability to Predicting Binding Cores
- Conclusion
- References
- A Novel Approach for Finding Alternative Clusterings Using Feature Selection
- Introduction
- Previous Works
- Non-data Transformation Based Approaches
- Data Transformation Based Approaches
- Materials and Methods
- Measurements
- Data Transformation and Clusterings' Dissimilarity
- Results
- Synthetic Datasets
- UCI Datasets
- Textual Data
- Discussions
- Conclusion
- References
- Temporal and Spatial Data I
- General Spatial Skyline Operator
- Introduction
- Preliminary
- Problem Definition
- Minimal Set Property
- Size Estimation
- Incremental Nearest Neighbor Technique
- All Neareast Neighbor(ANN) Based GSSKY Algorithm
- Efficient GSSKY Algorithm
- Motivation
- Algorithm
- Performance Evaluation
- GSSKY SIZE
- Efficiency
- Related Work
- Conclusion and Future Work
- References
- Top-k Similarity Join over Multi-valued Objects
- Introduction
- Background
- Problem Definition
- Preliminaries
- Framework
- -Quantile Top-k Similarity Join
- Pruning Techniques
- Overall Join Algorithm
- Experiment
- Overall Performance
- Evaluating Impacts by Different Settings
- I/O Costs
- Related Work
- Conclusion
- References
- Indexing Network Voronoi Diagrams
- Introduction
- Related Work
- Background
- Voronoi Diagrams
- Network Voronoi Diagrams
- Indexing Network Voronoi Diagrams
- Network Voronoi Diagram Construction
- Index Generation on Network Voronoi Diagram
- Experimental Evaluation
- Experimental Setup
- Results
- Conclusion
- References
- Temporal and Spatial Data II
- On Efficient Reverse k-Skyband Query Processing
- Introduction
- Related Work
- Problem Formulation
- RkSB Query Processing
- Branch-Bound-Based Reverse k-Skyband Algorithm
- Pre-computation-Based Reverse k-Skyband Algorithm
- Optimized PRkSB Algorithm
- Discussion
- Experimental Evaluation
- Effectiveness of Pruning Heuristics
- Results on RkSB Queries
- Conclusions
- References
- Co-spatial Searcher: Efficient Tag-Based Collaborative Spatial Search on Geo-social Network
- Introduction
- Related Work
- Problem Statement
- STR-Tree: A Refined Hybrid Indexing Mechanism
- Processing TkCoS Queries
- Query Algorithm
- Generating Candidate Node Sets of Search Space
- Experiments
- Experimental Setting
- Performance Evaluation
- Conclusions
- References
- Traffic Aware Route Planning in Dynamic Road Networks
- Introduction
- Related Work
- Traffic Aware Route Planning
- Preliminary
- Shortest Path Search (A* algorithm)
- Graph Reduction
- Road Condition Monitoring
- Efficient Path Query Processing Strategy
- Initialization
- Top-k Intermediate Destinations
- Route Search
- Monitoring and Update
- Putting Them together
- Experimental Study
- Conclusion and Future Work
- References
- Author Index
