forked from qiyanghe1998/qiyanghe1998.github.io
-
Notifications
You must be signed in to change notification settings - Fork 0
/
publication.html
213 lines (178 loc) · 7.84 KB
/
publication.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
<!DOCTYPE html>
<html lang="en"><head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
<meta charset="utf-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1, shrink-to-fit=no">
<meta name="description" content="yue gong is a senior undergraduate student majoring in computer science at Southern University of Science and Technology (SUSTech). yue gong enjoys building and learning systems! Her research interest lies in database system including big data management, query optimization and data integration.">
<meta name="author" content="yue gong">
<meta name="keywords" content="yue gong, gong yue, database, sustech, system, query optimization, computer, computer science">
<script src="js/9JZkBilUSmGpH8F5SvwGOfpXbTA.js"></script><!-- <link href="https://pingchuan.ma/favicon.png" rel="icon"> -->
<!-- Global site tag (gtag.js) - Google Analytics -->
<script async src="https://www.googletagmanager.com/gtag/js?id=UA-151270318-1"></script>
<script>
window.dataLayer = window.dataLayer || [];
function gtag(){dataLayer.push(arguments);}
gtag('js', new Date());
gtag('config', 'UA-151270318-1');
</script>
<link href="css/bootstrap.css" rel="stylesheet">
<link href="css/css.css" rel="stylesheet">
<!-- <link href="Source_files/fontawesome.css" rel="stylesheet">
--><link href="css/solid.css" rel="stylesheet">
<link href="css/brands.css" rel="stylesheet">
<link href="css/academicons.css" rel="stylesheet">
<link href="css/style.css" rel="stylesheet">
<link rel="stylesheet" href="static/font-awesome-4.7.0/css/font-awesome.min.css">
<title>Runze Liao</title>
</head>
<body>
<div class="container-fluid">
<nav class="navbar navbar-expand-sm navbar-dark fixed-top">
<div class="container-fluid">
<a class="navbar-brand" href="index.html"><serif>Runze Liao</serif></a>
<button class="navbar-toggler" type="button" data-toggle="collapse" data-target="#navbarToggler" aria-controls="navbarToggler" aria-expanded="false" aria-label="Toggle navigation">
<span class="navbar-toggler-icon"></span>
</button>
<div class="collapse navbar-collapse" id="navbarToggler">
<ul class="navbar-nav ml-auto">
<li class="nav-item">
<a class="nav-item nav-link" href="index.html">Home</a>
</li>
<li class="nav-item">
<a class="nav-item nav-link" href="publication">Publication</a>
</li>
<!--
<li class="nav-item">
<a class="nav-item nav-link" href="project.html">Project</a>
</li>
-->
<li class="nav-item">
<a class="nav-item nav-link" href="misc.html">Misc.</a>
</li>
</ul>
</div>
</div>
</nav>
<div class="sec-wrapper pub-wrapper" id="Research">
<div class="container-fluid">
<!-- <div class="row">
<div class="col col-wrapper">
<div class="section-title" style="margin-top: 5px">Research</div>
</div>
</div> -->
<div class="row align-items-center section-item">
<!--<div class="col-xs-12 col-md-3 col-lg-4 col-wrapper">-->
<div class="figure">
<!--<img src="static/img/asterix2.png" alt="[Pushdown]">-->
</div>
</div>
<!--<div class="col-xs-12 col-md-9 col-lg-8 col-wrapper">-->
<!-- <p>
<span style="font-style: italic">
Reachability Types: Tracking Aliasing and Separation in Higher-Order Functional Programs
</span>
<br>
Yuyan Bao, Guannan Wei, Oliver Bračevac, Yuxuan Jiang, Runze Liao, Tiark Rompf
<br>
Proceedings of the ACM on Programming Languages, Volume 5 (OOPSLA 2021). Online/Chicago, IL, USA
<br>
<a href="static/files/reachability.pdf">[pdf]</a>
<span class="hspace"> </span>
<a href="https://dl.acm.org/doi/abs/10.1145/3485516">[acm dl]</a>
<span class="hspace"> </span>
<a href="https://github.com/tiarkrompf/reachability">[artifact]</a>
</p> -->
<div class="title">
XXXXXXX: Reconstruct Hidden Content in Physical Envelopes
</div>
<p>Yongfei Tao, Runze Liao, Haibin Ling, Bingyao Huang.
Summitted to Proceedings of the AAAI Conference on Artificial Intelligence, Volume 39 (AAAI ’25). Philadelphia, PA, USA.
<br>
<!-- <a href="static/files/reachability.pdf">[pdf]</a>
<a href="https://dl.acm.org/doi/abs/10.1145/3485516">[acm dl]</a>
<a href="https://github.com/tiarkrompf/reachability">[artifact]</a> -->
</p>
<!--
<p style="text-align:left;">
Advisor: <a href="https://www.ics.uci.edu/~mjcarey/">Prof. Michael Carey </a> (UCI)
<span style="float:right;">
<time>July. 2019 - Sep. 2019</time>
</span>
</p>
<p>
AsterixDB is a scalable big data management system. The research problem addressed by my work is the limitation of incomplete operator pushdown in the current implementation of AsterixDB. Since there are expensive memory copy costs between operators, my work aims to push the query execution logic down to the data-scan stage as much as possible.
</p>
<ul>
<li> Explore three patterns of query on which pushdown can have a performance impact</li>
<li> Design comprehensive benchmarks to test the performance</li>
</ul>
-->
<!-- <div class="title">
Efficient Incrementialization of Correlated Nested Aggregate Queries using Relative Partial Aggregate Indexes (RPAI)
</div>
<p>Supun Abeysinghe, Runze Liao, Tiark Rompf
Proceedings of the 2022 International Conference on Management of Data (SIGMOD 2022). Philadelphia, PA, USA
<br>
<a href="static/files/rpai.pdf">[pdf]</a>
<a href="https://dl.acm.org/doi/abs/10.1145/3514221.3517889">[acm dl]</a>
</p> -->
<!--
<p style="text-align:left;">
Advisor: <a href="https://www.ics.uci.edu/~mjcarey/">Prof. Michael Carey </a> (UCI)
<span style="float:right;">
<time>July. 2019 - Sep. 2019</time>
</span>
</p>
<p>
AsterixDB is a scalable big data management system. The research problem addressed by my work is the limitation of incomplete operator pushdown in the current implementation of AsterixDB. Since there are expensive memory copy costs between operators, my work aims to push the query execution logic down to the data-scan stage as much as possible.
</p>
<ul>
<li> Explore three patterns of query on which pushdown can have a performance impact</li>
<li> Design comprehensive benchmarks to test the performance</li>
</ul>
-->
<!-- <a href="https://dl.acm.org/doi/abs/10.1145/3485516">[acm dl]</a>
<a href="https://github.com/tiarkrompf/reachability">[artifact]</a> -->
</div>
</div>
<br />
<!--
<div class="row align-items-center section-item">
<div class="col-xs-12 col-md-3 col-lg-4 col-wrapper">
<div class="figure">
<img src="static/img/cache.png" alt="[cache-research]">
</div>
</div>
<div class="col-xs-12 col-md-9 col-lg-8 col-wrapper">
<div class="title">
Efficient Cache Management for Replicated Web Search Engine
</div>
<p>Area: Information Retrival, Theory</p>
<p style="text-align:left;">
Advisor: <a href="https://acm.sustech.edu.cn/btang/">Prof. Bo Tang</a>
<span style="float:right;">
<time>Oct. 2018 - Present</time>
</span>
</p>
<p>
Posting list cache plays an important role in saving searching time in modern search engines. However, most search engines adopt a simple scheme called uniform caching which caches the same content on all the servers. It does not exploit the variations among queries, thus wasting memory space on caching the same cache content redundantly on multiple servers. To tackle this limitation, we want to develop a new caching scheme which diversifies the cache contents in different servers by training past query log.
</p>
<ul>
<li>Provide the theoretical inapproximability proof of diversified caching problem</li>
<li>Implement a framework with a suite of techniques and heuristics for diversified caching</li>
<li>[In progress] Enhancing the cache admission process with semantic information of words. (like word collocations, we should cache words which are like to appear together on the same server) </li>
</ul>
</div>
</div>
</div>
</div>
-->
</div>
</div>
</div>
<script src="js/jquery-3.js"></script>
<script src="js/popper.js"></script>
<script src="js/bootstrap.js"></script>
<script src="js/script.js"></script>
</body></html>