Table of Contents

• Extreme data miningSridhar Ramaswamy. 1-2 [doi]
• Extreme visualization: squeezing a billion records into a million pixelsBen Shneiderman. 3-12 [doi]
• Extreme streaming: business optimization driving algorithmic challengesWilliam O Connell. 13-14 [doi]
• Capacity constrained assignment in spatial databasesLeong Hou U, Man Lung Yiu, Kyriakos Mouratidis, Nikos Mamoulis. 15-28 [doi]
• ST:::2:::B-tree: a self-tunable spatio-temporal b:::+:::-tree index for moving objectsSu Chen, Beng Chin Ooi, Kian-Lee Tan, Mario A. Nascimento. 29-42 [doi]
• Scalable network distance browsing in spatial databasesHanan Samet, Jagan Sankaranarayanan, Houman Alborzi. 43-54 [doi]
• Discovering bucket orders from full rankingsJianlin Feng, Qiong Fang, Wilfred Ng. 55-66 [doi]
• Ad-hoc aggregations of ranked lists in the presence of hierarchiesNilesh Bansal, Sudipto Guha, Nick Koudas. 67-78 [doi]
• ARCube: supporting ranking aggregate queries in partially materialized data cubesTianyi Wu, Dong Xin, Jiawei Han. 79-92 [doi]
• Towards identity anonymization on graphsKun Liu, Evimaria Terzi. 93-106 [doi]
• Dynamic anonymization: accurate statistical analysis with privacy preservationXiaokui Xiao, Yufei Tao. 107-120 [doi]
• Private queries in location based services: anonymizers are not necessaryGabriel Ghinita, Panos Kalnis, Ali Khoshgozaran, Cyrus Shahabi, Kian-Lee Tan. 121-132 [doi]
• Near-optimal algorithms for shared filter evaluation in data stream systemsZhen Liu, Srinivasan Parthasarathy 0002, Anand Ranganathan, Hao Yang. 133-146 [doi]
• Efficient pattern matching over event streamsJagrati Agrawal, Yanlei Diao, Daniel Gyllstrom, Neil Immerman. 147-160 [doi]
• Scalable regular expression matching on data streamsAnirban Majumder, Rajeev Rastogi, Sriram Vanama. 161-172 [doi]
• CRD: fast co-clustering on large datasets utilizing sampling-based matrix decompositionFeng Pan, Xiang Zhang, Wei Wang 0010. 173-184 [doi]
• Outlier-robust clustering using independent componentsChristian Böhm, Christos Faloutsos, Claudia Plant. 185-198 [doi]
• Efficient EMD-based similarity search in multimedia databases via flexible dimensionality reductionMarc Wichterich, Ira Assent, Philipp Kranen, Thomas Seidl. 199-212 [doi]
• Monochromatic and bichromatic reverse skyline search over uncertain databasesXiang Lian, Lei Chen 0002. 213-226 [doi]
• Angle-based space partitioning for efficient parallel skyline computationAkrivi Vlachou, Christos Doulkeridis, Yannis Kotidis. 227-238 [doi]
• Categorical skylines for streaming dataNikos Sarkas, Gautam Das, Nick Koudas, Anthony K. H. Tung. 239-250 [doi]
• Building a database on S3Matthias Brantner, Daniela Florescu, David A. Graf, Donald Kossmann, Tim Kraska. 251-264 [doi]
• Paths to stardom: calibrating the potential of a peer-based data management systemMihai Lupu, Beng Chin Ooi, Y. C. Tay. 265-278 [doi]
• Just-in-time query retrieval over partially indexed data on structured P2P overlaysSai Wu, Jianzhong Li, Beng Chin Ooi, Kian-Lee Tan. 279-290 [doi]
• Efficient storage scheme and query processing for supply chain management using RFIDChun-Hee Lee, Chin-Wan Chung. 291-302 [doi]
• Relational-style XML queryTaro L. Saito, Shinichi Morishita. 303-314 [doi]
• Query biased snippet generation in XML searchYu Huang, Ziyang Liu, Yi Chen. 315-326 [doi]
• Cooperative XPath cachingKostas Lillis, Evaggelia Pitoura. 327-338 [doi]
• XML query optimization in the presence of side effectsGiorgio Ghelli, Nicola Onose, Kristoffer Høgsbro Rose, Jérôme Siméon. 339-352 [doi]
• Cost-based variable-length-gram selection for string collections to support approximate queries efficientlyXiaochun Yang, Bin Wang, Chen Li. 353-364 [doi]
• Approximate embedding-based subsequence matching of time seriesVassilis Athitsos, Panagiotis Papapetrou, Michalis Potamias, George Kollios, Dimitrios Gunopulos. 365-378 [doi]
• Sampling time-based sliding windows in bounded spaceRainer Gemulla, Wolfgang Lehner. 379-392 [doi]
• Mining relationships among interval-based events for classificationDhaval Patel, Wynne Hsu, Mong-Li Lee. 393-404 [doi]
• Graphs-at-a-time: query language and access methods for graph databasesHuahai He, Ambuj K. Singh. 405-418 [doi]
• Graph summarization with bounded errorSaket Navlakha, Rajeev Rastogi, Nisheeth Shrivastava. 419-432 [doi]
• Mining significant graph patterns by leap searchXifeng Yan, Hong Cheng, Jiawei Han, Philip S. Yu. 433-444 [doi]
• CSV: visualizing and mining cohesive subgraphsNan Wang, Srinivasan Parthasarathy, Kian-Lee Tan, Anthony K. H. Tung. 445-458 [doi]
• Privacy-MaxEnt: integrating background knowledge in privacy quantificationWenliang Du, Zhouxuan Teng, Zutao Zhu. 459-472 [doi]
• Preservation of proximity privacy in publishing numerical sensitive dataJiexing Li, Yufei Tao, Xiaokui Xiao. 473-486 [doi]
• Stream firewalling of xml constraintsMichael Benedikt, Alan Jeffrey, Ruy Ley-Wild. 487-498 [doi]
• Generating targeted queries for database testingChaitanya Mishra, Nick Koudas, Calisto Zuzarte. 499-510 [doi]
• Relational joins on graphics processorsBingsheng He, Ke Yang, Rui Fang, Mian Lu, Naga K. Govindaraju, Qiong Luo, Pedro V. Sander. 511-524 [doi]
• Optimizing complex queries with multiple relation instancesYu Cao, Gopal C. Das, Chee Yong Chan, Kian-Lee Tan. 525-538 [doi]
• Dynamic programming strikes backGuido Moerkotte, Thomas Neumann. 539-552 [doi]
• Adding magic to an optimising datalog compilerDamien Sereni, Pavel Avgustinov, Oege de Moor. 553-566 [doi]
• Efficient aggregation for graph summarizationYuanyuan Tian, Richard A. Hankins, Jignesh M. Patel. 567-580 [doi]
• Efficient algorithms for exact ranked twig-pattern matching over graphsGang Gou, Rada Chirkova. 581-594 [doi]
• Efficiently answering reachability queries on very large directed graphsRuoming Jin, Yang Xiang, Ning Ruan, Haixun Wang. 595-608 [doi]
• Minimization of tree pattern queries with constraintsDing Chen, Chee Yong Chan. 609-622 [doi]
• Query-based partitioning of documents and indexes for information lifecycle managementSoumyadeb Mitra, Marianne Winslett, Windsor W. Hsu. 623-636 [doi]
• Skippy: a new snapshot indexing method for time travel in the storage managerRoss Shaull, Liuba Shrira, Hao Xu. 637-648 [doi]
• OLAP on sequence dataEric Lo, Ben Kao, Wai-Shing Ho, Sau Dan Lee, Chun Kit Chui, David W. Cheung. 649-660 [doi]
• Improving suffix array locality for fast pattern matching on diskRanjan Sinha, Simon J. Puglisi, Alistair Moffat, Andrew Turpin. 661-672 [doi]
• Ranking queries on uncertain data: a probabilistic threshold approachMing Hua, Jian Pei, Wenjie Zhang, Xuemin Lin. 673-686 [doi]
• MCDB: a monte carlo approach to managing uncertain dataRavi Jampani, Fei Xu, Mingxi Wu, Luis Leopoldo Perez, Christopher M. Jermaine, Peter J. Haas. 687-700 [doi]
• Query efficiency in probabilistic XML modelsBenny Kimelfeld, Yuri Kosharovsky, Yehoshua Sagiv. 701-714 [doi]
• Event queries on correlated probabilistic streamsChristopher Ré, Julie Letchner, Magdalena Balazinska, Dan Suciu. 715-728 [doi]
• Serializable isolation for snapshot databasesMichael J. Cahill, Uwe Röhm, Alan David Fekete. 729-738 [doi]
• Middleware-based database replication: the gaps between theory and practiceEmmanuel Cecchet, George Candea, Anastasia Ailamaki. 739-752 [doi]
• On efficient top-k query processing in highly distributed environmentsAkrivi Vlachou, Christos Doulkeridis, Kjetil Nørvåg, Michalis Vazirgiannis. 753-764 [doi]
• Efficient bulk insertion into a distributed ordered tableAdam Silberstein, Brian F. Cooper, Utkarsh Srivastava, Erik Vee, Ramana Yerneni, Raghu Ramakrishnan. 765-778 [doi]
• Sampling cube: a framework for statistical olap over sampling dataXiaolei Li, Jiawei Han, Zhijun Yin, Jae-Gil Lee, Yizhou Sun. 779-790 [doi]
• Querying continuous functions in a database systemArvind Thiagarajan, Samuel Madden. 791-804 [doi]
• An efficient filter for approximate membership checkingKaushik Chakrabarti, Surajit Chaudhuri, Venkatesh Ganti, Dong Xin. 805-818 [doi]
• Finding frequent items in probabilistic dataQin Zhang, Feifei Li, Ke Yi. 819-832 [doi]
• Interactive generation of integrated schemasLaura Chiticariu, Phokion G. Kolaitis, Lucian Popa. 833-846 [doi]
• Pay-as-you-go user feedback for dataspace systemsShawn R. Jeffery, Michael J. Franklin, Alon Y. Halevy. 847-860 [doi]
• Bootstrapping pay-as-you-go data integration systemsAnish Das Sarma, Xin Dong, Alon Y. Halevy. 861-874 [doi]
• Supporting OLAP operations over imperfectly integrated taxonomiesYan Qi 0002, K. Selçuk Candan, Jun ichi Tatemura, Songting Chen, Fenglin Liao. 875-888 [doi]
• SQAK: doing more with keywordsSandeep Tata, Guy M. Lohman. 889-902 [doi]
• EASE: an effective 3-in-1 keyword search method for unstructured, semi-structured and structured dataGuoliang Li, Beng Chin Ooi, Jianhua Feng, Jianyong Wang, Lizhu Zhou. 903-914 [doi]
• A graph method for keyword-based selection of the top-K databasesQuang Hieu Vu, Beng Chin Ooi, Dimitris Papadias, Anthony K. H. Tung. 915-926 [doi]
• Keyword proximity search in complex data graphsKonstantin Golenberg, Benny Kimelfeld, Yehoshua Sagiv. 927-940 [doi]
• Configuration-parametric query optimization for physical design tuningNicolas Bruno, Rimma V. Nehme. 941-952 [doi]
• Automatic virtual machine configuration for database workloadsAhmed A. Soror, Umar Farooq Minhas, Ashraf Aboulnaga, Kenneth Salem, Peter Kokosielis, Sunil Kamath. 953-966 [doi]
• Column-stores vs. row-stores: how different are they really?Daniel J. Abadi, Samuel Madden, Nabil Hachem. 967-980 [doi]
• OLTP through the looking glass, and what we found thereStavros Harizopoulos, Daniel J. Abadi, Samuel Madden, Michael Stonebraker. 981-992 [doi]
• Efficient provenance storageAdriane Chapman, H. V. Jagadish, Prakash Ramanan. 993-1006 [doi]
• Efficient lineage tracking for scientific workflowsThomas Heinis, Gustavo Alonso. 1007-1018 [doi]
• Discovering topical structures of databasesWensheng Wu, Berthold Reinwald, Yannis Sismanis, Rajesh Manjrekar. 1019-1030 [doi]
• Toward best-effort information extractionWarren Shen, Pedro DeRose, Robert McCann, AnHai Doan, Raghu Ramakrishnan. 1031-1042 [doi]
• Handling data skew in parallel joins in shared-nothing systemsYu Xu, Pekka Kostamaa, Xin Zhou, Liang Chen. 1043-1052 [doi]
• Efficient and scalable statistics gathering for large databases in Oracle 11gSunil Chakkappen, Thierry Cruanes, Benoît Dageville, Linan Jiang, Uri Shaft, Hong Su, Mohamed Zaït. 1053-1064 [doi]
• Grouping and optimization of XPath expressions in DB2 pureXMLAndrey Balmin, Fatma Özcan, Ashutosh Singh, Edison Ting. 1065-1074 [doi]
• A case for flash memory ssd in enterprise database applicationsSang-Won Lee, Bongki Moon, Chanik Park, Jae-Myung Kim, Sang-Woo Kim. 1075-1086 [doi]
• .NET database programmability and extensibility in microsoft SQL serverJosé A. Blakeley, Vineet Rao, Isaac Kunen, Adam Prout, Mat Henaire, Christian Kleinerman. 1087-1098 [doi]
• Pig latin: a not-so-foreign language for data processingChristopher Olston, Benjamin Reed, Utkarsh Srivastava, Ravi Kumar, Andrew Tomkins. 1099-1110 [doi]
• Supporting table partitioning by reference in oracleGeorge Eadon, Eugene Inseok Chong, Shrikanth Shankar, Ananth Raghavan, Jagannathan Srinivasan, Souripriya Das. 1111-1122 [doi]
• SPADE: the system s declarative stream processing engineBugra Gedik, Henrique Andrade, Kun-Lung Wu, Philip S. Yu, Myungcheol Doo. 1123-1134 [doi]
• Query-aware partitioning for monitoring massive network data streamsTheodore Johnson, S. Muthu Muthukrishnan, Vladislav Shkapenyuk, Oliver Spatscheck. 1135-1146 [doi]
• Helping satisfy multiple objectives during a service desk conversationUllas Nambiar, Himanshu Gupta, Raju Balakrishnan, Mukesh K. Mohania. 1147-1158 [doi]
• Oracle database replayLeonidas Galanis, Supiti Buranawatanachoke, Romain Colle, Benoît Dageville, Karl Dias, Jonathan Klein, Stratos Papadomanolakis, Leng Leng Tan, Venkateshwaran Venkataramani, Yujun Wang, Graham Wood. 1159-1170 [doi]
• Damia: data mashups for intranet applicationsDavid E. Simmen, Mehmet Altinel, Volker Markl, Sriram Padmanabhan, Ashutosh Singh. 1171-1182 [doi]
• Effective and efficient semantic web data management over DB2Li Ma, Chen Wang, Jing Lu, Feng Cao, Yue Pan, Yong Yu. 1183-1194 [doi]
• Multi-tenant databases for software as a service: schema-mapping techniquesStefan Aulbach, Torsten Grust, Dean Jacobs, Alfons Kemper, Jan Rittinger. 1195-1206 [doi]
• Spatial indexing in microsoft SQL server 2008Yi Fang, Marc Friedman, Giri Nair, Michael Rys, Ana-Elisa Schmid. 1207-1216 [doi]
• SGL: a scalable language for data-driven gamesRobert Albright, Alan J. Demers, Johannes Gehrke, Nitin Gupta 0003, Hooyeon Lee, Rick Keilty, Gregory Sadowski, Ben Sowell, Walker M. White. 1217-1222 [doi]
• The DBO database systemFlorin Rusu, Fei Xu, Luis Leopoldo Perez, Mingxi Wu, Ravi Jampani, Chris Jermaine, Alin Dobra. 1223-1226 [doi]
• Stretch n shrink: resizing queries to user preferencesChaitanya Mishra, Nick Koudas. 1227-1230 [doi]
• Incorporating string transformations in record matchingArvind Arasu, Surajit Chaudhuri, Kris Ganjam, Raghav Kaushik. 1231-1234 [doi]
• SEMMO: a scalable engine for massively multiplayer online gamesNitin Gupta 0003, Alan J. Demers, Johannes Gehrke. 1235-1238 [doi]
• Orion 2.0: native support for uncertain dataSarvjeet Singh, Chris Mayfield, Sagar Mittal, Sunil Prabhakar, Susanne E. Hambrusch, Rahul Shah. 1239-1242 [doi]
• Building a global location search serviceVibhuti S. Sengar, Tanuja Joshi, Joseph M. Joy, Samarth Prakash. 1243-1246 [doi]
• Freebase: a collaboratively created graph database for structuring human knowledgeKurt D. Bollacker, Colin Evans, Praveen Paritosh, Tim Sturge, Jamie Taylor. 1247-1250 [doi]
• Querying and re-using workflows with VsTrailsCarlos Eduardo Scheidegger, Huy T. Vo, David Koop, Juliana Freire, Cláudio T. Silva. 1251-1254 [doi]
• HERMES: aggregative LBS via a trajectory DB engineNikos Pelekis, Elias Frentzos, Nikos Giatrakos, Yannis Theodoridis. 1255-1258 [doi]
• SchemaScope: a system for inferring and cleaning XML schemasGeert Jan Bex, Frank Neven, Stijn Vansummeren. 1259-1262 [doi]
• DiMaC: a system for cleaning disguised missing dataMing Hua, Jian Pei. 1263-1266 [doi]
• An xml index advisor for DB2Iman Elghandour, Ashraf Aboulnaga, Daniel C. Zilio, Fei Chiang, Andrey Balmin, Kevin S. Beyer, Calisto Zuzarte. 1267-1270 [doi]
• Clip: a tool for mapping hierarchical schemasAlessandro Raffio, Daniele Braga, Stefano Ceri, Paolo Papotti, Mauricio A. Hernández. 1271-1274 [doi]
• UQBE: uncertain query by example for web service mashupJun ichi Tatemura, Songting Chen, Fenglin Liao, Oliver Po, K. Selçuk Candan, Divyakant Agrawal. 1275-1280 [doi]
• Muse: a system for understanding and designing mappingsBogdan Alexe, Laura Chiticariu, Renée J. Miller, Daniel Pepper, Wang Chiew Tan. 1281-1284 [doi]
• NAGA: harvesting, searching and ranking knowledgeGjergji Kasneci, Fabian M. Suchanek, Georgiana Ifrim, Shady Elbassuoni, Maya Ramanath, Gerhard Weikum. 1285-1288 [doi]
• The Spicy system: towards a notion of mapping qualityAngela Bonifati, Giansalvatore Mecca, Alessandro Pappalardo, Salvatore Raunich, Gianvito Summa. 1289-1294 [doi]
• XArch: archiving scientific and reference dataHeiko Müller, Peter Buneman, Ioannis Koltsidas. 1295-1298 [doi]
• LearnPADS: automatic tool generation from ad hoc dataKathleen Fisher, David Walker, Kenny Qili Zhu. 1299-1302 [doi]
• Borealis-R: a replication-transparent stream processing system for wide-area monitoring applicationsJeong-Hyon Hwang, Sanghoon Cha, Ugur Çetintemel, Stanley B. Zdonik. 1303-1306 [doi]
• Tinycasper: a privacy-preserving aggregate location monitoring system in wireless sensor networksChi-Yin Chow, Mohamed F. Mokbel, Tian He. 1307-1310 [doi]
• The Demaq system: declarative development of distributed applicationsAlexander Böhm 0002, Erich Marth, Carl-Christian Kanne. 1311-1314 [doi]
• ProSem: scalable wide-area publish/subscribeBadrish Chandramouli, Jun Yang, Pankaj K. Agarwal, Albert Yu, Ying Zheng. 1315-1318 [doi]
• A demonstration of Cascadia through a digital diary applicationNodira Khoussainova, Evan Welbourne, Magdalena Balazinska, Gaetano Borriello, Garrett Cole, Julie Letchner, Yang Li, Christopher Ré, Dan Suciu, Jordan Walke. 1319-1322 [doi]
• From del.icio.us to x.qui.site: recommendations in social tagging sitesSihem Amer-Yahia, Alban Galland, Julia Stoyanovich, Cong Yu. 1323-1326 [doi]
• Enriching topic-based publish-subscribe systems with related contentRubi Boim, Tova Milo. 1327-1330 [doi]
• XRPC: distributed XQuery and update processing with heterogeneous XQuery enginesYing Zhang, Peter A. Boncz. 1331-1336 [doi]
• XQuery in the browserGhislain Fourny, Donald Kossmann, Tim Kraska, Markus Pilman, Daniela Florescu. 1337-1340 [doi]
• BibNetMiner: mining bibliographic information networksYizhou Sun, Tianyi Wu, Zhijun Yin, Hong Cheng, Jiawei Han, Xiaoxin Yin, Peixiang Zhao. 1341-1344 [doi]
• Provenance and scientific workflows: challenges and opportunitiesSusan B. Davidson, Juliana Freire. 1345-1350 [doi]
• Object/relational mapping 2008: hibernate and the entity data model (edm)Elizabeth J. O Neil. 1351-1356 [doi]
• Query answering techniques on uncertain and probabilistic data: tutorial summaryJian Pei, Ming Hua, Yufei Tao, Xuemin Lin. 1357-1364 [doi]
• Information fusion in wireless sensor networksEduardo Freire Nakamura, Antonio Alfredo Ferreira Loureiro. 1365-1372 [doi]
• Introduction to recommender systemsJoseph A. Konstan. 1373-1374 [doi]
• Corrigendum to efficient similarity search and classification via rank aggregation by Ronald Fagin, Ravi Kumar and D. Sivakumar (proc. SIGMOD 03)Alexandr Andoni, Ronald Fagin, Ravi Kumar, Mihai Patrascu, D. Sivakumar. 1375-1376 [doi]