Jiaheng Lu

Jiaheng Lu

Auto-generated profile, based on publicly available information

Jiaheng Lu

University of Helsinki

Research Focus & Metrics

Academic Career Length

23Years (2004-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
6 April 2013 in Frontiers of Computer Science
Verified
Journal Article
Closed access
PDF file
JCJinchuan Chen
Jinchuan Chen
YCYueguo Chen
Yueguo Chen
XDXiaoyong Du
Xiaoyong Du
CLCuiping Li
Cuiping Li
JLJiaheng Lu
Jiaheng Lu
XZXuan Zhou
Xuan Zhou

1 April 2008
Verified
Conference Paper
Closed access
CLChen Li
Chen Li
JLJiaheng Lu
Jiaheng Lu
YLYiming Lu
Yiming Lu
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit distance, Jaccard similarity, and cosine similarity. This problem is of great interests to a variety of applications that need a high real-time performance, such as data cleaning, query relaxation, and spellchecking. Several algorithms have been proposed based on the idea of merging inverted lists of grams generated from the strings. In this paper we make two contributions. First, we develop several algorithms that can greatly improve the performance of existing algorithms. Second, we study how to integrate existing filtering techniques with these algorithms, and show that they should be used together judiciously, since the way to do the integration can greatly affect the performance. We have conducted experiments on several real data sets to evaluate the proposed techniques.

1 March 2009 in International Conference on Data Engineering
Verified
Conference Paper
Closed access
ZBZhifeng Bao
Zhifeng Bao
TLTok Wang Ling
Tok Wang Ling
BCBo Chen
Bo Chen
JLJiaheng Lu
Jiaheng Lu
Inspired by the great success of information retrieval (IR) style keyword search on the Web, keyword search on XML has emerged recently. The difference between text database and XML database results in three new challenges: (1) Identify the user search intention, i.e. identify the XML node types that user wants to search for and search via. (2) Resolve keyword ambiguity problems: a keyword can appear as both a tag name and a text value of some node; a keyword can appear as the text values of different XML node types and carry different meanings. (3) As the search results are sub-trees of the XML document, new scoring function is needed to estimate its relevance to a given query. However, existing methods cannot resolve these challenges, thus return low result quality in term of query relevance. In this paper, we propose an IR-style approach which basically utilizes the statistics of underlying XML data to address these challenges. We first propose specific guidelines that a search engine should meet in both search intention identification and relevance oriented ranking for search results. Then based on these guidelines, we design novel formulae to identify the search for nodes and search via nodes of a query, and present a novel XML TF*IDF ranking strategy to rank the individual matches of all possible search intentions. Lastly, the proposed techniques are implemented in an XML keyword search engine called XReal, and extensive experiments show the effectiveness of our approach.

26 April 2020 in ACM Computing Surveys
Verified
Journal Article
Open access
Herodotos HerodotouHerodotos Herodotou
Herodotos Herodotou
YCYuxing Chen
Yuxing Chen
JLJiaheng Lu
Jiaheng Lu
Big data processing systems (e.g., Hadoop, Spark, Storm) contain a vast number of configuration parameters controlling parallelism, I/O behavior, memory settings, and compression. Improper parameter settings can cause significant performance degradation and stability issues. However, regular users and even expert administrators grapple with understanding and tuning them to achieve good performance. We investigate existing approaches on parameter tuning for both batch and stream data processing systems and classify them into six categories: rule-based, cost modeling, simulation-based, experiment-driven, machine learning, and adaptive tuning. We summarize the pros and cons of each approach and raise some open research problems for automatic parameter tuning.

12 June 2011
Verified
Conference Paper
Open access
JLJiaheng Lu
Jiaheng Lu
YLYing Lu
Ying Lu
GCGao Cong
Gao Cong

18 June 2019 in ACM Computing Surveys
Verified
Journal Article
Open access
JLJiaheng Lu
Jiaheng Lu
IHIrena Holubová
Irena Holubová
The variety of data is one of the most challenging issues for the research and practice in data management systems. The data are naturally organized in different formats and models, including structured data, semi-structured data, and unstructured data. In this survey, we introduce the area of multi-model DBMSs that build a single database platform to manage multi-model data. Even though multi-model databases are a newly emerging area, in recent years, we have witnessed many database systems to embrace this category. We provide a general classification and multi-dimensional comparisons for the most popular multi-model databases. This comprehensive introduction on existing approaches and open problems, from the technique and application perspective, make this survey useful for motivating new multi-model database approaches, as well as serving as a technical reference for developing multi-model database applications.