Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 220,899,198 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Database
Database index
Input/output
Optimizing compiler
Expand
Broader (1)
Database theory
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Effects of Temperature Variations during Sintering of Metal Ceramic Tooth Prostheses Investigated Non-Destructively with Optical Coherence Tomography
C. Sinescu
,
A. Bradu
,
Virgil-Florin Duma
,
F. Topala
,
M. Negruțiu
,
A. Podoleanu
2017
Corpus ID: 1849168
Calibration loss of ovens used in sintering metal ceramic prostheses leads to stress and cracks in the material of the prostheses…
Expand
2010
2010
Energy- and Latency-Efficient Processing of Full-Text Searches on a Wireless Broadcast Stream
Y. Chung
,
Sanghyun Yoo
,
Myoung-Ho Kim
IEEE Transactions on Knowledge and Data…
2010
Corpus ID: 14373139
In wireless mobile computing environments, broadcasting is an effective and scalable technique to disseminate information to a…
Expand
Highly Cited
2007
Highly Cited
2007
How to barter bits for chronons: compression and bandwidth trade offs for database scans
Allison L. Holloway
,
Vijayshankar Raman
,
G. Swart
,
D. DeWitt
ACM SIGMOD Conference
2007
Corpus ID: 10840973
Two trends are converging to make the CPU cost of a table scan a more important component of database performance. First, table…
Expand
2006
2006
A Comparison of C-Store and Row-Store in a Common Framework
A. Halverson
,
J. Beckmann
,
F. Naughton
,
D. DeWitt
2006
Corpus ID: 7706291
Recently, a “column store” system called CStore has shown significant performance benefits by utilizing storage optimizations for…
Expand
2004
2004
Cooperative Scans
M. Zukowski
,
P. Boncz
,
+6 authors
Nl
2004
Corpus ID: 14764942
Data mining, information retrieval and other application areas exhibit a query load with multiple concurrent queries touching a…
Expand
2004
2004
Optimizing similarity search for arbitrary length time series queries
Tamer Kahveci
,
Ambuj K. Singh
IEEE Transactions on Knowledge and Data…
2004
Corpus ID: 1536400
We consider the problem of finding similar patterns in a time sequence. Typical applications of this problem involve large…
Expand
2003
2003
Similarity search of time-warped subsequences via a suffix tree
Sanghyun Park
,
W. Chu
,
Jeehee Yoon
,
Jung-Im Won
Information Systems
2003
Corpus ID: 12039840
Highly Cited
2002
Highly Cited
2002
The Link Database: fast access to graphs of the Web
K. H. Randall
,
Raymie Stata
,
J. Wiener
,
Rajiv Wickremesinghe
Proceedings DCC . Data Compression Conference
2002
Corpus ID: 7896593
The Connectivity Server is a special-purpose database whose schema models the Web as a graph: a set of nodes (URL) connected by…
Expand
Review
1991
Review
1991
A comparative analysis of different fault simulation techniques for VLSI circuits testing
Y. Torroja
,
T. Riesgo
,
E. de la Torre
,
J. Uceda
International Conference on Industrial…
1991
Corpus ID: 151875746
Two solutions for the problem of fault simulation of digital integrated circuits and a comparison of their performance are…
Expand
Highly Cited
1982
Highly Cited
1982
A Mechanism for Managing the Buffer Pool in a Relational Database System Using the Hot Set Model
G. M. Sacco
,
M. Schkolnick
Very Large Data Bases Conference
1982
Corpus ID: 16000544
The design of the buffer manager in a Relational Database Management System can significantly affect the overall performance of…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE