Jiaheng Lu
Jiaheng Lu

homepage
jiahengluatgmail.com

Professional ACM Member badge
  Affiliation history
Bibliometrics: publication history
Average citations per article12.15
Citation Count668
Publication count55
Publication years2004-2018
Available for download29
Average downloads per article372.41
Downloads (cumulative)10,800
Downloads (12 Months)1,040
Downloads (6 Weeks)111
SEARCH
ROLE
Arrow RightAuthor only
· Editor only
· Other only
· All roles


AUTHOR'S COLLEAGUES
See all colleagues of this author

SUBJECT AREAS
See all subject areas




BOOKMARK & SHARE


57 results found Export Results: bibtexendnoteacmrefcsv

Result 1 – 20 of 57
Result page: 1 2 3

Sort by:

1 published by ACM
October 2018 CIKM '18: Proceedings of the 27th ACM International Conference on Information and Knowledge Management
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 11,   Downloads (12 Months): 63,   Downloads (Overall): 63

Full text available: PDFPDF
A similarity join aims to find all similar pairs between two collections of records. Established approaches usually deal with synthetic differences like typos and abbreviations, but neglect the semantic relations between words. Such relations, however, are helpful for obtaining high-quality joining results. In this paper, we leverage the taxonomy knowledge ...
Keywords: estimation, prefix filtering, similarity join, taxonomic similarity

2 published by ACM
October 2018 CIKM '18: Proceedings of the 27th ACM International Conference on Information and Knowledge Management
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 9,   Downloads (12 Months): 58,   Downloads (Overall): 58

Full text available: PDFPDF
One of the most challenging issues in the era of Big Data is the Variety of the data. In general, there are two solutions to directly manage multi-model data currently: a single integrated multi-model database system or a tightly-integrated middleware over multiple single-model data stores. In this tutorial, we review ...
Keywords: big data, category theory, multi-model databases, polystores, variety of data

3
February 2018 The VLDB Journal — The International Journal on Very Large Data Bases: Volume 27 Issue 1, February 2018
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 0,   Downloads (Overall): 0

Full text available: PDFPDF
Traditional top-k algorithms, e.g., TA and NRA, have been successfully applied in many areas such as information retrieval, data mining and databases. They are designed to discover k objects, e.g., top-k restaurants, with highest overall scores aggregated from different attributes, e.g., price and location. However, new emerging applications like query ...
Keywords: Top-k query, Top-k, m query, Instance optimal algorithm

4
December 2017 Cluster Computing: Volume 20 Issue 4, December 2017
Publisher: Kluwer Academic Publishers
Bibliometrics:
Citation Count: 0

Scientific literature contains a lot of meaningful objects such as Figures, Tables, Definitions, Algorithms, etc., which are called Knowledge Cells hereafter. An advanced academic search engine which could take advantage of Knowledge Cells and their various relationships to obtain more accurate search results is expected. Further, it's expected to provide ...
Keywords: Crowdsourcing, Knowledge acquisition, Academic knowledge graph, Knowledge cells

5
September 2017 Proceedings of the VLDB Endowment - Proceedings of the 44th International Conference on Very Large Data Bases, Rio de Janeiro, Brazil: Volume 11 Issue 1, September 2017
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2,   Downloads (12 Months): 2,   Downloads (Overall): 2

Full text available: PDFPDF
Single-source and top- k SimRank queries are two important types of similarity search in graphs with numerous applications in web mining, social network analysis, spam detection, etc. A plethora of techniques have been proposed for these two types of queries, but very few can efficiently support similarity search over large ...

6 published by ACM
May 2017 SIGMOD '17: Proceedings of the 2017 ACM International Conference on Management of Data
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 8,   Downloads (12 Months): 89,   Downloads (Overall): 636

Full text available: PDFPDF
As one of the most well known graph computation problems, Personalized PageRank is an effective approach for computing the similarity score between two nodes, and it has been widely used in various applications, such as link prediction and recommendation. Due to the high computational cost and space cost of computing ...
Keywords: personalized pagerank, random walk with restart, random walks

7
April 2017 WWW '17 Companion: Proceedings of the 26th International Conference on World Wide Web Companion
Publisher: International World Wide Web Conferences Steering Committee
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 4,   Downloads (12 Months): 53,   Downloads (Overall): 64

Full text available: PDFPDF
This paper studies the location-sensitive auto-completion problem. We propose an efficient algorithm SQA running on a native index combining both IR-tree and Trie index. The experiments on real-life datasets demonstrate that SQA outperforms baseline methods by one order of magnitude.
Keywords: auto-completion, location sensitive search, spatial keyword search

8
April 2016 PAKDD 2016: Proceedings, Part II, of the 20th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining - Volume 9652
Publisher: Springer-Verlag
Bibliometrics:
Citation Count: 0

Classic data analysis techniques generally assume that variables have single values only. However, the data complexity during the age of big data has gone beyond the classic framework such that variable values probably take the form of a set of stochastic measurements instead. We refer to the above case as ...
Keywords: Emitter parameter analysis, Incremental learning, Hierarchical clustering, Symbolic data analysis, Stochastic pattern

9 published by ACM
November 2015 SIGSPATIAL '15: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2,   Downloads (12 Months): 11,   Downloads (Overall): 87

Full text available: PDFPDF
With the proliferation of local services and GPS-enabled mobile phones, reverse spatial-keyword Nearest Neighbor queries are becoming an important type of query. Given a service object (e.g., shop) q as the query, which has a location and a text description, we return customers such that q is one of top- ...
Keywords: reverse k nearest neighbor, spatial-keyword query

10 published by ACM
October 2015 ACM Transactions on Database Systems (TODS): Volume 40 Issue 3, October 2015
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 9,   Downloads (12 Months): 66,   Downloads (Overall): 375

Full text available: PDFPDF
A string-similarity measure quantifies the similarity between two text strings for approximate string matching or comparison. For example, the strings “Sam” and “Samuel” can be considered to be similar. Most existing work that computes the similarity of two strings only considers syntactic similarities, for example, number of common words or ...
Keywords: String similarity search, semantic search, similarity join

11
September 2015 Proceedings of the VLDB Endowment - Proceedings of the 41st International Conference on Very Large Data Bases, Kohala Coast, Hawaii: Volume 8 Issue 13, September 2015
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 3,   Downloads (12 Months): 27,   Downloads (Overall): 123

Full text available: PDFPDF
Maximum independent set (MIS) is a fundamental problem in graph theory and it has important applications in many areas such as social network analysis, graphical information systems and coding theory. The problem is NP-hard, and there has been numerous studies on its approximate solutions. While successful to a certain degree, ...

12
August 2014 Proceedings of the VLDB Endowment: Volume 7 Issue 13, August 2014
Publisher: VLDB Endowment
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 7,   Downloads (12 Months): 28,   Downloads (Overall): 78

Full text available: PDFPDF
MapReduce based data-intensive computing solutions are increasingly deployed as production systems. Unlike Internet companies who invent and adopt the technology from the very beginning, traditional enterprises demand easy-to-use software due to the limited capabilities of administrators. Automatic job optimization software for MapReduce is a promising technique to satisfy such requirements. ...

13 published by ACM
May 2014 ACM Transactions on Database Systems (TODS): Volume 39 Issue 2, May 2014
Publisher: ACM
Bibliometrics:
Citation Count: 8
Downloads (6 Weeks): 6,   Downloads (12 Months): 29,   Downloads (Overall): 502

Full text available: PDFPDF
Geographic objects associated with descriptive texts are becoming prevalent, justifying the need for spatial-keyword queries that consider both locations and textual descriptions of the objects. Specifically, the relevance of an object to a query is measured by spatial-textual similarity that is based on both spatial proximity and textual similarity. In ...
Keywords: Reverse k-nearest neighbor queries, performance analysis, spatial-keyword query

14
November 2013 ER 2013: Proceedings of the 32nd International Conference on Conceptual Modeling - Volume 8217
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1

Existing XML keyword search approaches can be categorized into tree-based search and graph-based search. Both of them are structure-based search because they mainly rely on the exploration of the structural features of document. Those structure-based approaches cannot fully exploit hidden semantics in XML document. This causes serious problems in processing ...
Keywords: keyword search, XML, object, semantics

15 published by ACM
July 2013 SSDBM: Proceedings of the 25th International Conference on Scientific and Statistical Database Management
Publisher: ACM
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 1,   Downloads (12 Months): 23,   Downloads (Overall): 80

Full text available: PDFPDF
Hamming distance measures the number of dimensions where two vectors have different values. In applications such as pattern recognition, information retrieval, and databases, we often need to efficiently process Hamming distance query , which retrieves vectors in a database that have no more than k Hamming distance from a given ...

16 published by ACM
June 2013 SIGMOD '13: Proceedings of the 2013 ACM SIGMOD International Conference on Management of Data
Publisher: ACM
Bibliometrics:
Citation Count: 12
Downloads (6 Weeks): 5,   Downloads (12 Months): 68,   Downloads (Overall): 570

Full text available: PDFPDF
A string similarity measure quantifies the similarity between two text strings for approximate string matching or comparison. For example, the strings "Sam" and "Samuel" can be considered similar. Most existing work that computes the similarity of two strings only considers syntactic similarities, e.g., number of common words or q-grams. While ...
Keywords: similarity join, similarity search, filter estimation

17
June 2013 The VLDB Journal — The International Journal on Very Large Data Bases: Volume 22 Issue 3, June 2013
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 4,   Downloads (Overall): 48

Full text available: PDFPDF
Searching for occurrences of a twig pattern query (TPQ) in an XML document is a core task of all XML database query languages. The generalized twig pattern (GTP) extends the TPQ model to include semantics related to output nodes, optional nodes, and boolean expressions which are part of the XQuery ...
Keywords: XML, Generalized twig pattern, Holistic algorithms, Query processing

18
April 2013 Frontiers of Computer Science: Selected Publications from Chinese Universities: Volume 7 Issue 2, April 2013
Publisher: Springer-Verlag New York, Inc.
Bibliometrics:
Citation Count: 5

There is a trend that, virtually everyone, ranging from big Web companies to traditional enterprisers to physical science researchers to social scientists, is either already experiencing or anticipating unprecedented growth in the amount of data available in their world, as well as new opportunities and great untapped value. This paper ...
Keywords: databases, performance, big data

19
March 2013
Bibliometrics:
Citation Count: 1

"An Introduction to XML Query Processing and Keyword Search" systematically and comprehensively covers the latest advances in XML data searching. It presents an extensive overview of the current query processing and keyword search techniques on XML data, including XML labeling schemes, indexing, processing on order and un-order XML tree patterns, ...

20 published by ACM
August 2012 SIGIR '12: Proceedings of the 35th international ACM SIGIR conference on Research and development in information retrieval
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 6,   Downloads (12 Months): 26,   Downloads (Overall): 202

Full text available: PDFPDF
Query suggestion is a useful tool to help users express their information needs by supplying alternative queries. When evaluating the effectiveness of query suggestion algorithms, many previous studies focus on measuring whether a suggestion query is relevant or not to the input query. This assessment criterion is too simple to ...
Keywords: query suggestion, assessment criteria



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us