Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tom Barclay

dblp:b/TomBarclay · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
0since 2021 · last 2000
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 3 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Spatial and temporal data management · 41% Data integration and cleaning · 41% Query processing and optimization · 18%
Computer architecture, parallel and distributed computing, and storage systems
3 papers
Performance modeling and evaluation · 45% High-performance computing · 26% Storage systems · 15%

Topics — the 6 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data integration and cleaning
data warehouse
0.012000
TerraServer: A Spatial Data Warehouse · SIGMOD Conference 2000
Query processing and optimization
sorting
0.011994
AlphaSort: A RISC Machine Sort · SIGMOD Conference 1994
Performance modeling and evaluation
benchmarking
0.011994
AlphaSort: A RISC Machine Sort · SIGMOD Conference 1994
Performance modeling and evaluation › benchmarking › algorithm benchmarking
sort benchmark
0.011994
AlphaSort: A RISC Machine Sort · SIGMOD Conference 1994
Storage systems › multimedia storage
image storage
0.012000
TerraServer: A Spatial Data Warehouse · SIGMOD Conference 2000
Memory systems › cache
cache-aware algorithm design
0.011995
AlphaSort: A Cache-Sensitive Parallel External Sort · VLDB J. 1995

Methods — techniques the papers use, named apart from their topics

quicksort · 0.0file striping · 0.0parallel external sorting · 0.0cache-sensitive partitioning · 0.0replacement-selection · 0.0replacement selection · 0.0
YearPublicationVenuePosition
2000 TerraServer: A Spatial Data Warehouse
abstract
Microsoft® TerraServer stores aerial, satellite, and topographic images of the earth in a SQL database available via the Internet. It is the world's largest online atlas, combining eight terabytes of image data from the United States Geological Survey (USGS) and SPIN-2. Internet browsers provide intuitive spatial and text interfaces to the data. Users need no special hardware, software, or knowledge to locate and browse imagery. This paper describes how terabytes of “Internet unfriendly” geo-spatial images were scrubbed and edited into hundreds of millions of “Internet friendly” image tiles and loaded into a SQL data warehouse. All meta-data and imagery are stored in the SQL database.
Tom Barclay, Donald R. Slutz, Jim Gray 0001
SIGMOD Conference1
1995 AlphaSort: A Cache-Sensitive Parallel External Sort
Chris Nyberg, Tom Barclay, Zarka Cvetanovic, Jim Gray 0001, David B. Lomet
VLDB J.2
1994 AlphaSort: A RISC Machine Sort
abstract
A new sort algorithm, called AlphaSort, demonstrates that commodity processors and disks can handle commercial batch workloads. Using Alpha AXP processors, commodity memory, and arrays of SCSI disks, AlphaSort runs the industry-standard sort benchmark in seven seconds. This beats the best published record on a 32-cpu 32-disk Hypercube by 8:1. On another benchmark, AlphaSort sorted more than a gigabyte in a minute.AlphaSort is a cache-sensitive memory-intensive sort algorithm. It uses file striping to get high disk bandwidth. It uses QuickSort to generate runs and uses replacement-selection to merge the runs. It uses shared memory multiprocessors to break the sort into subsort chores.Because startup times are becoming a significant part of the total time, we propose two new benchmarks: (1) Minutesort: how much can you sort in a minute, and (2) DollarSort: how much can you sort for a dollar.
Chris Nyberg, Tom Barclay, Zarka Cvetanovic, Jim Gray 0001, David B. Lomet
SIGMOD Conference2