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

Sameer Mahajan

dblp:m/SameerMahajan · DBLP profile ↗
← Back
3ranked-venue papers
2as first author
0since 2021 · last 1998
—ORCID · none

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

Databases, data management, data science and information retrieval · 2 · 1 first-authorSoftware engineering, systems software and programming languages · 1 · 1 first-authorTheory of computation · 1 · 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
Data mining · 61% Distributed and cloud data management · 39%
Artificial intelligence
1 paper
Knowledge representation and reasoning · 100%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data mining › pattern mining
association rule mining
0.011998
On the Discovery of Interesting Patterns in Association Rules · VLDB 1998
Data mining › pattern mining
interesting pattern mining
0.011998
On the Discovery of Interesting Patterns in Association Rules · VLDB 1998
Knowledge, reasoning and agents › Knowledge representation and reasoning › knowledge discovery
pattern mining
0.011998
On the Discovery of Interesting Patterns in Association Rules · VLDB 1998
Distributed and cloud data management
data replication
0.011998
Grouping Techniques for Update Propagation in Intermittently Connected Databases · ICDE 1998

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

data grouping · 0.0clustering · 0.0
YearPublicationVenuePosition
1998 Grouping Techniques for Update Propagation in Intermittently Connected Databases
abstract
We consider an environment where one or more servers carry databases that are of interest to a community of clients. The clients are only intermittently connected to the server for brief periods of time. Clients carry a part of the database for their own processing and accumulate local updates while disconnected. We call this the Intermittently Connected Database (ICDB) environment. ICDBs have a wide variety of applications including sales force automation, insurance claim processing, and mobile workforces. Our focus is on the problem of update propagation at the server in ICDBs and the associated processing at the clients. The typical client-centric approach involves the communication and processing of updates and transactions on a per-client basis, ignoring the overlap of data between clients. The complexity of this approach is in the order of the number of connecting clients, thereby limiting the scalability of the server. We propose a data-centric approach which clusters data into groups and assigns to each client one or more of these groups. The proposed scheme results in server processing complexity on the order of the number of groups, which we control. We propose various techniques for grouping and discuss the processing required at the clients to enable the grouping approach. While the client-centric approach is expected to significantly degrade with the increasing number of clients, we expect that a properly designed grouping scheme will sustain a number of clients that is significantly larger. A prototype has been developed and performance studies are in progress.
Sameer Mahajan, Michael J. Donahoo, Shamkant B. Navathe, Mostafa H. Ammar, Sanjoy Malik
ICDE1
1998 On the Discovery of Interesting Patterns in Association Rules
Sridhar Ramaswamy, Sameer Mahajan, Avi Silberschatz
VLDB2
1997 Concurrent Logic Programming and pi Calculus
Sameer Mahajan, S. Ramesh 0001
ICLP1