VLDB Best Papers CollectingVLDB is a premier annual international forum for data management and database researchers, vendors, practitioners, application developers, and users. The VLDB conference will feature research talks, tutorials, demonstrations, and workshops. It will cover issues in data management, database and information systems research, since they are the technological cornerstones of the emerging applications of the 21st century.
Pingcheng Ruan,Gang Chen, Tien Tuan Anh Dinh,Qian Lin,Beng Chin Ooi,Meihui Zhang
Proceedings of the VLDB Endowment, no. 9 (2019): 975-988
The success of Bitcoin and other cryptocurrencies bring enormous interest to blockchains. A blockchain system implements a tamper-evident ledger for recording transactions that modify some global states. The system captures entire evolution history of the states. The management o...
Cited by38BibtexViews188DOI
0
0
Dimitrije Jankov,Shangyu Luo, Binhang Yuan,Zhuhua Cai,Jia Zou,Chris Jermaine,Zekai J. Gao
Proceedings of the VLDB Endowment, no. 7 (2019): 822-835
We have shown that when implemented on top of an relational database management system, these ideas result in machine learning computations that are model parallel— that is, able to handle large and complex models that need to be distributed across machines or compute units
Cited by19BibtexViews179DOI
0
0
PVLDB, no. 5 (2017): 577-588
Multiple lines of research have developed Natural Language (NL) interfaces for formulating database queries. We build upon this work, but focus on presenting a highly detailed form of the answers in NL. The answers that we present are importantly based on the provenance of tuples...
Cited by22BibtexViews230DOI
0
0
PVLDB, no. 12 (2016): 960-971
compressed linear algebra shows similar operations performance at significantly better compression ratios which is crucial for end-to-end performance improvements of large-scale machine learning
Cited by69BibtexViews179DOI
0
0
PVLDB, no. 1 (2015): 73-84
Natural language has been the holy grail of query interface designers, but has generally been considered too hard to work with, except in limited specific circumstances. In this paper, we describe the architecture of an interactive natural language query interface for relational ...
Cited by237BibtexViews148
0
0
PVLDB, no. 10 (2014)
To realize our vision of abstraction without regret, we present LegoBase, a query engine written in the high-level programming language Scala
Cited by122BibtexViews136
0
0
The VLDB Journal, no. 2 (2014): 175-199
Motivated by the need to mine important stories and events from the social media collective, as they emerge, in this work we examine the problem of maintaining dense subgraphs under streaming edge weight updates
Cited by121BibtexViews142DOI
0
0
PVLDB, no. 10 (2014)
As the predominant form of time series visualizations, our approach exploits the semantics of line rasterization to drive the data reduction of high-volume time series data
Cited by85BibtexViews154
0
0
PVLDB, no. 2 (2014): 97-108
These include updating a cracked database, convergence of database cracking to a full index, efficient tuple reconstruction, and robustness over unpredictable changes in query workload
Cited by49BibtexViews128DOI
0
0
The Vldb Journal, no. 1 (2014)
We introduced the k-All-Path Cover optimization problem with the goal of computing compact yet faithful synopses of the vertex set of road networks
Cited by7BibtexViews129
0
0
VLDB JOURNAL, no. 1 (2014): 3-26
This paper presents epiC, a scalable and extensible system for processing BigData. epiC solves BigData’s data volume challenge by parallelization and tackles the data variety challenge by decoupling the concurrent programming model and the data processing model
Cited by7BibtexViews228DOI
0
0
PVLDB, no. 1 (2012): 13-24
Intuitive definition of diversity as the problem of selecting a minimum representative subset S of a result P, such that each object in P is represented by a similar object in S and that the objects included in S are not similar to each other
Cited by104BibtexViews117DOI
0
0
The VLDB Journal — The International Journal on Very Large Data Bases, no. 2 (2011): 249-275
Considering the complex interplay between probabilities and scores, instead of proposing a specific ranking function, we propose using two parameterized ranking functions, called PRFω and PRFe, which allow the user to control the tuples that appear in the top-k answers
Cited by233BibtexViews92DOI
0
0
The VLDB Journal — The International Journal on Very Large Data Bases, no. 1 (2011): 29-45
In this paper, we present a technique for building a high-availability (HA) database management system (DBMS). The proposed technique can be applied to any DBMS with little or no customization, and with reasonable performance overhead. Our approach is based on Remus, a commodity ...
Cited by83BibtexViews153DOI
0
0
The VLDB Journal — The International Journal on Very Large Data Bases, no. 2 (2010): 213-238
We have proposed editing rules that, in contrast to constraints used in data cleaning, are able to find certain fixes by updating input tuples with master data
Cited by231BibtexViews132DOI
0
0
PVLDB, no. 2 (2008): 1530-1541
If the space used by an object is Ψ, and we have a Zipfian with z = 1, the sampling algorithm uses O(k log uses
Cited by274BibtexViews136DOI
0
0
The VLDB Journal — The International Journal on Very Large Data Bases, no. 1 (2008): 21-44
Existing solutions to the automated physical design problem in database systems attempt to minimize execution costs of input workloads for a given a storage constraint. In this paper, we argue that this model is not flexible enough to address several real-world situations. To ove...
Cited by8BibtexViews77DOI
0
0
VLDB, pp.411-422, (2007)
We showed that a poorly-selected property table can result in a factor of 3.8 slowdown over an optimal property table, making the solution difficult to use in practice
Cited by939BibtexViews128
0
0
VLDB, pp.1001-1012, (2006)
We proposed a scheme based on judicious merging of posting lists and the optional use of jump indexes for faster conjunctive query processing
Cited by42BibtexViews117
0
0
VLDB, pp.577-588, (2005)
In this paper, we examine the performance of frequent pattern mining algorithms on a modern processor. A detailed performance study reveals that even the best frequent pattern mining implementations, with highly efficient memory managers, still grossly under-utilize a modern proc...
Cited by101BibtexViews107
0
0
小科