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

Pradip Kanjamala

dblp:18/1679 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

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

Databases, data management, data science and information retrieval · 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
1 paper
Data models and query languages · 56% Spatial and temporal data management · 44%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Data models and query languages
constraint databases
0.012000
The MLPQ/GIS Constraint Database System · SIGMOD Conference 2000
Spatial and temporal data management
spatio-temporal query processing
0.012000
The MLPQ/GIS Constraint Database System · SIGMOD Conference 2000

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

icon-based query interface · 0.0constraint database system · 0.0
YearPublicationVenuePosition
2012 Common Terminology Services 2 (CTS2) for Biomedical Community
Cui Tao, Harold R. Solbrig, Pradip Kanjamala, Kevin J. Peterson, Craig Stancle, Christopher G. Chute
AMIA3
2000 The MLPQ/GIS Constraint Database System
abstract
MLPQ/GIS [4,6] is a constraint database [5] system like CCUBE [1] and DEDALE [3] but with a special emphases on spatio-temporal data. Features include data entry tools (first four icons in Fig. 1), icon-based queries such as @@@@ Intersection, @@@@ Union, @@@@ Area, @@@@ Buffer, @@@@ Max and @@@@ Min, which optimize linear objective functions, and @@@@ for Datalog queries. For example, in Fig. 1 we loaded and displayed a constraint database that represents the midwest United States and loaded two contraint relations describing the movements of two persons. The query icon opened a dialog box into which we entered the query which finds (t, i) pairs such that the two people are in the same state i at the same time t.
Peter Z. Revesz, Pradip Kanjamala, Yuguo Liu
SIGMOD Conference3