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

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… Expand
Wikipedia

Related topics

Related topics

9 relations
DatabaseDatabase indexInput/outputOptimizing compiler
Expand

Broader (1)

Database theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
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… Expand
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
iSAX: disk-aware mining and indexing of massive time series datasets
Current research in indexing and mining time series data has produced many interesting algorithms and representations. However… Expand
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… Expand
  • table I
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Pushing the limits of SPM
In the two decades since the invention of the scanning tunneling microscope (STM) 1 , the family of local probing techniques… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Indexing Multidimensional Time-Series
While most time series data mining research has concentrated on providing solutions for a single distance function, in this work… Expand
  • figure 2
  • figure 1
  • figure 5
  • 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… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Data Compression in Oracle
The Oracle RDBMS recently introduced an innovative compression technique for reducing the size of relational tables. By using a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Influence sets based on reverse nearest neighbor queries
Inherent in the operation of many decision support and continuous referral systems is the notion of the “influence” of a data… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1998
Highly Cited
1998
A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces
For similarity search in high-dimensional vector spaces (or ‘HDVSs’), researchers have proposed a number of new methods (or… Expand
  • table 1
  • figure 1
  • table 2
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1994
Highly Cited
1994
Sub-pixel motion estimation with 3-D recursive search block-matching
Abstract Recently the 3-D Recursive Search Block-Matching algorithm was introduced as a high quality, low-cost, true-motion… Expand
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