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

Yu Sun 0011

dblp:62/3689-11 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2003
0000-0002-5012-5923ORCID · corroborated

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

Databases, data management, data science and information retrieval · 3Artificial intelligence and machine learning · 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
Query processing and optimization · 75% Distributed and cloud data management · 25%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization
cost estimation
0.012000
Developing Cost Models with Qualitative Variables for Dynamic Multidatabase Environments · ICDE 2000
Query processing and optimization
cost model
0.012000
Developing Cost Models with Qualitative Variables for Dynamic Multidatabase Environments · ICDE 2000
Query processing and optimization › adaptive query processing
dynamic query optimization
0.012000
Developing Cost Models with Qualitative Variables for Dynamic Multidatabase Environments · ICDE 2000
Distributed and cloud data management
multidatabase systems
0.012000
Developing Cost Models with Qualitative Variables for Dynamic Multidatabase Environments · ICDE 2000

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

regression analysis · 0.0multi-state query sampling · 0.0data clustering · 0.0
YearPublicationVenuePosition
2003 Cost Estimation for Queries Experiencing Multiple Contention States in Dynamic Multidatabase Environments
Qiang Zhu 0001, Satyanarayana Motheramgari, Yu Sun 0011
Knowl. Inf. Syst.3
2000 Cost Estimation for Large Queries via Fractional Analysis and Probabilistic Approach in Dynamic Multidatabase Environments
Qiang Zhu 0001, Satyanarayana Motheramgari, Yu Sun 0011
DEXA3
2000 Developing Cost Models with Qualitative Variables for Dynamic Multidatabase Environments
abstract
A major challenge for global query optimization in a multidatabase system (MDBS) is the lack of local cost information at the global level due to local autonomy. A number of methods to derive local cost models have been suggested recently. However, these methods are only suitable for a static multidatabase environment. In this paper, we propose a new multi-state query sampling method to develop local cost models for a dynamic environment. The system contention level at a dynamic local site is divided into a number of discrete contention states based on the cost of a probing query. To determine an appropriate set of contention states for a dynamic environment, two algorithms based on iterative uniform partitioning and data clustering, respectively, are introduced. A qualitative variable is used to indicate the contention states for the dynamic environment. The techniques from our previous (static) query sampling method, including query sampling, automatic variable selection, regression analysis and model validation, are extended so as to develop a cost model incorporating the qualitative variable for a dynamic environment. Experimental results demonstrate that this new multi-state query sampling method is quite promising in developing useful cost models for a dynamic multidatabase environment.
Qiang Zhu 0001, Yu Sun 0011, Satyanarayana Motheramgari
ICDE2