Database Systems for Advanced Applications: 15th International Conference, DASFAA 2010, Tsukuba, Japan, April 1-4, 2010, Proceedings, Part II

Overview

The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science research forum available.

The scope of LNCS, including its subseries LNAI and LNBI, spans the whole range of computer ...

See more details below
Paperback (2010)
$109.19
BN.com price
(Save 15%)$129.00 List Price
Other sellers (Paperback)
  • All (8) from $75.59   
  • New (8) from $75.59   
Sending request ...

Overview

The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science research forum available.

The scope of LNCS, including its subseries LNAI and LNBI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes

proceedings (published in time for the respective conference)

post-proceedings (consisting of thoroughly revised final full papers)

research monographs (which may be based on outstanding PhD work, research projects, technical reports, etc.)

More recently, several color-cover sublines have been added featuring, beyond a collection of papers, various added-value components; these sublines include

tutorials (textbook-like monographs or collections of lectures given at advanced courses)

state-of-art surveys (offering complete and mediated coverage of a topic)

hot topics (introducing emergent topics to the broader community)

In parallel to the printed book, each new volume is published electronically in LNCS Online.

Read More Show Less

Product Details

Table of Contents

Trajectories and Moving Objects

Bs-tree: A Self-tuning Index of Moving Objects Nan Chen Lidan Shou Gang Chen Ke Chen Yunjun Gao 1

Privacy-Preserving Location Publishing under Road-Network Constraints Dan Lin Sashi Gurung Wei Jiang Ali Hurson 17

Incremental Clustering for Trajectories Zhenhui Li Jae-Gil Lee Xiaolei Li Jiawei Han 32

NNCluster: An Efficient Clustering Algorithm for Road Network Trajectories Gook-Pil Roh Seung-won Hwang 47

Skyline Queries

Dynamic Skyline Queries in Large Graphs Lei Zou Lei Chen M. Tamer Özsu Dongyan Zhao 62

Top-k Combinatorial Skyline Queries I-Fang Su Yu-Chi Chung Chiang Lee 79

Extract Interesting Skyline Points in High Dimension Gabriel Pui Cheong Fung Wei Lu Jing Yang Xiaoyong Du Xiaofang Zhou 94

Transitivity-Preserving Skylines for Partially Ordered Domains Henning Köhler Kai Zheng Jing Yang Xiaofang Zhou 109

Finding the Most Desirable Skyline Objects Yunjun Gao Junfeng Hu Gencai Chen Chun Chen 116

Privacy and Security

Multiple Sensitive Association Protection in the Outsourced Database Xiao Jiang Jun Gao Tengjiao Wang Dongqing Yang 123

A Semantic Information Loss Metric for Privacy Preserving Publication Yu Liu Ting Wang Jianhua Feng 138

On t-Closeness with KL-Divergence and Semantic Privacy Chaofeng Sha Yi Li Aoying Zhou 153

Competitive Privacy: Secure Analysis on Integrated Sequence Data Raymond Chi-Wing Wong Eric Lo 168

Privacy-Preserving Publishing Data with Full Functional Dependencies Hui (Wendy) Wang Ruilin Liu 176

Data Streams

Scalable Splitting of Massive Data Streams Erik Zeitler Tore Risch 184

Constraint-Aware Complex Event Pattern Detection over Streams Ming Li Murali Mani Elke A. Rundensteiner Tao Lin 199

Attribute Outlier Detection over Data Streams Hui Cao Yongluan Zhou Lidan Shou Gang Chen 216

Similarity Search and Event Processing

ISIS: A New Approach for Efficient Similarity Search in Sparse Databases Bin Cui Jiakui Zhao Gao Cong 231

Highly Scalable Multiprocessing Algorithms for Preference-Based Database Retrieval Joachim Selke Christoph Lofi Wolf-Tilo Balke 246

IO3: Interval-Based Out-of-Order Event Processing in Pervasive Computing Chunjie Zhou Xiaofeng Meng 261

Peer-to-Peer Similarity Search Based on M-Tree Indexing Akrivi Vlachou Christos Doulkeridis Yannis Kotidis 269

Storage and Advanced Topics

Update Migration: An Efficient B+ Tree for Flash Storage Chang Xu Lidan Shou Gang Chen Cheng Yan Tianlei Hu 276

Optimizing Write Performance for Read Optimized Databases Jens Krueger Martin Grund Christian Tinnefeld Hasso Plattner Alexander Zeier Franz Faerber 291

Towards an Algebraic Framework for Querying Inductive Databases Hong-Cheu Liu Aditya Ghose John Zeleznikow 306

Efficient Aggregate Licenses Validation in DRM Amit Sachan Sabu Emmanuel Mohan S. Kankanhalli 313

Industrial

Development Procedure of the Cloud-Based Applications Masayoshi Hagiwara 320

Rapid Development of Web Applications by Introducing Database Systems with Web APIs Takeru Inoue Hiroshi Asakura Yukio Uematsu Hiroshi Sato Noriyuki Takahashi 327

A General Maturity Model and Reference Architecture for SaaS Service Seungseok Kang Jaeseok Myung Jongheum Yeon Seong-wook Ha Taehyung Cho Ji-man Chung Sang-goo Lee 337

Lazy View Maintenance for Social Networking Applications Keita Mikami Shinji Morishita Makoto Onizuka 347

Birds Bring Flues? Mining Frequent and High Weighted Cliques from Birds Migration Networks MingJie Tang Weihang Wang Yexi Jiang Yuanchun Zhou Jinyan Li Peng Cui Ying Liu Baoping Yan 359

Performance Improvement of OpenJPA by Query Dependency Analysis Miki Enoki Yosuke Ozawa Tamiya Onodera 370

Chimera: Stream-Oriented XML Filtering/Querying Engine Tatsuya Asai Shin-ichiro Tago Hiroya Inakoshi Seishi Okamoto Masayuki Takeda 380

Demo

Privacy and Anonymization as a Service: PASS Ghasem Heyrani-Nobari Omar Boucelma Stéphane Bressan 392

Visual Evaluation of Outlier Detection Models Elke Achtert Hans-Peter Kriegel Lisa Reichert Erich Schubert Remigius Wojdanowski Arthur Zimek 396

ADERIS: Adaptively Integrating RDF Data from SPARQL Endpoints Steven Lynden Isao Kojima Akiyoshi Matono Yusuke Tanimura 400

Outline of Community-Type Content Based on Wikipedia Akiyo Nadamoto Eiji Aramaki Takeshi Abekawa Yohei Murakami 404

BISCAY: Extracting Riding Context from Bike Ride Data Keiji Sugo Manabu Miyazaki Shin'ichi Konomi Masayuki Iwai Yoshito Tobe 408

SERPWatcher: A SERP Mining Tool as a Novel Social Survey Method in Sociology Yoshifumi Masunaga Naoko Oyama Chiemi Watanabe Kazunari Ito Kaoru Tachi Yoichi Miyama 412

Corona: Energy-Efficient Multi-query Processing in Wireless Sensor Networks Raymes Khoury Tim Dawborn Bulat Gafurov Glen Pink Edmund Tse Quincy Tse K. Almi'Ani Mohamed Gaber Uwe Röhm Bernhard Scholz 416

Aquiba: An Energy-Efficient Mobile Sensing System for Collaborative Human Probes Niwat Thepvilojanapong Shin'ichi Konomi Jun'ichi Yura Takeshi Iwamoto Susanna Pirttikangas Yasuyuki Ishida Masayuki Iwai Yoshito Tobe Hiroyuki Yokoyama Jin Nakazawa Hideyuki Tokuda 420

A Shoes-Integrated Sensing System for Context-Aware Human Probes Kazumasa Oshima Yasuyuki Ishida Shin'ichi Konomi Niwat Thepvilojanapong Yoshito Tobe 424

Digest Join: Expediting Joins on Solid-State Drives Shen Gao Yu Li Jianliang Xu Byron Choi Haibo Hu 428

A Large Scale Key-Value Store Based on Range-Key Skip Graph and Its Applications Susumu Takeuchi Jun Shinomiya Toru Shiraki Yoshimasa Ishi Yuuichi Teranishi Mikio Yoshida Shinji Shimojo 432

Answering Range-Aggregate Queries over Objects Generating Data Streams Marcin Gorawski Rafal Malczok 436

Real-Time Log Analysis Using Hitachi uCosminexus Stream Data Platform Yoshiyuki Hayashida Nobuhiro Ioki Naomi Arai Itaru Nishizawa 440

Anddy: A System for Author Name Disambiguation in Digital Library Jia Zhu Gabriel Pui Cheong Fung Xiaofang Zhou 444

A System for Keyword Search on Hybrid XML-Relational Databases Using XRjoin Liru Zhang Tadashi Ohmori mamoru Hoshi 448

MediaMatrix: A Video Stream Retrieval System with Mechanisms for Mining Contexts of Query Examples Shuichi Kurabayashi Yasushi Kiyoki 452

Application Developments in Mashup Framework for Selective Browsing Takakazu Nagamine Tomio Kamada 456

Retrieving System of Presentation Contents Based on User's Operations and Semantic Contexts Daisuke Kitayama Kazutoshi Sumiya 460

Fuzzy Keyword Search on Spatial Data Sattam Alsubaiee Chen Li 464

Adaptive Recommendation for Preferred Information and Browsing Action Based on Web-Browsing Behavior Kosuke Takano Kin Fun Li 468

BIDEL: An XML-Based System for Effective Fast Change Detection of Genomic and Proteomic Data Song Yang Sourav S. Bhowmick 472

DISTRO: A System for Detecting Global Outliers from Distributed Data Streams with Privacy Protection Ji Zhang Stijn Dekeyser Hua Wang Yanfeng Shu 477

Tutorials and Panels

Introduction to Social Computing Irwin King 482

Mining Moving Object, Trajectory and Traffic Data Jiawei Han Zhenhui Li Lu An Tang 485

Querying Large Graph Databases Yiping Ke James Cheng Jeffrey Xu Yu 487

Future Directions of Innovative Integration between Multimedia Information Services and Ubiquitous Computing Technologies Yasushi Kiyoki Virach Sornlertlamvanich 489

Author Index 491

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)