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

Lily Jow

dblp:28/2557 · also Yung-Li Lily Jow · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 2010
—ORCID · none

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

Systems, architecture and hardware · 1Software engineering, systems software and programming languages · 1Databases, data management, data science and information retrieval · 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 · 100%
Network and information security
1 paper
Privacy and data protection · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Performance modeling and evaluation · 100%

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

TopicWeightPapersLastEvidence papers
Query processing and optimization
query optimization
0.112010
Data desensitization of customer data for use in optimizer performance experiments · ICDE 2010
Performance modeling and evaluation › queueing models
priority queueing
0.011985
A Note on Service Interruptions · SIGMETRICS 1985
Performance modeling and evaluation
queueing models
0.011985
A Note on Service Interruptions · SIGMETRICS 1985
Performance modeling and evaluation
service interruptions
0.011985
A Note on Service Interruptions · SIGMETRICS 1985
Performance modeling and evaluation
approximation algorithms
0.011985
A Note on Service Interruptions · SIGMETRICS 1985

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

string desensitization · 0.2numeric desensitization · 0.2queueing analysis · 0.0approximation correction · 0.0
YearPublicationVenuePosition
2010 Data desensitization of customer data for use in optimizer performance experiments
abstract
Improving the performance and functionality of database system optimizers requires experimentation on real customer data. Often these data are of sensitive nature and the only way to keep them is by applying a non-reversible transformation to obfuscate them. However, in order that the database optimizer generates exactly the same query plans as for the sensitive data, the transformation has to preserve the order and some important properties of the data distribution. Unfortunately, existing data obfuscation techniques do not preserve all of these properties and therefore are not applicable in this context. In this paper we present a Desensitizer tool that we have developed for optimizer performance experiments of HP's Neoview high availability data warehousing product. The tool is based on novel numeric and string desensitization algorithms which are agnostic to the database system. We explain the core concepts behind the algorithms, how they preserve the required data properties and important implementation considerations that were made. We present the architecture of the Desensitizer tool and results of the extensive validation that we conducted.
Malú Castellanos, Bin Zhang 0004, Ivo Jimenez, Perla Ruiz, Miguel Durazo, Umeshwar Dayal, Lily Jow
ICDE7
1985 A Note on Service Interruptions
abstract
This note is devoted to a few remarks on the performance evaluation of systems with service interruptions such as priority queues for lower priority customers, systems subject to breakdowns, etc. Recent work on priority queues has shown that a popular approximation method, the “reduced occupancy approximation”, can be exceedingly inaccurate for a range of parameter values. We identify a cause of inaccuracy and, hence, propose a simple correction that provides a substantial improvement in the results. Using the example of a simple model with service interruptions, we show also that conditional probabilities can be of value in deriving recurrent solutions to some problems.
Alexandre Brandwajn, Lily Jow
SIGMETRICS2