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.

Gabriel Matsliach

dblp:47/4999 · DBLP profile ↗
← Back
7ranked-venue papers
7as first author
0since 2021 · last 1994
—ORCID · none

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

Databases, data management, data science and information retrieval · 7 · 7 first-authorTheory of computation · 2 · 2 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.

Computer architecture, parallel and distributed computing, and storage systems
3 papers
Storage systems · 77% Performance modeling and evaluation · 17% Parallel and multicore computing · 6%
Databases, data mining, and information retrieval
2 papers
Indexing and storage engines · 100%

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

TopicWeightPapersLastEvidence papers
Storage systems › indexing
b+-tree
0.011994
A Combined Method for Maintaining Large Indices in Multiprocessor Multidisk Environments · IEEE Trans. Knowl. Data Eng. 1994
Storage systems
declustering
0.011994
A Combined Method for Maintaining Large Indices in Multiprocessor Multidisk Environments · IEEE Trans. Knowl. Data Eng. 1994
Performance modeling and evaluation
analytical modeling
0.011993
Performance Analysis of File Organizations that Use Multibucket Data Leaves with Partial Expansions · ACM Trans. Database Syst. 1993
Storage systems › file systems
file organization
0.011993
Performance Analysis of File Organizations that Use Multibucket Data Leaves with Partial Expansions · ACM Trans. Database Syst. 1993
Indexing and storage engines
file organization
0.011991
Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves with Partial Expansions · PODS 1991
Indexing and storage engines
partial expansion
0.011993
Performance Analysis of File Organizations that Use Multibucket Data Leaves with Partial Expansions · ACM Trans. Database Syst. 1993

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

simulation · 0.0exact performance analysis · 0.0approximate analysis · 0.0
YearPublicationVenuePosition
1994 A Combined Method for Maintaining Large Indices in Multiprocessor Multidisk Environments
abstract
Consider the problem of maintaining large indices (or secondary memory indices) in a multiprocessor multidisk environment in which each processor has a dedicated secondary memory (one disk or more). The processors either reside in the same site and communicate via shared memory, or reside in different sites and communicate via a local broadcast network. The straightforward method (SFM) for maintaining such an index, which is commonly called declustering, is to partition the index records equally among the processors, each of which maintains its part of the index in a local B/sup +/-tree. In prior work (Inform. Processing Lett., vol. 34, pp. 313-321, May 1990), we have presented another method, called the "totally distributed B/sup +/-tree" (TDB) method, in which all processors together implement a "wide" B/sup +/-tree. There are settings in which the second method is better than the first method, and vice versa. In this paper, we present a new method, called the combined distribution method (CDM), that combines the ideas underlying SFM and TDB. In tightly coupled environments, CDM outperforms both SFM and TDB in almost all practical settings (in many settings by more than 30%). This is shown by an approximate analysis and verified by simulations. Note that CDM's approach can improve performance in database systems that use a RAID (redundant array of inexpensive disks).>
Gabriel Matsliach, Oded Shmueli
IEEE Trans. Knowl. Data Eng.1
1993 Performance Analysis of File Organizations that Use Multibucket Data Leaves with Partial Expansions
abstract
We present an exact performance analysis, under random insertions, of file organizations that use multibucket data leaves and perform partial expansions before splitting. We evaluate the expected disk space utilization of the file and show how the expected search and insert costs can be estimated. The analytical results are confirmed by simulations. The analysis can be used to investigate both the dynamic and the asymptotic behaviors.
Gabriel Matsliach
ACM Trans. Database Syst.1
1991 Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves with Partial Expansions
abstract
Article Free Access Share on Performance analysis of file organizations that use multi-bucket data leaves with partial expansions (extended abstract) Author: Gabriel Matsliach Gabriel Matsliach, Technion - Dept. of Computer Science, Haifa 32000, Israel and Technion - Israel Institute of Technology, Dept. of Computer Science Gabriel Matsliach, Technion - Dept. of Computer Science, Haifa 32000, Israel and Technion - Israel Institute of Technology, Dept. of Computer ScienceView Profile Authors Info & Claims PODS '91: Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systemsApril 1991 Pages 164–180https://doi.org/10.1145/113413.113428Online:01 April 1991Publication History 1citation205DownloadsMetricsTotal Citations1Total Downloads205Last 12 Months1Last 6 weeks0 Get Citation AlertsNew Citation Alert added!This alert has been successfully added and will be sent to:You will be notified whenever a record that you have chosen has been cited.To manage your alert preferences, click on the button below.Manage my AlertsNew Citation Alert!Please log in to your account Save to BinderSave to BinderCreate a New BinderNameCancelCreateExport CitationPublisher SiteeReaderPDF
Gabriel Matsliach
PODS1
1991 Using multi-bucket data leaves with overflow chains-performance analysis
Gabriel Matsliach
Inf. Syst.1
1990 Maintaining Bounded Disorder Files in Multiprocessor Multi-Disk Environments
Gabriel Matsliach, Oded Shmueli
ICDT1
1990 Performance Analysis of File Organizations that Use Multi-Bucket Data Leaves
Gabriel Matsliach
Inf. Process. Lett.1
1990 Distributing A B+-Tree in a Loosely Coupled Environment
Gabriel Matsliach, Oded Shmueli
Inf. Process. Lett.1