Demo Data from EDBT 2026 / reviewers in the wild / expert
Valery Soloviev
dblp:44/1059
· DBLP profile ↗
6ranked-venue papers
2as first author
0since 2021 · last 1999
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 3 · 2 first-authorSystems, architecture and hardware · 1Computer networks · 1Software engineering, systems software and programming languages · 1Applied, interdisciplinary, general and emerging computing · 1
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 |
Query processing and optimization · 80% Database system architecture and tuning · 20% | |
| Computer networks
1 paper |
Content delivery and video streaming · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
2 papers |
Parallel and multicore computing · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Content delivery and video streaming › caching
web caching |
0.0 | 1 | 1998 | On Performance of Caching Proxies (Extended Abstract) · SIGMETRICS 1998 |
Query processing and optimization › join processing › inequality join
band join |
0.0 | 1 | 1993 | A Truncating Hash Algorithm for Processing Band-Join Queries · ICDE 1993 |
Database system architecture and tuning › workload management
batch scheduling |
0.0 | 1 | 1993 | Batch Scheduling in Parallel Database Systems · ICDE 1993 |
Query processing and optimization › join processing › join algorithms
hash join |
0.0 | 1 | 1993 | A Truncating Hash Algorithm for Processing Band-Join Queries · ICDE 1993 |
Query processing and optimization
join processing |
0.0 | 1 | 1993 | A Truncating Hash Algorithm for Processing Band-Join Queries · ICDE 1993 |
Query processing and optimization
query scheduling |
0.0 | 1 | 1993 | Batch Scheduling in Parallel Database Systems · ICDE 1993 |
Parallel and multicore computing › parallel computing
parallel database systems |
0.0 | 1 | 1993 | Batch Scheduling in Parallel Database Systems · ICDE 1993 |
Parallel and multicore computing › multiprocessor system › loosely coupled multiprocessor
shared-nothing multiprocessor |
0.0 | 1 | 1993 | A Truncating Hash Algorithm for Processing Band-Join Queries · ICDE 1993 |
Methods — techniques the papers use, named apart from their topics
performance analysis · 0.0simulation · 0.0analytical performance modeling · 0.0analytical modeling · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1999 | A Performance Study of the Squid Proxy on HTTP/1.0
Alex Rousskov, Valery Soloviev |
World Wide Web | 2 |
| 1998 | On Performance of Caching Proxies (Extended Abstract)abstractNo abstract available. Alex Rousskov, Valery Soloviev |
SIGMETRICS | 2 |
| 1997 | Static caching in Web serversabstractThis paper studies caching in primary Web servers. We use log files from four Web servers to analyze the performance of various proposed cache policies for Web servers: LRU-threshold, LFU, LRU-SIZE, LRU-MIN, LRU-k-threshold and the Pitkow/Recker (1994) policy. Web document access patterns change very slowly. Based on this fact, we propose and evaluate static caching, a novel cache policy for Web servers. In static caching, the set of documents kept in the cache is determined periodically by analyzing the request log file for the previous period. The cache is filled with documents to maximize cache performance provided document access patterns do not change. The set of cached documents remains constant during the period. Surprisingly, this simple policy results in high cache performance, especially for small cache sizes. Unlike other policies, static caching incur no CPU overhead and does not suffer from memory fragmentation. Igor Tatarinov, Alex Rousskov, Valery Soloviev |
ICCCN | 3 |
| 1996 | An Incremental Memory Allocation Method for Mixed Workloads
Valery Soloviev |
Inf. Syst. | 1 |
| 1993 | Batch Scheduling in Parallel Database SystemsabstractMany techniques for query scheduling in a parallel database system schedule a single query at a time. The scheduling of queries for parallel database systems by dividing the workload into batches is investigated. Scheduling algorithms that exploit the common operations within the queries in a batch are proposed. The performance of the proposed algorithms is studied using a simple analytical model and a detailed simulation model. It is shown that batch scheduling can provide significant savings compared to single query scheduling for a variety of system and workload parameters.> Manish Mehta 0002, Valery Soloviev, David J. DeWitt |
ICDE | 2 |
| 1993 | A Truncating Hash Algorithm for Processing Band-Join QueriesabstractThe truncating-hash band join algorithm for evaluating band joins is described. This algorithm is based on the idea of truncating join attribute values in order to execute band joins in a way similar to hash join algorithms for equijoins. Unlike previously proposed algorithms for band joins, it does not sort either of the input relations during its execution. A comparison between the truncating-hash band join algorithm and previous algorithms for band joins using an analytical model is presented. The model also compares an evaluation of band join for a parallel implementation on a shared-nothing multiprocessor system. The results show that the truncating-hash band join algorithm outperforms the other band join algorithms because of a significantly lower CPU cost.> Valery Soloviev |
ICDE | 1 |