Database and Expert Systems Applications: 23rd International Conference, DEXA 2012, Vienna, Austria, September 3-6, 2012, Proceedings, Part II

Overview

This two volume set LNCS 7446 and LNCS 7447 constitutes the refereed proceedings of the 23rd International Conference on Database and Expert Systems Applications, DEXA 2012, held in Vienna, Austria, September 3-6, 2012.
The 49 revised full papers presented together with 37 short papers and 2 keynote talks were carefully reviewed and selected from 179 submissions. These papers discuss a range of topics including: database query processing, in particular XML queries; labelling of ...

See more details below
Paperback (2012)
$107.00
BN.com price
Other sellers (Paperback)
  • All (7) from $79.51   
  • New (5) from $79.51   
  • Used (2) from $103.17   
Sending request ...

Overview

This two volume set LNCS 7446 and LNCS 7447 constitutes the refereed proceedings of the 23rd International Conference on Database and Expert Systems Applications, DEXA 2012, held in Vienna, Austria, September 3-6, 2012.
The 49 revised full papers presented together with 37 short papers and 2 keynote talks were carefully reviewed and selected from 179 submissions. These papers discuss a range of topics including: database query processing, in particular XML queries; labelling of XML documents; computational efficiency, data extraction; personalization, preferences, and ranking; security and privacy; database schema evaluation and evolution; semantic Web; privacy and provenance; data mining; data streaming; distributed systems; searching and query answering; structuring, compression and optimization; failure, fault analysis, and uncertainty; predication, extraction, and annotation; ranking and personalisation; database partitioning and performance measurement; recommendation and prediction systems; business processes; social networking.

Read More Show Less

Product Details

Table of Contents

Consistent Query Answering Using Relational Databases through Argumentation.- Analytics-Driven Lossless Data Compression for Rapid In-situ Indexing, Storing, and Querying.- Prediction of Web User Behavior by Discovering Temporal Relational Rules from Web Log Data.- A Hybrid Approach to Text Categorization Applied to Semantic Annotation.-An Unsupervised Framework for Topological Relations Extraction from Geographic Documents.- Combination of Machine-Learning Algorithms for Fault Prediction in High-Precision Foundries.- A Framework for Conditioning Uncertain Relational Data.- Cause Analysis of New Incidents by Using Failure Knowledge Database.- Modeling and Querying Context-Aware Personal Information Spaces.- Ontology-Based Recommendation Algorithms for Personalized Education.- Towards Quantitative Constraints Ranking in Data Clustering.- A Topic-Oriented Analysis of Information Diffusion in a Blogosphere.- Trip Tweets Search by Considering Spatio-temporal Continuity of User Behavior.- Incremental Cosine Computations for Search and Exploration of Tag Spaces.- Impression-Aware Video Stream Retrieval System with Temporal Color-Sentiment Analysis and Visualization.- Dynamic Workload-Based Partitioning for Large-Scale Databases.- Dynamic Vertical Partitioning of Multimedia Databases Using Active Rules.- RTDW-bench: Benchmark for Testing Refreshing Performance of Real-Time Data Warehouse.- Middleware and Language for Sensor Streams.- Statistical Analysis of the owl:sameAs Network for Aligning Concepts in the Linking Open Data Cloud.- Paragraph Tables: A Storage Scheme Based on RDF Document Structure.- Continuously Mining Sliding Window Trend Clusters in a Sensor Network.- Generic Subsequence Matching Framework: Modularity, Flexibility, Efficiency.- R-Proxy Framework for In-DB Data-Parallel Analytics.- View Selection under Multiple Resource Constraints in a Distributed Context.- The Impact of Modes of Mediation on the Web Retrieval Process .- Querying a Semi-automated Data Integration System.- A New Approach for Date Sharing and Recommendation in Social Web.- A Framework for Time-Aware Recommendations.- A Hybrid Time-Series Link Prediction Framework for Large Social Network.- A Comparison of Top-k Temporal Keyword Querying over Versioned Text Collections.- An Efficient SQL Rewrite Approach for Temporal Coalescing in the Teradata RDBMS.- HIP: I nformation Passing for Optimizing Join-Intensive Data Processing Workloads on Hadoop.- All-Visible-k-Nearest-Neighbor Queries.- Algorithm for Term Linearizations of Aggregate Queries with Comparisons.- Evaluating Skyline Queries on Spatial Web Objects.-Alternative Query Optimization for Workload Management.- Online Top-k Similar Time-Lagged Pattern Pair Search in Multiple Time Series.-Improving the Performance for the Range Search on Metric Spaces Using a Multi-GPU Platform.- A Scheme of Fragment-Based Faceted Image Search.- Indexing Metric Spaces with Nested Forests.- Navigating in Complex Business Processes.- Combining Information and Activities in Business Processes.- Opinion Extraction Applied to Criteria.- SocioPath: Bridging the Gap between Digital and Social Worlds.-Detecting Privacy Violations in Multiple Views Publishing.- Anomaly Discovery and Resolution in MySQL Access Control Policies.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)