ICDE 2017 论文目录与一些想法的整理

ICDE 2017

1.1 Research Session 1A: Graphs

UniWalk: Unidirectional Random Walk Based Scalable SimRank Computation over Large Graph

---

A Fast Order-Based Approach for Core Maintenance

---

Scalable and Interactive Graph Clustering Algorithm on Multicore CPUs

---

Fast Computation of Dense Temporal Subgraphs

1.2 Research Session 1B: Keyword Search, Text, and Strings

Reverse Keyword-Based Location Search
反向搜索关键字的位置

Abstract
The proliferation of geo-textual data gives prominence to spatial keyword search. The basic top-k spatial keyword query, returns k geo-textual objects that rank the highest according to their textual relevance and spatial proximity to query keywords and a query location. We define, study, and provide means of computing the reverse top-k keyword-based location query. This new type of query takes a set of keywords, a query object q, and a number k as arguments, and it returns a spatial region such that any top-k spatial keyword query with the query keywords and a location in this region would contain object q in its result. This query targets applications in market analysis, geographical planning, and location optimization, and it may support applications related to safe zones and influence zones that are used widely in location-based services.
We show that computing an exact query result requires evaluating and merging a set of weighted Voronoi cells, which is expensive. We therefore devise effective algorithms that approximate result regions with quality guarantees. We develop novel pruning techniques on top of an index, and we offer a series of optimization techniques that aim to further accelerate query processing. Empirical studies suggest that the proposed query processing is efficient and scalable.

摘要
地理文本数据的激增突出了空间关键词搜索。最基本的 top-k 空间关键字查询，返回 k 个地理文本对象，根据它们与查询关键字的文本相关性和空间接近程度以及查询位置三者排序最高的返回。我们定义、研究并提供计算的方法，是基于 top-k 关键字的反向位置查询的。这种新类型的查询使用一组关键字、一个查询对象 q 和一个数字 k 作为参数，它返回一个空间区域，这样任何带有查询关键字的 top-k 空间关键字查询，和可能在结果中包含对象 q 的该区域的一个位置。此查询针对市场分析、地理规划和位置优化中应用程序，它可能支持在基于位置的服务中广泛使用的与安全区域和影响区域相关的应用程序。

我们证明，计算精确的查询结果需要计算和合并一组加权 Voronoi 单元，这是非常昂贵的。因此，我们设计了有效的算法来近似带有质量保证的结果区域。我们在索引之上开发新的修剪技术，并提供一系列优化技术，以进一步加速查询处理。实证研究表明，提出的查询处理是有效的和可扩展的。

【单词】
proliferation：n. 增殖，扩散；分芽繁殖；
devise：vt. 设计；想出；发明；图谋；遗赠给；
Empirical studies：实证研究；

---

Reverse Top-k Geo-Social Keyword Queries in Road Networks
反向 top-k 地理 - 社会关键字查询在道路网络中

---

Mismatching Trees and BWT Arrays: A New Way for String Matching with k-Mismatches
不匹配树和 BWT 数组：字符串匹配与 k 不匹配的新方法

---

Source-LDA: Enhancing probabilistic topic models using prior knowledge sources
source-LDA：使用先前的知识来源增强概率主题模型

1.3 Research Session 2A: Data Mining

Network Backboning with Noisy Data
有噪声数据的网络反向连接

---

Scalable Informative Rule Mining
可伸缩的关联规则

---

Streaming k-Means Clustering with Fast Queries
使用快速查询的流化 k-means 集群

---

Density based Clustering over Location Based Services
基于密度的集群优于基于位置的服务

1.4 Research Session 2B: Query Optimization and Provenance

Provenance-aware Query Optimization
知晓出处的查询优化

---

A SQL-Middleware Unifying Why and Why-Not Provenance for First-Order Queries
一种 SQL 中间件统一定义为什么和为什么不使用第一阶查询的出处
【单词】
unifying：统一，使统一；
Provenance：出处；

---

Extended Characteristic Sets: Graph Indexing for SPARQL Query Optimization

---

TT-Join: Efficient Set Containment Join
tt-Join: 高效的集合包含连接
【单词】：
containment：n. 包含

1.5 Research Session 3A: Systems for New Analytics

Scalable Linear Algebra on a Relational Database System
KeystoneML: Optimizing Pipelines for Large-Scale Advanced Analytics

Parallel SPARQL Query Optimization

Efficient Scalable Accurate Regression Queries in In-DBMS Analytic