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

Mehrdad Jahangiri

dblp:30/4584 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
0since 2021 · last 2008
—ORCID · none

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

Databases, data management, data science and information retrieval · 3 · 3 first-authorGraphics, computer vision, multimedia, augmented reality and games · 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 · 74% Indexing and storage engines · 26%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization
approximate query processing
0.122005
ProDA: a suite of web-services for progressive data analysis · SIGMOD Conference 2005
SHIFT-SPLIT: I/O Efficient Maintenance of Wavelet-Transformed Multidimensional Data · SIGMOD Conference 2005
Query processing and optimization › interactive query processing
progressive query processing
0.112005
ProDA: a suite of web-services for progressive data analysis · SIGMOD Conference 2005
Query processing and optimization › OLAP
multidimensional query
0.012005
ProDA: a suite of web-services for progressive data analysis · SIGMOD Conference 2005
Query processing and optimization › approximate query processing
wavelet synopsis
0.012005
SHIFT-SPLIT: I/O Efficient Maintenance of Wavelet-Transformed Multidimensional Data · SIGMOD Conference 2005

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

web services · 0.1wavelet tree · 0.1wavelet transform · 0.1discrete wavelet transform · 0.1
YearPublicationVenuePosition
2008 Plot Query Processing with Wavelets
Mehrdad Jahangiri, Cyrus Shahabi
SSDBM1
2006 A multi-threshold online smoothing technique for variable rate multimedia streams
Roger Zimmermann, Cyrus Shahabi, Kun Fu 0002, Mehrdad Jahangiri
Multim. Tools Appl.4
2005 ProDA: a suite of web-services for progressive data analysis
abstract
Online Scientific Applications (OSA) require statistical analysis of large multidimensional datasets. Towards this end, we have designed and developed a data storage and retrieval system, called ProDA, which deploys wavelet transform and provides fast approximate answers with progressively increasing accuracy in support of the OSA queries. ProDA employs a standard web-service infrastructure to enable remote users to interact with their data. These web-services enable wavelet transformation of large multidimensional datasets as well as inserting, updating, and exact, approximate and progressive querying of these datasets in the wavelet domain. We demonstrate the features of ProDA on a massive atmospheric dataset provided to us by NASA/JPL.
Mehrdad Jahangiri, Cyrus Shahabi
SIGMOD Conference1
2005 SHIFT-SPLIT: I/O Efficient Maintenance of Wavelet-Transformed Multidimensional Data
abstract
The Discrete Wavelet Transform is a proven tool for a wide range of database applications. However, despite broad acceptance, some of its properties have not been fully explored and thus not exploited, particularly for two common forms of multidimensional decomposition. We introduce two novel operations for wavelet transformed data, termed SHIFT and SPLIT, based on the properties of wavelet trees, which work directly in the wavelet domain. We demonstrate their significance and usefulness by analytically proving six important results in four common data maintenance scenarios, i.e., transformation of massive datasets, appending data, approximation of data streams and partial data reconstruction, leading to significant I/O cost reduction in all cases. Furthermore, we show how these operations can be further improved in combination with the optimal coefficient-to-disk-block allocation strategy. Our exhaustive set of empirical experiments with real-world datasets verifies our claims.
Mehrdad Jahangiri, Dimitris Sacharidis, Cyrus Shahabi
SIGMOD Conference1