Table of Contents

• Data integration flows for business intelligenceUmeshwar Dayal, Malú Castellanos, Alkis Simitsis, Kevin Wilkinson. 1-11 [doi]
• Optimized union of non-disjoint distributed data setsItay Dar, Tova Milo, Elad Verbin. 12-23 [doi]
• Shore-MT: a scalable storage manager for the multicore eraRyan Johnson, Ippokratis Pandis, Nikos Hardavellas, Anastasia Ailamaki, Babak Falsafi. 24-35 [doi]
• Workload-aware data partitioning in community-driven data gridsTobias Scholl, Bernhard Bauer, Jessica Müller, Benjamin Gufler, Angelika Reiser, Alfons Kemper. 36-47 [doi]
• Sequenced spatio-temporal aggregation in road networksIgor Timko, Michael H. Böhlen, Johann Gamper. 48-59 [doi]
• Processing probabilistic spatio-temporal range queries over moving objects with uncertaintyBruce S. E. Chung, Wang-Chien Lee, Arbee L. P. Chen. 60-71 [doi]
• Anonymizing moving objects: how to hide a MOB in a crowd?Roman Yarovoy, Francesco Bonchi, Laks V. S. Lakshmanan, Wendy Hui Wang. 72-83 [doi]
• Type-based categorization of relational attributesBabak Ahmadi, Marios Hadjieleftheriou, Thomas Seidl, Divesh Srivastava, Suresh Venkatasubramanian. 84-95 [doi]
• AlphaSum: size-constrained table summarization using value latticesK. Selçuk Candan, Huiping Cao, Yan Qi 0002, Maria Luisa Sapino. 96-107 [doi]
• Answering aggregate keyword queries on relational databases using minimal group-bysBin Zhou 0002, Jian Pei. 108-119 [doi]
• Rule-based multi-query optimizationMingsheng Hong, Mirek Riedewald, Christoph Koch, Johannes Gehrke, Alan J. Demers. 120-131 [doi]
• Managing long-running queriesStefan Krompass, Harumi A. Kuno, Janet L. Wiener, Kevin Wilkinson, Umeshwar Dayal, Alfons Kemper. 132-143 [doi]
• Continuous visible nearest neighbor queriesYunjun Gao, Baihua Zheng, Wang-Chien Lee, Gencai Chen. 144-155 [doi]
• Query ranking in probabilistic XML dataLijun Chang, Jeffrey Xu Yu, Lu Qin. 156-167 [doi]
• On rewriting XPath queries using viewsFoto N. Afrati, Rada Chirkova, Manolis Gergatsoulis, Benny Kimelfeld, Vassia Pavlaki, Yehoshua Sagiv. 168-179 [doi]
• Parallelization of XPath queries using multi-core processors: challenges and experiencesRajesh Bordawekar, Lipyeow Lim, Oded Shmueli. 180-191 [doi]
• GADDI: distance index based subgraph matching in biological networksShijie Zhang, Shirong Li, Jiong Yang. 192-203 [doi]
• A novel approach for efficient supergraph query processing on graph databasesShuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou. 204-215 [doi]
• Flexible query answering on graph-modeled dataFederica Mandreoli, Riccardo Martoglia, Giorgio Villani, Wilma Penzo. 216-227 [doi]
• Privacy-preserving data mashupNoman Mohammed, Benjamin C. M. Fung, Ke Wang, Patrick C. K. Hung. 228-239 [doi]
• On the comparison of microdata disclosure control algorithmsRinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell Whitley. 240-251 [doi]
• Detecting privacy violations in database publishing using disjoint queriesMillist W. Vincent, Mukesh K. Mohania, Mizuho Iwaihara. 252-262 [doi]
• On keys, foreign keys and nullable attributes in relational mapping systemsLuca Cabibbo. 263-274 [doi]
• A runtime approach to model-independent schema and data translationPaolo Atzeni, Luigi Bellomarini, Francesca Bugiotti, Giorgio Gianforme. 275-286 [doi]
• A methodology for preference-based personalization of contextual dataAntonio Miele, Elisa Quintarelli, Letizia Tanca. 287-298 [doi]
• Scalable stream join processing with expensive predicates: workload distribution and adaptation by time-slicingSong Wang, Elke A. Rundensteiner. 299-310 [doi]
• Indexing density models for incremental learning and anytime classification on data streamsThomas Seidl, Ira Assent, Philipp Kranen, Ralph Krieger, Jennifer Herrmann. 311-322 [doi]
• Exploiting the power of relational databases for efficient stream processingErietta Liarou, Romulo Goncalves, Stratos Idreos. 323-334 [doi]
• A sampling approach for XML query selectivity estimationCheng Luo, Zhewei Jiang, Wen-Chi Hou, Feng Yu, Qiang Zhu. 335-344 [doi]
• Recursion in XQuery: put your distributivity safety belt onLoredana Afanasiev, Torsten Grust, Maarten Marx, Jan Rittinger, Jens Teubner. 345-356 [doi]
• Expressive, yet tractable XML keysSven Hartmann, Sebastian Link. 357-367 [doi]
• It takes variety to make a world: diversification in recommender systemsCong Yu, Laks V. S. Lakshmanan, Sihem Amer-Yahia. 368-378 [doi]
• Supporting annotations on relationsMohamed Y. Eltabakh, Walid G. Aref, Ahmed K. Elmagarmid, Mourad Ouzzani, Yasin N. Silva. 379-390 [doi]
• Data clouds: summarizing keyword search results over structured dataGeorgia Koutrika, Zahra Mohammadi Zadeh, Hector Garcia-Molina. 391-402 [doi]
• Sample synopses for approximate answering of group-by queriesPhilipp Rösch, Wolfgang Lehner. 403-414 [doi]
• A query processor for prediction-based monitoring of data streamsSergio Ilarri, Ouri Wolfson, Eduardo Mena, Arantza Illarramendi, A. Prasad Sistla. 415-426 [doi]
• Flower-CDN: a hybrid P2P overlay for efficient query processing in CDNManal El Dick, Esther Pacitti, Bettina Kemme. 427-438 [doi]
• Zerber:::+R:::: top-k retrieval from a confidential indexSergej Zerr, Daniel Olmedilla, Wolfgang Nejdl, Wolf Siberski. 439-449 [doi]
• Efficient top-k count queries over imprecise duplicatesSunita Sarawagi, Vinay S. Deshpande, Sourabh Kasliwal. 450-461 [doi]
• The C-ND tree: a multidimensional index for hybrid continuous and non-ordered discrete data spacesChangqing Chen, Sakti Pramanik, Qiang Zhu, Watve Alok, Gang Qian. 462-471 [doi]
• G-hash: towards fast kernel-based similarity search in large graph databasesXiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald H. Lushington. 472-480 [doi]
• On-line exact shortest distance query processingJiefeng Cheng, Jeffrey Xu Yu. 481-492 [doi]
• Efficiently indexing shortest paths by exploiting symmetry in graphsYanghua Xiao, Wentao Wu, Jian Pei, Wei Wang 0009, Zhenying He. 493-504 [doi]
• Estimating the number of frequent itemsets in a large databaseRuoming Jin, Scott McCallen, Yuri Breitbart, David Fuhry, Dong Wang. 505-516 [doi]
• FOGGER: an algorithm for graph generator discoveryZhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou. 517-528 [doi]
• Neighbor-based pattern detection for windows over streaming dataDi Yang, Elke A. Rundensteiner, Matthew O. Ward. 529-540 [doi]
• Efficient constraint evaluation in categorical sequential pattern mining for trajectory databasesLeticia I. Gómez, Alejandro A. Vaisman. 541-552 [doi]
• Flexible and efficient querying and ranking on hyperlinked data sourcesRamakrishna Varadarajan, Vagelis Hristidis, Louiqa Raschid, Maria-Esther Vidal, Luis Ibáñez, Héctor Rodríguez-Drumond. 553-564 [doi]
• RankClus: integrating clustering with ranking for heterogeneous information network analysisYizhou Sun, Jiawei Han, Peixiang Zhao, Zhijun Yin, Hong Cheng, Tianyi Wu. 565-576 [doi]
• Evaluating very large datalog queries on social networksRoyi Ronen, Oded Shmueli. 577-587 [doi]
• A sequential indexing scheme for flash-based embedded systemsShaoyi Yin, Philippe Pucheral, Xiaofeng Meng. 588-599 [doi]
• Secondary bitmap indexes with vertical and horizontal partitioningGuadalupe Canahuate, Tan Apaydin, Ahmet Sacan, Hakan Ferhatosmanoglu. 600-611 [doi]
• Automating the loading of business process data warehousesMalú Castellanos, Alkis Simitsis, Kevin Wilkinson, Umeshwar Dayal. 612-623 [doi]
• Hiding distinguished ones into crowd: privacy-preserving publishing data with outliersHui (Wendy) Wang, Ruilin Liu. 624-635 [doi]
• An efficient online auditing approach to limit private data disclosureHaibing Lu, Yingjiu Li, Vijayalakshmi Atluri, Jaideep Vaidya. 636-647 [doi]
• Continuous privacy preserving publishing of data streamsBin Zhou 0002, Yi Han, Jian Pei, Bin Jiang, Yufei Tao, Yan Jia. 648-659 [doi]
• Top-k dominating queries in uncertain databasesXiang Lian, Lei Chen 0002. 660-671 [doi]
• Evaluating probability threshold k-nearest-neighbor queries over uncertain dataReynold Cheng, Lei Chen 0002, Jinchuan Chen, Xike Xie. 672-683 [doi]
• PROUD: a probabilistic approach to processing similarity queries over uncertain data streamsMi-Yen Yeh, Kun-Lung Wu, Philip S. Yu, Ming-Syan Chen. 684-695 [doi]
• Fair, effective, efficient and differentiated scheduling in an enterprise data warehouseChetan Gupta, Abhay Mehta, Song Wang, Umeshwar Dayal. 696-707 [doi]
• Efficient identification of starters and followers in social mediaMichael Mathioudakis, Nick Koudas. 708-719 [doi]
• A data damage tracking quarantine and recovery (DTQR) scheme for mission-critical database systemsKun Bai, Peng Liu. 720-731 [doi]
• Unrestricted wavelet synopses under maximum error boundChaoyi Pang, Qing Zhang, David P. Hansen, Anthony J. Maeder. 732-743 [doi]
• Distributed similarity search in high dimensions using locality sensitive hashingParisa Haghani, Sebastian Michel, Karl Aberer. 744-755 [doi]
• Multiplicative synopses for relative-error metricsPanagiotis Karras. 756-767 [doi]
• ::::LCS::::-Hist: taming massive high-dimensional data cube compressionAlfredo Cuzzocrea, Paolo Serafino. 768-779 [doi]
• Caching content-based queries for robust and efficient image retrievalFabrizio Falchi, Claudio Lucchese, Salvatore Orlando, Raffaele Perego, Fausto Rabitti. 780-790 [doi]
• An approach to detecting relevant updates to cached data using XML and active databasesEssam Mansour, Hagen Höpfner. 791-802 [doi]
• Self-tuning query mesh for adaptive multi-route query processingRimma V. Nehme, Elke A. Rundensteiner, Elisa Bertino. 803-814 [doi]
• Retrieving meaningful relaxed tightest fragments for XML keyword searchLingbo Kong, Rémi Gilleron, Aurélien Lemay. 815-826 [doi]
• Approximate substring selectivity estimationHongrae Lee, Raymond T. Ng, Kyuseok Shim. 827-838 [doi]
• Finding frequent co-occurring terms in relational keyword searchYufei Tao, Jeffrey Xu Yu. 839-850 [doi]
• Time-completeness trade-offs in record linkage using adaptive query processingRoald Lengu, Paolo Missier, Alvaro A. A. Fernandes, Giovanna Guerrini, Marco Mesiti. 851-861 [doi]
• Interactive query refinementChaitanya Mishra, Nick Koudas. 862-873 [doi]
• Continuous probabilistic nearest-neighbor queries for uncertain trajectoriesGoce Trajcevski, Roberto Tamassia, Hui Ding, Peter Scheuermann, Isabel F. Cruz. 874-885 [doi]
• Reverse k-nearest neighbor search in dynamic and general metric databasesElke Achtert, Hans-Peter Kriegel, Peer Kröger, Matthias Renz, Andreas Züfle. 886-897 [doi]
• Top-::::k:::: dominant web services under multi-criteria matchingDimitrios Skoutas, Dimitris Sacharidis, Alkis Simitsis, Verena Kantere, Timos K. Sellis. 898-909 [doi]
• Ranking objects based on relationships and fixed associationsAlbert Angel, Surajit Chaudhuri, Gautam Das, Nick Koudas. 910-921 [doi]
• Towards integrated and efficient scientific sensor data processing: a database approachJi Wu, Yongluan Zhou, Karl Aberer, Kian-Lee Tan. 922-933 [doi]
• Flexible and scalable storage management for data-intensive stream processingIrina Botan, Gustavo Alonso, Peter M. Fischer, Donald Kossmann, Nesime Tatbul. 934-945 [doi]
• A view selection algorithm with performance guaranteeNicolas Hanusse, Sofian Maabout, Radu Tofan. 946-957 [doi]
• Efficient provenance storage over nested data collectionsManish Kumar Anand, Shawn Bowers, Timothy M. McPhillips, Bertram Ludäscher. 958-969 [doi]
• Schema-conscious filtering of XML documentsPanu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen. 970-981 [doi]
• Provenance for nested subqueriesBoris Glavic, Gustavo Alonso. 982-993 [doi]
• A data model for trip planning in multimodal transportation systemsJoel Booth, A. Prasad Sistla, Ouri Wolfson, Isabel F. Cruz. 994-1005 [doi]
• Parsimonious temporal aggregationJuozas Gordevicius, Johann Gamper, Michael H. Böhlen. 1006-1017 [doi]
• Fast object search on road networksKen C. K. Lee, Wang-Chien Lee, Baihua Zheng. 1018-1029 [doi]
• Finding the influence set through skylinesXiaobing Wu, Yufei Tao, Raymond Chi-Wing Wong, Ling Ding, Jeffrey Xu Yu. 1030-1041 [doi]
• Efficient skyline computation in metric spaceDavid Fuhry, Ruoming Jin, Donghui Zhang. 1042-1051 [doi]
• Efficient skyline retrieval with arbitrary similarity measuresDeepak P, Prasad M. Deshpande, Debapriyo Majumdar, Raghu Krishnapuram. 1052-1063 [doi]
• Transactions on the multiversion B:::+:::-treeTuukka K. Haapasalo, Ibrahim Jaluta, Bernhard Seeger, Seppo Sippu, Eljas Soisalon-Soininen. 1064-1075 [doi]
• Efficient maintenance techniques for views over active documentsSerge Abiteboul, Pierre Bourhis, Bogdan Marinoiu. 1076-1087 [doi]
• Towards materialized view selection for distributed databasesLeonardo Weiss Ferreira Chaves, Erik Buchmann, Fabian Hueske, Klemens Böhm. 1088-1099 [doi]
• Personalizing entity detection and recommendation with a fusion of web log mining techniquesKathleen Tsoukalas, Bin Zhou 0002, Jian Pei, Davor Cubranic. 1100-1103 [doi]
• Estimating aggregates in time-constrained approximate queries in OracleYing Hu, Seema Sundara, Jagannathan Srinivasan. 1104-1107 [doi]
• BaseX & DeepFS joint storage for filesystem and databaseAlexander Holupirek, Christian Grün, Marc H. Scholl. 1108-1111 [doi]
• Xoom: a tool for zooming in and out of XML documentsMaya Ramanath, Kondreddi Sarath Kumar. 1112-1115 [doi]
• HIDE: heterogeneous information DE-identificationJames Gardner, Li Xiong, Kanwei Li, James J. Lu. 1116-1119 [doi]
• MVT: a schema mapping validation toolGuillem Rull, Carles Farré, Ernest Teniente, Toni Urpí. 1120-1123 [doi]
• A tool for mapping discovery over revealing schemasVerena Kantere, Dimos Bousounis, Timos K. Sellis. 1124-1127 [doi]
• GCIP: exploiting the generation and optimization of integration processesMatthias Böhm, Uwe Wloka, Dirk Habich, Wolfgang Lehner. 1128-1131 [doi]
• CourseCloud: summarizing and refining keyword searches over structured dataGeorgia Koutrika, Zahra Mohammadi Zadeh, Hector Garcia-Molina. 1132-1135 [doi]
• EventSummarizer: a tool for summarizing large event sequencesJerry Kiernan, Evimaria Terzi. 1136-1139 [doi]
• High-performance information extraction with AliBabaPeter Palaga, Long Nguyen, Ulf Leser, Jörg Hakenberg. 1140-1143 [doi]
• Exploiting similarity-aware grouping in decision support systemsYasin N. Silva, Muhammad U. Arshad, Walid G. Aref. 1144-1147 [doi]
• MarcoPolo: a community system for sharing and integrating travel information on mapsYueguo Chen, Su Chen, Yu Gu, Mei Hui, Feng Li, Chen Liu, Liangxu Liu, Beng Chin Ooi, Xiaoyan Yang, Dongxiang Zhang, Yuan Zhou. 1148-1151 [doi]
• NNexus: an automatic linker for collaborative web-based corporaJames Gardner, Aaron Krowne, Li Xiong. 1152-1155 [doi]
• Performance evaluation in database research: principles and experienceStefan Manegold, Ioana Manolescu. 1156 [doi]
• Geographic privacy-aware knowledge discovery and deliveryFosca Giannotti, Dino Pedreschi, Yannis Theodoridis. 1157-1158 [doi]
• Scalable OLAP and mining of information networksJiawei Han, Xifeng Yan, Philip S. Yu. 1159 [doi]