Table of Contents

• Provenance for database transformationsVal Tannen. 1 [doi]
• Scalable ontology-based information systemsIan Horrocks. 2 [doi]
• Feedback-driven result ranking and query refinement for exploring semi-structured data collectionsHuiping Cao, Yan Qi 0002, K. Selçuk Candan, Maria Luisa Sapino. 3-14 [doi]
• Beyond pages: supporting efficient, scalable entity search with dual-inversion indexTao Cheng, Kevin Chen-Chuan Chang. 15-26 [doi]
• Processing XPath queries with forward and downward axes over XML streamsMakoto Onizuka. 27-38 [doi]
• Correlation aware synchronization for near real time decision support systemsYing Yan, Wen-Syan Li. 39-50 [doi]
• Turbo-charging hidden database samplers with overflowing queries and skew reductionArjun Dasgupta, Nan Zhang, Gautam Das. 51-62 [doi]
• Region-based online promotion analysisTianyi Wu, Yizhou Sun, Cuiping Li, Jiawei Han. 63-74 [doi]
• The Data Cyclotron query processing schemeR. Goncalves, M. Kersten. 75-86 [doi]
• Gossiping personalized queriesXiao Bai, Marin Bertier, Rachid Guerraoui, Anne-Marie Kermarrec, Vincent Leroy. 87-98 [doi]
• Optimizing joins in a map-reduce environmentFoto N. Afrati, Jeffrey D. Ullman. 99-110 [doi]
• k-symmetry model for identity anonymization in social networksWentao Wu, Yanghua Xiao, Wei Wang, Zhenying He, Zhihui Wang. 111-122 [doi]
• Private record matching using differential privacyAli Inan, Murat Kantarcioglu, Gabriel Ghinita, Elisa Bertino. 123-134 [doi]
• The hardness and approximation algorithms for l-diversityXiaokui Xiao, Ke Yi, Yufei Tao. 135-146 [doi]
• Let SQL drive the XQuery workhorse (XQuery join graph isolation)Torsten Grust, Manuel Mayr, Jan Rittinger. 147-158 [doi]
• Statistics-based parallelization of XPath queries in shared memory systemsRajesh Bordawekar, Lipyeow Lim, Anastasios Kementsietsidis, Bryant Wei-Lun Kok. 159-170 [doi]
• Efficient physical operators for cost-based XPath executionHaris Georgiadis, Minas Charalambides, Vasilis Vassalos. 171-182 [doi]
• Adaptive join processing in pipelined plansKwanchai Eurviriyanukul, Norman W. Paton, Alvaro A. A. Fernandes, Steven J. Lynden. 183-194 [doi]
• BSkyTree: scalable skyline computation using a balanced pivot selectionJongwuk Lee, Seung-won Hwang. 195-206 [doi]
• Stream schema: providing and exploiting static metadata for data stream processingPeter M. Fischer, Kyumars Sheykh Esmaili, Renée J. Miller. 207-218 [doi]
• Warm cache costing: a feedback optimization technique for buffer pool aware costingH. S. Ramanujam, Edwin Seputis. 219-227 [doi]
• Position list word aligned hybrid: optimizing space and performance for compressed bitmapsFrançois Deliège, Torben Bach Pedersen. 228-239 [doi]
• Reducing metadata complexity for faster table summarizationK. Selçuk Candan, Mario Cataldi, Maria Luisa Sapino. 240-251 [doi]
• Anchoring millions of distinct reads on the human genome within secondsTien Huynh, Michail Vlachos, Isidore Rigoutsos. 252-262 [doi]
• Suffix tree construction algorithms on modern hardwareDimitris Tsirogiannis, Nick Koudas. 263-274 [doi]
• Splash: ad-hoc querying of data and statistical modelsLujun Fang, Kristen LeFevre. 275-286 [doi]
• Techniques for efficiently querying scientific workflow provenance graphsManish Kumar Anand, Shawn Bowers, Bertram Ludäscher. 287-298 [doi]
• Fine-grained and efficient lineage querying of collection-based workflow provenancePaolo Missier, Norman W. Paton, Khalid Belhajjame. 299-310 [doi]
• Lost source provenanceJing Zhang, H. V. Jagadish. 311-322 [doi]
• Bridging the gap between intensional and extensional query evaluation in probabilistic databasesAbhay Jha, Dan Olteanu, Dan Suciu. 323-334 [doi]
• Probabilistic threshold k nearest neighbor queries over moving objects in symbolic indoor spaceBin Yang 0002, Hua Lu, Christian S. Jensen. 335-346 [doi]
• Probabilistic path queries in road networks: traffic uncertainty aware path selectionMing Hua, Jian Pei. 347-358 [doi]
• A simple (yet powerful) algebra for pervasive environmentsYann Gripay, Frédérique Laforest, Jean-Marc Petit. 359-370 [doi]
• Self-selecting, self-tuning, incrementally optimized indexesGoetz Graefe, Harumi A. Kuno. 371-381 [doi]
• Minimizing database repros using language grammarsNicolas Bruno. 382-393 [doi]
• Efficient and scalable multi-geography route planningVidhya Balasubramanian, Dmitri V. Kalashnikov, Sharad Mehrotra, Nalini Venkatasubramanian. 394-405 [doi]
• Querying trajectories using flexible patternsMarcos R. Vieira, Petko Bakalov, Vassilis J. Tsotras. 406-417 [doi]
• Querying spatial patternsVishwakarma Singh, Arnab Bhattacharya, Ambuj K. Singh. 418-429 [doi]
• Indexing relations on the webSergio Luis Sardi Mergen, Juliana Freire, Carlos A. Heuser. 430-440 [doi]
• An execution environment for C-SPARQL queriesDavide Francesco Barbieri, Daniele Braga, Stefano Ceri, Michael Grossniklaus. 441-452 [doi]
• Rewrite techniques for performance optimization of schema matching processesEric Peukert, Henrike Berthold, Erhard Rahm. 453-464 [doi]
• Fast computation of SimRank for static and dynamic information networksCuiping Li, Jiawei Han, Guoming He, Xin Jin, Yizhou Sun, Yintao Yu, Tianyi Wu. 465-476 [doi]
• Probabilistic ranking over relationsLijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin. 477-488 [doi]
• Privacy preserving group nearest neighbor queriesTanzima Hashem, Lars Kulik, Rui Zhang. 489-500 [doi]
• Finding misplaced items in retail by clustering RFID dataLeonardo Weiss Ferreira Chaves, Erik Buchmann, Klemens Böhm. 501-512 [doi]
• Subsumption and complementation as data fusion operatorsJens Bleiholder, Sascha Szott, Melanie Herschel, Frank Kaufer, Felix Naumann. 513-524 [doi]
• HARRA: fast iterative hashed record linkage for large-scale data collectionsHung-sik Kim, Dongwon Lee. 525-536 [doi]
• Keyword search for data-centric XML collections with long text fieldsArash Termehchy, Marianne Winslett. 537-548 [doi]
• Fast ELCA computation for keyword queries on XML dataRui Zhou, Chengfei Liu, Jianxin Li. 549-560 [doi]
• Suggestion of promising result types for XML keyword searchJianxin Li, Chengfei Liu, Rui Zhou, Wei Wang. 561-572 [doi]
• Feedback-based annotation, selection and refinement of schema mappings for dataspacesKhalid Belhajjame, Norman W. Paton, Suzanne M. Embury, Alvaro A. A. Fernandes, Cornelia Hedeler. 573-584 [doi]
• PerK: personalized keyword search in relational databases through preferencesKostas Stefanidis, Marina Drosou, Evaggelia Pitoura. 585-596 [doi]
• Efficient computation of trade-off skylinesChristoph Lofi, Ulrich Güntzer, Wolf-Tilo Balke. 597-608 [doi]
• How to authenticate graphs without leakingAshish Kundu, Elisa Bertino. 609-620 [doi]
• Trustworthy vacuuming and litigation holds in long-term high-integrity records retentionRagib Hasan, Marianne Winslett. 621-632 [doi]
• Algorithm-safe privacy-preserving data publishingXin Jin, Nan Zhang, Gautam Das. 633-644 [doi]
• BronzeGate: real-time transactional data obfuscation for GoldenGateShenoda Guirguis, Alok Pareek. 645-650 [doi]
• Logging last resource optimization for distributed transactions in Oracle WebLogic serverTom Barnes, Adam Messinger, Paul Parkinson, Amit Ganesh, German Shegalov, Saraswathy Narayan, Srinivas Kareenhalli. 651-656 [doi]
• DEDUCE: at the intersection of MapReduce and stream processingVibhore Kumar, Henrique Andrade, Bugra Gedik, Kun-Lung Wu. 657-662 [doi]
• Aggregation of asynchronous electric power consumption time series knowing the integralRaja Chiky, Laurent Decreusefond, Georges Hébrail. 663-668 [doi]
• An experimental study of time-constrained aggregate queriesYing Hu, Wen-Chi Hou, Seema Sundara, Jagannathan Srinivasan. 669-674 [doi]
• Xbase: cloud-enabled information appliance for healthcareWen-Syan Li, Jianfeng Yan, Ying Yan, Jin Zhang. 675-680 [doi]
• A plan for OLAPBernhard Jaecksch, Wolfgang Lehner, Franz Faerber. 681-686 [doi]
• Augmenting OLAP exploration with dynamic advanced analyticsBenjamin Leonhardi, Bernhard Mitschang, Rubén Pulido, Christoph Sieb, Michael Wurst. 687-692 [doi]
• Advanced knowledge discovery on movement data with the GeoPKDD systemMirco Nanni, Roberto Trasarti, Chiara Renso, Fosca Giannotti, Dino Pedreschi. 693-696 [doi]
• Timely YAGO: harvesting, querying, and visualizing temporal knowledge from WikipediaYafang Wang, Mingjie Zhu, Lizhen Qu, Marc Spaniol, Gerhard Weikum. 697-700 [doi]
• PARINDA: an interactive physical designer for PostgreSQLCristina Maier, Debabrata Dash, Ioannis Alagiannis, Anastasia Ailamaki, Thomas Heinis. 701-704 [doi]
• ::::BIAEditor::::: matching process and operational data for a business impact analysisSylvia Radeschütz, Florian Niedermann, Wolfgang Bischoff. 705-708 [doi]
• Pattern detector: fast detection of suspicious stream patterns for immediate reactionIra Assent, Hardy Kremer, Stephan Günnemann, Thomas Seidl. 709-712 [doi]
• BP-Ex: a uniform query engine for business process execution tracesEran Balan, Tova Milo, Tal Sterenzy. 713-716 [doi]
• B-Fabric: the Swiss Army Knife for life sciencesCan Türker, Fuat Akal, Dieter Joho, Christian Panse, Simon Barkow-Oesterreicher, Hubert Rehrauer, Ralph Schlapbach. 717-720 [doi]
• FPGAs: a new point in the database design spaceRené Müller, Jens Teubner. 721-723 [doi]
• Querying the deep webAndrea Calì, Davide Martinenghi. 724-727 [doi]