15. DASFAA 2010: Tsukuba, Japan - Volume 1

Hiroyuki Kitagawa, Yoshiharu Ishikawa, Qing Li, Chiemi Watanabe (Eds.): Database Systems for Advanced Applications, 15th International Conference, DASFAA 2010, Tsukuba, Japan, April 1-4, 2010, Proceedings, Part I. Lecture Notes in Computer Science 5981 Springer 2010, ISBN 978-3-642-12025-1

Keynote Talks

Gerhard Weikum:
Knowledge on the Web: Robust and Scalable Harvesting of Entity-Relationship Facts. 1
Raghu Ramakrishnan:
Cloud Data Management @ Yahoo! 2

Lijiang Chen, Bin Cui, Linhao Xu, Heng Tao Shen:
Distributed Cache Indexing for Efficient Subspace Skyline Computation in P2P Networks. 3-18
Xiaolong Zhang, Lidan Shou, Kian-Lee Tan, Gang Chen:
iDISQUE: Tuning High-Dimensional Similarity Queries in DHT Networks. 19-33
Hock Hee Ang, Vivekanand Gopalkrishnan, Steven C. H. Hoi, Wee Keong Ng:
Adaptive Ensemble Classification in P2P Networks. 34-48

R. Uday Kiran, P. Krishna Reddy:
Mining Rare Association Rules in the Datasets with Widely Varying Items' Frequencies. 49-62
Yaron Gonen, Nurit Gal-Oz, Ran Yahalom, Ehud Gudes:
CAMLS: A Constraint-Based Apriori Algorithm for Mining Long Sequences. 63-77
Anne Laurent, Benjamin Négrevergne, Nicolas Sicard, Alexandre Termier:
PGP-mc: Towards a Multicore Parallel Approach for Mining Gradual Patterns. 78-84
Florian Verhein:
Generalised Rule Mining. 85-92

Zhifeng Bao, Jiaheng Lu, Tok Wang Ling, Liang Xu, Huayu Wu:
An Effective Object-Level XML Keyword Search. 93-109
Jiang Li, Junhu Wang:
Effectively Inferring the Search-for Node Type in XML Keyword Search. 110-124
Bo Ning, Chengfei Liu, Jeffrey Xu Yu, Guoren Wang, Jianxin Li:
Matching Top-k Answers of Twig Patterns in Probabilistic XML. 125-139

Ke Zhu, Ying Zhang, Xuemin Lin, Gaoping Zhu, Wei Wang:
NOVA: A Novel and Efficient Framework for Finding Subgraph Isomorphism Mappings in Large Graphs. 140-154
Ye Yuan, Lei Chen, Guoren Wang:
Efficiently Answering Probability Threshold-Based Shortest Path Queries over Uncertain Graphs. 155-170
Zheng Liu, Jeffrey Xu Yu:
Discovering Burst Areas in Fast Evolving Graphs. 171-185

Chang Sheng, Yu Zheng, Wynne Hsu, Mong-Li Lee, Xing Xie:
Answering Top-k Similar Region Queries. 186-201
Leyla Kazemi, Farnoush Banaei Kashani, Cyrus Shahabi, Ramesh Jain:
Efficient Approximate Visibility Query in Large Dynamic Environments. 202-217
Tao Chen, Markus Schneider, Ganesh Viswanathan, Wenjie Yuan:
The Objects Interaction Matrix for Modeling Cardinal Directions in Spatial Databases. 218-232
Mahady Hasan, Muhammad Aamir Cheema, Wenyu Qu, Xuemin Lin:
Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries. 233-249

Junhu Wang, Jeffrey Xu Yu:
Chasing Tree Patterns under Recursive DTDs. 250-261
Liang Xu, Tok Wang Ling, Zhifeng Bao, Huayu Wu:
Efficient Label Encoding for Range-Based Dynamic XML Labeling Schemes. 262-276
Jianhua Feng, Le Liu, Guoliang Li, Jianhui Li, Yuanhao Sun:
An Efficient Parallel PathStack Algorithm for Processing XML Twig Queries on Multi-core Systems. 277-291
Liru Zhang, Tadashi Ohmori, Mamoru Hoshi:
Keyword Search on Hybrid XML-Relational Databases Using XRjoin. 292-298
Erwin Leonardi, Sourav S. Bhowmick, Mizuho Iwaihara:
Efficient Database-Driven Evaluation of Security Clearance for Federated Access Control of Dynamic XML Documents. 299-306

Ira Assent, Hardy Kremer, Thomas Seidl:
Speeding Up Complex Video Copy Detection Queries. 307-321
Yuan Fang, Chee-Yong Chan:
Efficient Skyline Maintenance for Streaming Data with Partially-Ordered Domains. 322-336
Xuesong Lu, Wee Hyong Tok, Chedy Raïssi, Stéphane Bressan:
A Simple, Yet Effective and Efficient, Sliding Window Sampling Algorithm. 337-351
Di Wu, Yiping Ke, Jeffrey Xu Yu, Philip S. Yu, Lei Chen:
Detecting Leaders from Correlated Time Series. 352-367

Nguyen Hoang Vu, Hock Hee Ang, Vivekanand Gopalkrishnan:
Mining Outliers with Ensemble of Heterogeneous Detectors on Random Subspaces. 368-383
Lu Liu, Feida Zhu, Chen Chen, Xifeng Yan, Jiawei Han, Philip S. Yu, Shiqiang Yang:
Mining Diversity on Networks. 384-398
Syed Khairuzzaman Tanbeer, Chowdhury Farhan Ahmed, Byeong-Soo Jeong:
Mining Regular Patterns in Data Streams. 399-413

Eunjin Jung, Sukhyun Ahn, Seung-won Hwang:
k-ARQ: k-Anonymous Ranking Queries. 414-428
Sebastian Lehrack, Ingo Schmitt:
QSQL: Incorporating Logic-Based Retrieval Conditions into SQL. 429-443
Xingjie Liu, Mao Ye, Jianliang Xu, Yuan Tian, Wang-Chien Lee:
k-Selection Query over Uncertain Data. 444-459

Xinpeng Zhang, Yasuhito Asano, Masatoshi Yoshikawa:
Analysis of Implicit Relations on Wikipedia: Measuring Strength through Mining Elucidatory Objects. 460-475
Shi Feng, Daling Wang, Ge Yu, Binyang Li, Kam-Fai Wong:
Summarizing and Extracting Online Public Opinion from Blog Search Results. 476-490
Hiroaki Ohshima, Satoshi Oyama, Katsumi Tanaka:
Cloud as Virtual Databases: Bridging Private Databases and Web Services. 491-497
Wenyu Huo, Vassilis J. Tsotras:
Temporal Top-k Search in Social Tagging Sites Using Multiple Social Networks. 498-504

Emmanuel Müller, Philipp Kranen, Michael Nett, Felix Reidl, Thomas Seidl:
Air-Indexing on Error Prone Communication Channels. 505-519
Inchul Song, Yohan J. Roh, Myoung-Ho Kim:
Content-Based Multipath Routing for Sensor Networks. 520-534
Yinuo Zhang, Reynold Cheng, Jinchuan Chen:
Evaluating Continuous Probabilistic Queries Over Imprecise Sensor Data. 535-549

Sira Yongchareon, Chengfei Liu, Xiaohui Zhao, Marek Kowalkiewicz:
BPMN Process Views Construction. 550-564
Ke Deng, Liwei Wang, Xiaofang Zhou, Shazia Wasim Sadiq, Gabriel Pui Cheong Fung:
Active Duplicate Detection. 565-579
Yan Wang, Xiaoyong Du, Jiaheng Lu, Xiaofang Wang:
FlexTable: Using a Dynamic Relation Model to Store RDF Data. 580-594

Kaikuo Xu, Changjie Tang, Chuan Li, Yexi Jiang, Rong Tang:
An MDL Approach to Efficiently Discover Communities in Bipartite Network. 595-611
Zhenglu Yang, Jeffrey Xu Yu, Zheng Liu, Masaru Kitsuregawa:
Fires on the Web: Towards Efficient Exploring Historical Web Graphs. 612-626
Fang Wei, Weining Qian, Zhongchao Fei, Aoying Zhou:
Identifying Community Structures in Networks with Seed Expansion. 627-634
Kenneth Wai-Ting Leung, Dik Lun Lee:
Dynamic Agglomerative-Divisive Clustering of Clickthrough Data for Collaborative Web Search. 635-642

Last update Thu May 24 04:15:57 2012 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page