Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

VLDB

Known as: International Conference on Very Large Data Bases 
VLDB is an annual conference held by the non-profit Very Large Data Base Endowment Inc. The mission of VLDB is to promote and exchange scholarly work… Expand
Wikipedia

Related topics

Related topics

11 relations
ACM Transactions on Database SystemsAlon HalevyApache HiveDatabase
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2009
Highly Cited
2009
The Star Schema Benchmark and Augmented Fact Table Indexing
We provide a benchmark measuring star schema queries retrieving data from a fact table with Where clause column restrictions on… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Mining Frequent Itemsets from Uncertain Data
We study the problem of mining frequent itemsets from uncertain data under a probabilistic framework. We consider transactions… Expand
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2007
Highly Cited
2007
What's in a Service?
The present invention provides an optically controlled power converting apparatus using light trigger/light quench electrostatic… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
Window Specification over Data Streams
Several query languages have been proposed for managing data streams in modern monitoring applications. Continuous queries… Expand
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Fast, small-space algorithms for approximate histogram maintenance
(MATH) A vector <b>A</b> of length <i>N</i> is defined implicitly, via a stream of updates of the form "add 5 to <b>A</b><sub>3… Expand
Is this relevant?
Highly Cited
2000
Highly Cited
2000
OceanStore: an architecture for global-scale persistent storage
OceanStore is a utility infrastructure designed to span the globe and provide continuous access to persistent information. Since… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Efficient algorithms for mining outliers from large data sets
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth… Expand
  • table 1
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Similarity Search in High Dimensions via Hashing
The nearestor near-neighbor query problems arise in a large variety of database applications, usually in the context of… Expand
  • figure 1
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1999
Highly Cited
1999
On random sampling over joins
A major bottleneck in implementing sampling as a primitive relational operation is the inefficiency of sampling the output of a… Expand
  • table 1
  • figure 1
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Algorithms for Mining Distance-Based Outliers in Large Datasets
This paper deals with finding outliers (exceptions) in large, multidimensional datasets. The identification of outliers can lead… Expand
  • figure 5
  • table 1
  • figure 6
  • table 2
Is this relevant?
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE