default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDProceedings of the VLDB Endowment, Volume 4
All papers published in volume 4 will be presented at the
Volume 4, Number 1, October 2010
- H. V. Jagadish:
Letter from the Editor-in-Chief. - Patrick Kling, M. Tamer Özsu, Khuzaima Daudjee:
Generating Efficient Execution Plans for Vertically Partitioned XML Databases. 1-11 - Xiang Lian
, Lei Chen:
A Generic Framework for Handling Uncertain Data with Local Correlations. 12-21 - Nodira Khoussainova, YongChul Kwon, Magdalena Balazinska, Dan Suciu:
SnipSuggest: Context-Aware Autocompletion for SQL. 22-33 - Alexandra Meliou, Wolfgang Gatterbauer, Katherine F. Moore, Dan Suciu:
The Complexity of Causality and Responsibility for Query Answers and non-Answers. 34-45
Volume 4, Number 2, November 2010
- Joseph M. Hellerstein:
Letter from the General PC Co-Chair. - Guy Sagy, Daniel Keren, Izchak Sharfman, Assaf Schuster:
Distributed Threshold Querying of General Functions by a Difference of Monotonic Representation. 46-57 - Nan Wang, Jingbo Zhang, Kian-Lee Tan, Anthony K. H. Tung:
On Triangulation-based Dense Neighborhood Graphs Discovery. 58-68 - Michael N. Rice, Vassilis J. Tsotras:
Graph Indexing of Road Networks for Shortest Path Queries with Label Restrictions. 69-80 - Li Qian, Kristen LeFevre, H. V. Jagadish:
CRIUS: User-Friendly Database Design. 81-92 - João B. Rocha-Junior, Akrivi Vlachou, Christos Doulkeridis, Kjetil Nørvåg:
Efficient Processing of Top-k Spatial Preference Queries. 93-104 - Martin Grund, Jens Krüger, Hasso Plattner, Alexander Zeier, Philippe Cudré-Mauroux, Samuel Madden:
HYRISE - A Main Memory Hybrid Storage Engine. 105-116 - Carlo Curino, Hyun Jin Moon, Alin Deutsch, Carlo Zaniolo:
Update Rewriting and Integrity Constraint Maintenance in a Schema Evolution Support System: PRISM++. 117-128 - Ermelinda Oro, Massimo Ruffolo, Steffen Staab:
SXPath - Extending XPath towards Spatial Querying on Web Documents. 129-140 - Mingxuan Yuan, Lei Chen, Philip S. Yu:
Personalized Privacy Protection in Social Networks. 141-150
Volume 4, Number 3, December 2010
- José A. Blakeley:
Letter from the VLDB2011 General PC Co-Chair. vi - Guilherme A. Toda, Eli Cortez, Altigran Soares da Silva, Edleno Silva de Moura:
A Probabilistic Approach for Automatically Filling Form-Based Web Interfaces. 151-160 - Panagiotis Papadimitriou, Hector Garcia-Molina, Ali Dasdan, Santanu Kolay:
Output URL Bidding. 161-172 - Bahman Bahmani, Abdur Chowdhury, Ashish Goel:
Fast Incremental and Personalized PageRank. 173-184 - Jongwuk Lee, Seung-won Hwang:
QSkycube: Efficient Skycube Computation using Point-Based Space Partitioning. 185-196 - Bin Liu, Chee-Yong Chan:
ZINC: Efficient Indexing for Skyline Computation. 197-207
Volume 4, Number 4, January 2011
- Nick Koudas:
Letter from the Research Track Co-Chair. vi - Vibhor Rastogi, Nilesh N. Dalvi, Minos N. Garofalakis:
Large-Scale Collective Entity Matching. 208-218 - Nilesh N. Dalvi, Ravi Kumar, Mohamed A. Soliman:
Automatic Wrappers for Large Scale Web Extraction. 219-230 - Xintian Yang, Srinivasan Parthasarathy, P. Sadayappan:
Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining. 231-242 - Jun Rao, Eugene J. Shekita, Sandeep Tata:
Using Paxos to Build a Scalable, Consistent, and Highly Available Datastore. 243-254 - Bolin Ding, Arnd Christian König:
Fast Set Intersection in Memory. 255-266
Volume 4, Number 5, February 2011
- Wolfgang Lehner:
Letter from the VLDB 2011 Research Track Co-Chair. vi - Aditya G. Parameswaran, Anish Das Sarma, Hector Garcia-Molina, Neoklis Polyzotis, Jennifer Widom:
Human-assisted graph search: it's okay to ask questions. 267-278 - Mohamed Yakout, Ahmed K. Elmagarmid, Jennifer Neville, Mourad Ouzzani, Ihab F. Ilyas:
Guided data repair. 279-289 - Petros Venetis, Hector Gonzalez, Christian S. Jensen, Alon Y. Halevy:
Hyper-local, directions-based ranking of places. 290-301 - Mehmet Levent Koc, Christopher Ré:
Incrementally maintaining classification using an RDBMS. 302-313 - Bingsheng He, Jeffrey Xu Yu:
High-throughput transaction executions on graphics processors. 314-325 - Zhao Cao, Charles Sutton, Yanlei Diao, Prashant J. Shenoy:
Distributed inference and query processing for RFID tracking and monitoring. 326-337
Volume 4, Number 6, March 2011
- Sunita Sarawagi:
Letter from the Research Track Co-Chair. vi - Hongrae Lee, Raymond T. Ng, Kyuseok Shim:
Similarity Join Size Estimation using Locality Sensitive Hashing. 338-349 - Ziyang Liu, Sivaramakrishnan Natarajan, Yi Chen:
Query Expansion Based on Clustered Results. 350-361 - Debabrata Dash, Neoklis Polyzotis, Anastasia Ailamaki:
CoPhy: A Scalable, Portable, and Interactive Index Advisor for Large Workloads. 362-372 - Feng Niu, Christopher Ré, AnHai Doan, Jude W. Shavlik:
Tuffy: Scaling up Statistical Inference in Markov Logic Networks using an RDBMS. 373-384 - Eaman Jahani, Michael J. Cafarella, Christopher Ré:
Automatic Optimization for MapReduce Programs. 385-396 - De-Nian Yang, Yi-Ling Chen, Wang-Chien Lee, Ming-Syan Chen:
On Social-Temporal Group Query with Acquaintance Constraint. 397-408
Volume 4, Number 7, April 2011
- Uwe Röhm:
Letter from the VLDB Proceedings Chair. vi - Hoa Nguyen, Ariel Fuxman, Stelios Paparizos, Juliana Freire, Rakesh Agrawal:
Synthesizing Products for Online Catalogs. 409-418 - Avrilia Floratou, Jignesh M. Patel, Eugene J. Shekita, Sandeep Tata:
Column-Oriented Storage Techniques for MapReduce. 419-429 - David B. Lomet, Kostas Tzoumas, Michael J. Zwilling:
Implementing Performance Competitive Logical Recovery. 430-439 - Ashwin Machanavajjhala, Aleksandra Korolova, Atish Das Sarma:
Personalized Social Recommendations - Accurate or Private? 440-450 - Gabriele Capannini, Franco Maria Nardini, Raffaele Perego, Fabrizio Silvestri:
Efficient Diversification of Web Search Results. 451-459 - Gianmarco De Francisci Morales, Aristides Gionis, Mauro Sozio:
Social Content Matching in MapReduce. 460-469
Volume 4, Number 8, May 2011
- Naiyong Ao, Fan Zhang, Di Wu, Douglas S. Stones, Gang Wang, Xiaoguang Liu, Jing Liu, Sheng Lin:
Efficient Parallel Lists Intersection and Index Compression Algorithms using Graphics Processing Units. 470-481 - Lei Zou, Jinghui Mo, Lei Chen, M. Tamer Özsu, Dongyan Zhao:
gStore: Answering SPARQL Queries via Subgraph Matching. 482-493 - Sudipto Das, Shoji Nishimura, Divyakant Agrawal, Amr El Abbadi:
Albatross: Lightweight Elasticity in Shared Storage Databases for the Cloud using Live Data Migration. 494-505 - Sarana Nutanong, Edwin H. Jacox, Hanan Samet:
An Incremental Hausdorff Distance Calculation Algorithm. 506-517 - Barbara T. Blaustein, Adriane Chapman, Len Seligman, M. David Allen, Arnon Rosenthal:
Surrogate Parenthood: Protected and Informative Graphs. 518-527
Volume 4, Number 9, June 2011
- Sunita Sarawagi:
Letter from the VLDB 2011 Research Track Co-Chair. vi - Petros Venetis, Alon Y. Halevy, Jayant Madhavan, Marius Pasca, Warren Shen, Fei Wu, Gengxin Miao, Chung Wu:
Recovering Semantics of Tables on the Web. 528-538 - Thomas Neumann:
Efficiently Compiling Efficient Query Plans for Modern Hardware. 539-550 - Ruoming Jin, Lin Liu, Bolin Ding, Haixun Wang:
Distance-Constraint Reachability Computation in Uncertain Graphs. 551-562 - Yun Chi, Hyun Jin Moon, Hakan Hacigümüs:
iCBS: Incremental Costbased Scheduling under Piecewise Linear SLAs. 563-574 - Mohamed Y. Eltabakh, Yuanyuan Tian, Fatma Özcan, Rainer Gemulla, Aljoscha Krettek, John McPherson:
CoHadoop: Flexible Data Placement and Its Exploitation in Hadoop. 575-585 - Stratos Idreos, Stefan Manegold, Harumi A. Kuno, Goetz Graefe:
Merging What's Cracked, Cracking What's Merged: Adaptive Indexing in Main-Memory Column-Stores. 585-597
Volume 4, Number 10, July 2011
- Uwe Röhm:
Letter from the VLDB 2011 Proceedings Chair. vi - Chonghai Wang, Li-Yan Yuan, Jia-Huai You, Osmar R. Zaïane, Jian Pei:
On Pruning for Top-K Ranking in Uncertain Databases. 598-609 - Ippokratis Pandis, Pinar Tözün, Ryan Johnson, Anastasia Ailamaki:
PLP: Page Latch-free Shared-everything OLTP. 610-621 - Jiannan Wang, Guoliang Li, Jeffrey Xu Yu, Jianhua Feng:
Entity Matching: How Similar Is Similar. 622-633 - Di Wang, Elke A. Rundensteiner, Richard T. Ellison:
Active Complex Event Processing over Event Streams. 634-645 - Ceren Budak, Divyakant Agrawal, Amr El Abbadi:
Structural Trend Analysis for Online Social Networks. 646-656 - Hideaki Kimura, Vivek R. Narasayya, Manoj Syamala:
Compression Aware Physical Database Design. 657-668 - Thomas Bernecker, Tobias Emrich, Hans-Peter Kriegel, Matthias Renz, Stefan Zankl, Andreas Züfle:
Efficient Probabilistic Reverse Nearest Neighbor Query Processing on Uncertain Data. 669-680 - Mehdi Kargar, Aijun An:
Keyword Search in Graphs: Finding r-cliques. 681-692
Volume 4, Number 11, August 2011
- Tim O'Reilly:
Towards a Global Brain. 693 - David Campbell:
Is It Still "Big Data" If It Fits In My Pocket? 694 - Philip A. Bernstein, Jayant Madhavan, Erhard Rahm:
Generic Schema Matching, Ten Years Later. 695-701 - Gang Chen, Hoang Tam Vo, Sai Wu, Beng Chin Ooi, M. Tamer Özsu:
A Framework for Supporting DBMS-like Indexes in the Cloud. 702-713 - Liwen Sun, Reynold Cheng, Xiang Li, David W. Cheung, Jiawei Han:
On Link-based Similarity Join. 714-725 - Chenghui Ren, Eric Lo, Ben Kao, Xinjie Zhu, Reynold Cheng:
On Querying Historical Evolving Graph Sequences. 726-737 - Umar Farooq Minhas, Shriram Rajagopalan, Brendan Cully, Ashraf Aboulnaga, Kenneth Salem, Andrew Warfield:
RemusDB: Transparent High Availability for Database Systems. 738-748 - Simon Razniewski, Werner Nutt:
Completeness of Queries over Incomplete Databases. 749-760 - Alexios Kotsifakos, Panagiotis Papapetrou, Jaakko Hollmén, Dimitrios Gunopulos:
A Subsequence Matching with Gaps-Range-Tolerances Framework: A Query-By-Humming Application. 761-771 - Tingjian Ge, Zheng Li:
Approximate Substring Matching over Uncertain Strings. 772-782 - Hyungsoo Jung, Hyuck Han, Alan D. Fekete, Uwe Röhm:
Serializable Snapshot Isolation for Replicated Databases in High-Update Scenarios. 783-794 - Jason Sewall, Jatin Chhugani, Changkyu Kim, Nadathur Satish, Pradeep Dubey:
PALM: Parallel Architecture-Friendly Latch-Free Modifications to B+ Trees on Many-Core Processors. 795-806 - Feida Zhu, Qiang Qu, David Lo, Xifeng Yan, Jiawei Han, Philip S. Yu:
Mining Top-K Large Structural Patterns in a Massive Network. 807-818 - Edith Cohen, Graham Cormode, Nick G. Duffield:
Structure-Aware Sampling: Flexible and Accurate Summarization. 819-830 - Michael K. Lawrence, Rachel Pottinger, Sheryl Staub-French:
Data Coordination: Supporting Contingent Updates. 831-842 - Guido Moerkotte, Thomas Neumann:
Accelerating Queries with Group-By and Join by Groupjoin. 843-851 - Kostas Tzoumas, Amol Deshpande, Christian S. Jensen:
Lightweight Graphical Models for Selectivity Estimation Without Independence Assumptions. 852-863 - Yongluan Zhou, Zografoula Vagena, Jonas Haustad:
Dissemination of Models over Time-Varying Data. 864-875 - Ye Yuan, Guoren Wang, Haixun Wang, Lei Chen:
Efficient Subgraph Search over Large Uncertain Graphs. 876-886 - Nitin Gupta, Milos Nikolic, Sudip Roy, Gabriel Bender, Lucja Kot, Johannes Gehrke, Christoph Koch:
Entangled Transactions. 887-898 - Xiaoyan Yang, Cecilia M. Procopiuc, Divesh Srivastava:
Summary Graphs for Relational Database Schemas. 899-910 - Justin J. Levandoski, Michael D. Ekstrand, Michael Ludwig, Ahmed Eldawy, Mohamed F. Mokbel, John Riedl:
RecBench: Benchmarks for Evaluating Performance of Recommender System Architectures. 911-920 - Ahmed A. Ataullah, Frank Wm. Tompa:
Business Policy Modeling and Enforcement in Databases. 921-931 - Xuan Liu, Xin Luna Dong, Beng Chin Ooi, Divesh Srivastava:
Online Data Fusion. 932-943 - Philip A. Bernstein, Colin W. Reid, Ming Wu, Xinhao Yuan:
Optimistic Concurrency Control by Melding Trees. 944-955 - Pei Li, Xin Luna Dong, Andrea Maurino, Divesh Srivastava:
Linking Temporal Records. 956-967 - Da Yan, Zhou Zhao, Wilfred Ng:
Efficient Algorithms for Finding Optimal Meeting Point on Road Networks. 968-979 - Aditya G. Parameswaran, Nilesh N. Dalvi, Hector Garcia-Molina, Rajeev Rastogi:
Optimal Schemes for Robust Web Extraction. 980-991 - Yizhou Sun, Jiawei Han, Xifeng Yan, Philip S. Yu, Tianyi Wu:
PathSim: Meta Path-Based Top-K Similarity Search in Heterogeneous Information Networks. 992-1003 - Giorgio Orsi, Andreas Pieris:
Optimizing Query Answering under Ontological Constraints. 1004-1015 - Tim Furche, Georg Gottlob, Giovanni Grasso, Christian Schallhart, Andrew Jon Sellers:
OXPath: A Language for Scalable, Memory-efficient Data Extraction from Web Applications. 1016-1027 - Konstantin Golenberg, Benny Kimelfeld, Yehoshua Sagiv:
Optimizing and Parallelizing Ranked Enumeration. 1028-1039 - Sudarshan Kadambi, Jianjun Chen, Brian F. Cooper, David Lomax, Raghu Ramakrishnan, Adam Silberstein, Erwin Tam, Hector Garcia-Molina:
Where in the World is My Data? 1040-1050 - Sanjeev Khanna, Sudeepa Roy, Val Tannen:
Queries with Difference on Probabilistic Databases. 1051-1062 - Mahashweta Das, Sihem Amer-Yahia, Gautam Das, Cong Yu:
MRI: Meaningful Interpretations of Collaborative Ratings. 1063-1074 - Yi Zhang, Kamesh Munagala, Jun Yang:
Storing Matrices on Disk: Theory and Practice Revisited. 1075-1086 - Rui Chen, Noman Mohammed, Benjamin C. M. Fung, Bipin C. Desai, Li Xiong:
Publishing Set-Valued Data via Differential Privacy. 1087-1098 - Xin Jin, Nan Zhang, Aditya Mone, Gautam Das:
Randomized Generalization for Aggregate Suppression Over Hidden Web Databases. 1099-1110 - Herodotos Herodotou, Shivnath Babu:
Profiling, What-if Analysis, and Cost-based Optimization of MapReduce Programs. 1111-1122 - Jiewen Huang, Daniel J. Abadi, Kun Ren:
Scalable SPARQL Querying of Large RDF Graphs. 1123-1134 - Niketan Pansare, Vinayak R. Borkar, Chris Jermaine, Tyson Condie:
Online Aggregation for Large MapReduce Jobs. 1135-1145 - Vishesh Karwa, Sofya Raskhodnikova, Adam D. Smith, Grigory Yaroslavtsev:
Private Analysis of Graph Structure. 1146-1157 - Sergio Greco, Francesca Spezzano, Irina Trubitsyna:
Stratification Criteria and Rewriting Techniques for Checking Chase Termination. 1158-1168 - Liping Peng, Yanlei Diao, Anna Liu:
Optimizing Probabilistic Query Processing on Continuous Uncertain Data. 1169-1180 - Erik Zeitler, Tore Risch:
Massive Scale-out of Expensive Continuous Queries. 1181-1188 - Aditya Ramesh, S. Sudarshan, Purva Joshi:
Keyword Search on Form Results. 1189-1200 - Min Xie, Laks V. S. Lakshmanan, Peter T. Wood:
Efficient Rank Join with Aggregation Constraints. 1201-1212
Volume 4, No. 12, August 2011
- Marcus Fontoura, Vanja Josifovski, Jinhui Liu, Srihari Venkatesan, Xiangfei Zhu, Jason Y. Zien:
Evaluation Strategies for Top-k Queries over Memory-Resident Inverted Indexes. 1213-1224 - Konstantinos Morfonios, Romain Colle, Leonidas Galanis, Supiti Buranawatanachoke, Benoît Dageville, Karl Dias, Yujun Wang:
Consistent Synchronization Schemes for Workload Replay. 1225-1236 - Christopher Olston, Benjamin C. Reed:
Inspector Gadget: A Framework for Custom Monitoring and Debugging of Distributed Dataflows. 1237-1248 - Jeffrey Cohen, John Eshleman, Brian Hagenbuch, Joy Kent, Christopher Pedrotti, Gavin Sherry, Florian Waas:
Online Expansion of Largescale Data Warehouses. 1249-1259 - Joshua Hui, Sarah E. Knoop, Peter M. Schwarz:
HIWAS: Enabling Technology for Analysis of Clinical Data in XML Documents. 1260-1271 - Kevin S. Beyer, Vuk Ercegovac, Rainer Gemulla, Andrey Balmin, Mohamed Y. Eltabakh, Carl-Christian Kanne, Fatma Özcan, Eugene J. Shekita:
Jaql: A Scripting Language for Large Scale Semistructured Data Analysis. 1272-1283 - Sachindra Joshi, Danish Contractor, Kenney Ng, Prasad M. Deshpande, Thomas Hampp:
Auto-Grouping Emails For Faster E-Discovery. 1284-1294 - Taesung Lee, Zhongyuan Wang, Haixun Wang, Seung-won Hwang:
Web Scale Taxonomy Cleansing. 1295-1306 - Philipp Große, Wolfgang Lehner, Thomas Weichert, Franz Färber, Wen-Syan Li: