Table of Contents

• Map-reduce extensions and recursive queriesFoto N. Afrati, Vinayak R. Borkar, Michael J. Carey, Neoklis Polyzotis, Jeffrey D. Ullman. 1-8 [doi]
• Database researchers: plumbers or thinkers?Gerhard Weikum. 9-10 [doi]
• Novel techniques to reduce search space in multiple minimum supports-based frequent pattern mining algorithmsR. Uday Kiran, P. Krishna Reddy. 11-20 [doi]
• Mining closed discriminative dyadic sequential patternsDavid Lo, Hong Cheng, Lucia. 21-32 [doi]
• Sequenced event set pattern matchingBruno Cadonna, Johann Gamper, Michael H. Böhlen. 33-44 [doi]
• GPX-matcher: a generic boolean predicate-based XPath expression matcherMohammad Sadoghi, Ioana Burcea, Hans-Arno Jacobsen. 45-56 [doi]
• An optimal strategy for monitoring top-k queries in streaming windowsDi Yang, Avani Shastri, Elke A. Rundensteiner, Matthew O. Ward. 57-68 [doi]
• Fast and accurate computation of equi-depth histograms over data streamsHamid Mousavi, Carlo Zaniolo. 69-80 [doi]
• Energy proportionality for disk storage using replicationJinoh Kim, Doron Rotem. 81-92 [doi]
• Caching query-biased snippets for efficient retrievalDiego Ceccarelli, Claudio Lucchese, Salvatore Orlando, Raffaele Perego, Fabrizio Silvestri. 93-104 [doi]
• Efficient and scalable data evolution with column oriented databasesZiyang Liu, Bin He, Hui-I Hsiao, Yi Chen. 105-116 [doi]
• Native support of multi-tenancy in RDBMS for software as a serviceOliver Schiller, Benjamin Schiller, Andreas Brodt, Bernhard Mitschang. 117-128 [doi]
• SLA-tree: a framework for efficiently supporting SLA-based decisions in cloud computingYun Chi, Hyun-Jin Moon, Hakan Hacigümüs, Jun ichi Tatemura. 129-140 [doi]
• On enhancing scalability for distributed RDF/S storesGeorge Tsatsanifos, Dimitris Sacharidis, Timos K. Sellis. 141-152 [doi]
• Answering tree pattern queries using views: a revisitJunhu Wang, Jiang Li, Jeffrey Xu Yu. 153-164 [doi]
• Dynamic reasoning on XML updatesFederico Cavalieri, Giovanna Guerrini, Marco Mesiti. 165-176 [doi]
• Algebraic incremental maintenance of XML viewsAngela Bonifati, Martin Hugh Goodfellow, Ioana Manolescu, Domenica Sileo. 177-188 [doi]
• Keyword-based, context-aware selection of natural language query patternsGiorgio Orsi, Letizia Tanca, Eugenio Zimeo. 189-200 [doi]
• Unified structure and content search for personal information management systemsWei Wang 0014, Amélie Marian, Thu D. Nguyen. 201-212 [doi]
• TopRecs: Top-k algorithms for item-based collaborative filteringMohammad Khabbaz, Laks V. S. Lakshmanan. 213-224 [doi]
• Efficient answering of set containment queries for skewed item distributionsManolis Terrovitis, Panagiotis Bouros, Panos Vassiliadis, Timos K. Sellis, Nikos Mamoulis. 225-236 [doi]
• Subspace clustering for indexing high dimensional data: a main memory index based on local reductions and individual multi-representationsStephan Günnemann, Hardy Kremer, Dominik Lenhard, Thomas Seidl. 237-248 [doi]
• On (not) indexing quadratic form distance by metric access methodsTomás Skopal, Tomás Bartos, Jakub Lokoc. 249-258 [doi]
• SeMiTri: a framework for semantic annotation of heterogeneous trajectoriesZhixian Yan, Dipanjan Chakraborty, Christine Parent, Stefano Spaccapietra, Karl Aberer. 259-270 [doi]
• Efficient execution plans for distributed skyline query processingJoão B. Rocha Jr., Akrivi Vlachou, Christos Doulkeridis, Kjetil Nørvåg. 271-282 [doi]
• Probabilistic range queries for uncertain trajectories on road networksKai Zheng, Goce Trajcevski, Xiaofang Zhou, Peter Scheuermann. 283-294 [doi]
• TAGs: scalable threshold-based algorithms for proximity computation in graphsApostolos Lyritsis, Apostolos N. Papadopoulos, Yannis Manolopoulos. 295-306 [doi]
• Projection for XML update optimizationMohamed Amine Baazizi, Nicole Bidoit, Dario Colazzo, Noor Malla, Marina Sahakyan. 307-318 [doi]
• Efficient reverse skyline retrieval with arbitrary non-metric similarity measuresPrasad M. Deshpande, Deepak P. 319-330 [doi]
• Fast random graph generationSadegh Nobari, Xuesong Lu, Panagiotis Karras, Stéphane Bressan. 331-342 [doi]
• Symmetrizations for clustering directed graphsVenu Satuluri, Srinivasan Parthasarathy. 343-354 [doi]
• Efficient discovery of frequent subgraph patterns in uncertain graph databasesOdysseas Papapetrou, Ekaterini Ioannou, Dimitrios Skoutas. 355-366 [doi]
• Finding closed frequent item sets by intersecting transactionsChristian Borgelt, Xiaoyuan Yang, Rubén Nogales-Cadenas, Pedro Carmona-Saez, Alberto D. Pascual-Montano. 367-376 [doi]
• Synopses for probabilistic data over large domainsNicholas D. Larusso, Ambuj K. Singh. 389-400 [doi]
• Data integration with dependent sourcesAnish Das Sarma, Xin Luna Dong, Alon Y. Halevy. 401-412 [doi]
• Constructing concept relation network and its application to personalized web searchKenneth Wai-Ting Leung, Hing Yuet Fung, Dik Lun Lee. 413-424 [doi]
• Effective and efficient sampling methods for deep web aggregation queriesFan Wang, Gagan Agrawal. 425-436 [doi]
• Making interval-based clustering rank-awareJulia Stoyanovich, Sihem Amer-Yahia, Tova Milo. 437-448 [doi]
• Predicting completion times of batch query workloads using interaction-aware models and simulationMumtaz Ahmad, Songyun Duan, Ashraf Aboulnaga, Shivnath Babu. 449-460 [doi]
• Memory-efficient frequent-itemset miningBenjamin Schlegel, Rainer Gemulla, Wolfgang Lehner. 461-472 [doi]
• Link-based hidden attribute discovery for objects on WebJiuming Huang, Haixun Wang, Yan Jia, Ariel Fuxman. 473-484 [doi]
• Real-time approximate Range Motif discovery & data redundancy removal algorithmAnkur Narang, Souvik Bhattacherjee. 485-496 [doi]
• Queries on dates: fast yet not blindJaroslaw Szlichta, Parke Godfrey, Jarek Gryz, Wenbin Ma, Przemyslaw Pawluk, Calisto Zuzarte. 497-502 [doi]
• Designing integration flows using hypercubesKevin Wilkinson, Alkis Simitsis. 503-508 [doi]
• Experience in Continuous analytics as a Service (CaaaS)Qiming Chen, Meichun Hsu, Hans Zeller. 509-514 [doi]
• SocialSearch: enhancing entity search with social network matchingGae-won You, Seung-won Hwang, Zaiqing Nie, Ji-Rong Wen. 515-519 [doi]
• Road crash proneness prediction using data miningRichi Nayak, Daniel Emerson, Justin Weligamage, Noppadol Piyatrapoomi. 521-526 [doi]
• Schema matching and mapping: from usage to evaluationAngela Bonifati, Yannis Velegrakis. 527-529 [doi]
• Big data and cloud computing: current state and future opportunitiesDivyakant Agrawal, Sudipto Das, Amr El Abbadi. 530-533 [doi]
• The hidden web, XML and the Semantic Web: scientific data management perspectivesFabian M. Suchanek, Aparna S. Varde, Richi Nayak, Pierre Senellart. 534-537 [doi]
• A probabilistic XML merging toolTalel Abdessalem, M. Lamine Ba, Pierre Senellart. 538-541 [doi]
• Taking the OXPath down the deep webAndrew Jon Sellers, Tim Furche, Georg Gottlob, Giovanni Grasso, Christian Schallhart. 542-545 [doi]
• SPRINT: ranking search results by pathsChristoph Böhm, Eyk Kny, Benjamin Emde, Ziawasch Abedjan, Felix Naumann. 546-549 [doi]
• A query optimization assistant for XPathHaris Georgiadis, Minas Charalambides, Vasilis Vassalos. 550-553 [doi]
• TPM: supporting pattern matching queries for road-network trajectory dataGook-Pil Roh, Seung-won Hwang. 554-557 [doi]
• QueryViz: helping users understand SQL queries and their patternsJonathan Danaparamita, Wolfgang Gatterbauer. 558-561 [doi]
• True language-level SQL debuggingTorsten Grust, Fabian Kliebhan, Jan Rittinger, Tom Schreiber. 562-565 [doi]
• SITAC: discovering ::::semantically identical temporally altering concepts:::: in text archivesAmal Chaminda Kaluarachchi, Debjani Roychoudhury, Aparna S. Varde, Gerhard Weikum. 566-569 [doi]
• Unraveling multi-dimensional data using pDViewLuigi Di Caro, Maria Luisa Sapino, K. Selçuk Candan. 570-573 [doi]
• RanKloud: a scalable ranked query processing framework on hadoopK. Selçuk Candan, Parth Nagarkar, Mithila Nagendra, Renwei Yu. 574-577 [doi]