Full table scan

Known as: Sequential scan, Table scan 
Full table scan (also known as sequential scan) is a scan made on a database where each row of the table under scan is read in a sequential (serial… (More)
Wikipedia

Related topics

Related topics

9 relations
DatabaseDatabase indexInput/outputOptimizing compiler
(More)

Broader (1)

Database theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
The Min-dist Location Selection Query
We propose and study a new type of location optimization problem: given a set of clients and a set of existing facilities, we… (More)
  • figure 1
  • figure 2
  • table I
  • table II
  • figure 4
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Parallel Gibbs Sampling: From Colored Fields to Thin Junction Trees
We explore the task of constructing a parallel Gibbs sampler, to both improve mixing and the exploration of high likelihood… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
SIMD-Scan: Ultra Fast in-Memory Table Scan using on-Chip Vector Processing Units
The availability of huge system memory, even on standard servers, generated a lot of interest in main memory database engines. In… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2006
Highly Cited
2006
On the performance of Internet worm scanning strategies
In recent years, fast spreading worms, such as Code Red, Slammer, Blaster and Sasser, have become one of the major threats to the… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2004
2004
Optimizing similarity search for arbitrary length time series queries
We consider the problem of finding similar patterns in a time sequence. Typical applications of this problem involve large… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 6
  • figure 7
Is this relevant?
2004
2004
A Subsequence Matching Algorithm that Supports Normalization Transform in Time-Series Databases
In this paper, an algorithm is proposed for subsequence matching that supports normalization transform in time-series databases… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2002
Highly Cited
2002
An efficient indexing method for nearest neighbor searches in high-dirnensional image databases
Nearest neighbor (NN) search is emerging as an important search paradigm in a variety of applications in which objects are… (More)
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Similarity Search for Multidimensional Data Sequences
Time-series data, which are a series of one-dimensional real numbers, have been studied in various database applications. In this… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • table 2
Is this relevant?
2000
2000
Efficiently Supporting Multiple Similarity Queries for Mining in Metric Databases
Metric databases are databases where a metric distance function is defined for pairs of database objects. In such databases… (More)
  • figure 2
  • figure 4
  • figure 5
  • figure 6
  • figure 9
Is this relevant?
Highly Cited
1998
Highly Cited
1998
Fast and Effective Retrieval of Medical Tumor Shapes
We investigate the problem of retrieving similar shapes from a large database; in particular, we focus on medical tumor shapes… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?