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

Donko Donjerkovic

dblp:d/DDonjerkovic · DBLP profile ↗
← Back
5ranked-venue papers
2as 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 · 5 · 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.

Databases, data mining, and information retrieval
4 papers
Query processing and optimization · 100%
Computer graphics and multimedia
2 papers
Visualization and visual analytics · 94% Multimedia analysis and retrieval · 6%

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

TopicWeightPapersLastEvidence papers
Visualization and visual analytics
data exploration
0.021997
DEVise: Integrated Querying and Visual Exploration of Large Datasets (Demo Abstract) · SIGMOD Conference 1997
DEVise: Integrated Querying and Visualization of Large Datasets · SIGMOD Conference 1997
Visualization and visual analytics › interactive visualization
visual querying
0.021997
DEVise: Integrated Querying and Visual Exploration of Large Datasets (Demo Abstract) · SIGMOD Conference 1997
DEVise: Integrated Querying and Visualization of Large Datasets · SIGMOD Conference 1997
Query processing and optimization
cardinality estimation
0.012000
Dynamic Histograms: Capturing Evolving Data Sets · ICDE 2000
Query processing and optimization › cardinality estimation
histogram
0.012000
Dynamic Histograms: Capturing Evolving Data Sets · ICDE 2000
Query processing and optimization
selectivity estimation
0.012000
Dynamic Histograms: Capturing Evolving Data Sets · ICDE 2000
Query processing and optimization
query optimization
0.011999
Probabilistic Optimization of Top N Queries · VLDB 1999
Visualization and visual analytics › scientific visualization › multiscale visualization
level-of-detail visualization
0.011997
DEVise: Integrated Querying and Visual Exploration of Large Datasets (Demo Abstract) · SIGMOD Conference 1997

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

visual presentation · 0.0interactive exploration · 0.0data visualization · 0.0data exploration · 0.0v-optimal histogram · 0.0dynamic histogram construction · 0.0
YearPublicationVenuePosition
2000 Dynamic Histograms: Capturing Evolving Data Sets
abstract
In this paper, we introduce dynamic histograms, which are constructed and maintained incrementally. We develop several dynamic histogram construction algorithms and show that they come close to static histograms in quality. Our experimental study covers a wide range of datasets and update patterns, including histogram maintenance in a shared-nothing environment. Building upon the insights offered by the dynamic algorithms, we also propose a new static histogram construction algorithm that is very fast and generates histograms that are close in quality to the highly accurate (but expensive to construct!) V-Optimal histograms. 1 Introduction The cost of executing a relational operator is a function of the sizes of the tuple streams that are input to the operator, which for intermediate operators are in turn determined by selectivities of the previous operators. The more complex a query is, the more important it is to have precise intermediate size estimates. Otherwise, errors in ...
Donko Donjerkovic, Yannis E. Ioannidis, Raghu Ramakrishnan 0001
ICDE1
1999 Probabilistic Optimization of Top N Queries
Donko Donjerkovic, Raghu Ramakrishnan 0001
VLDB1
1998 SRQL: Sorted Relational Query Language
abstract
A relation is an unordered collection of records. Often, however there is an underlying order (e.g., a sequence of stock prices), and users want to pose queries that reflect this order (e.g., find a weekly moving average). SQL provides no support for posing such queries. We show how a rich class of queries reflecting sort order can be naturally expressed and efficiently executed with simple extensions to SQL.
Raghu Ramakrishnan 0001, Donko Donjerkovic, Arvind Ranganathan, Kevin S. Beyer, Muralidhar Krishnaprasad
SSDBM2
1997 DEVise: Integrated Querying and Visualization of Large Datasets
abstract
DEVise is a data exploration system that allows users to easily develop, browse, and share visual presentation of large tabular datasets (possibly containing or referencing multimedia objects) from several sources. The DEVise framework is being implemented in a tool that has been already successfully applied to a variety of real applications by a number of user groups.
Miron Livny, Raghu Ramakrishnan 0001, Kevin S. Beyer, Guangshun Chen, Donko Donjerkovic, Shilpa Lawande, Jussi Myllymaki, R. Kent Wenger
SIGMOD Conference5
1997 DEVise: Integrated Querying and Visual Exploration of Large Datasets (Demo Abstract)
abstract
DEVise is a data exploration system that allows users to easily develop, browse, and share visual presentations of large tabular datasets (possibly containing or referencing multimedia objects) from several sources. The DEVise framework, implemented in a tool that has been already successfully applied to a variety of real applications by a number of user groups, makes several contributions. In particular, it combines support for extended relational queries with powerful data visualization features. Datasets much larger than available main memory can be handled—DEVise is currently being used to visualize datasets well in excess of 100MB—and data can be interactively examined at several levels of detail: all the way from meta-data summarizing the entire dataset, to large subsets of the actual data, to individual data records. Combining querying (in general, data processing) with visualizations gives us a very versatile tool, and presents several novel challenges.
Miron Livny, Raghu Ramakrishnan 0001, Kevin S. Beyer, Guangshun Chen, Donko Donjerkovic, Shilpa Lawande, Jussi Myllymaki, R. Kent Wenger
SIGMOD Conference5