2023
conference-paper
OpenAlex
Dingjie Zhang, Qinghua Wu, Yuankang Zhao, Zhenyu Li et autres
Recent years have witnessed the shift of cloud datacenter architecture from monolithic to microservice. In microservice, request latency which fundamentally determines application performance, has become a crucial concern for cloud operators. Due to various issues with hosts, networks, and remote services, microservices …
cn
(code pays fourni par la source)
2021
conference-paper
OpenAlex
Rui Zhang, Pengyu Sun, Jiancong Tong, Ruirui Zang et autres
The query processing in search engines can be classified into either disk I/O operations and CPU computation operations. Conventional search engine caching methods mostly aimed at reducing disk I/O operations. However, with the new trend of using solid state drives (SSDs) instead …
cn
(code pays fourni par la source)
2019
article
OpenAlex
Yusen Li, Xueyan Tang, Wentong Cai, Jiancong Tong et autres
With the rapid growth of the Web scale, large scale search engines have to set up a huge number of machines to place the index files of the Web contents. The index files are normally divided into smaller index shards which are …
cn, sg
(code pays fourni par la source)
2018
paratext
OpenAlex
Yusen Li, Xueyan Tang, Wentong Cai, Jiancong Tong et autres
With the rapid growth of the Web scale, large scale search engines have to set up a huge number of machines to place the index files of the Web contents. The index files are normally divided into smaller index shards which are …
cn, sg
(code pays fourni par la source)
2016
conference-paper
OpenAlex
Zhaohua Zhang, Jiancong Tong, Haibing Huang, Jin Liang et autres
Large-scale search engines need to answer thousands of queries per second over billions of documents, which is typically done by querying a large inverted index. Many highly optimized integer encoding techniques are applied to compress the inverted index and reduce the query …
cn
(code pays fourni par la source)
Accès ouvert
2016
preprint
OpenAlex
Yang Ju, Jiancong Tong, Rebecca J. Stones, Zhaohua Zhang et autres
When two terms occur together in a document, the probability of a close relationship between them and the document itself is greater if they are in nearby positions. However, ranking functions including term proximity (TP) require larger indexes than traditional document-level indexing, …
2015
conference-paper
OpenAlex
Rui Zhang, Pengyu Sun, Jiancong Tong, Rebecca J. Stones et autres
In response to a user query, search engines return the top-k relevant results, each of which contains a small piece of text, called a snippet, extracted from the corresponding document. Obtaining a snippet is time consuming as it requires both document retrieval …
cn
(code pays fourni par la source)
2014
conference-paper
OpenAlex
Jiancong Tong, Anthony Wirth, Justin Zobel
Relative Lempel-Ziv (RLZ) compression has been shown to be effective for compression of large text repositories. It provides high compression ratios with extremely fast atomic decompression of individual documents. However, it depends on a large in-memory dictionary, which is implemented as a …
au, cn
(code pays fourni par la source)
2014
conference-paper
OpenAlex
Jiancong Tong, Anthony Wirth, Justin Zobel
Compression is widely exploited in retrieval systems, such as search engines and text databases, to lower both retrieval costs and system latency. In particular, compression of repositories can reduce storage requirements and fetch times, while improving caching. One of the most effective …
cn, au
(code pays fourni par la source)
2014
article
OpenAlex
Jianguo Wang, Eric Lo, Man Lung Yiu, Jiancong Tong et autres
Caching is an important optimization in search engine architectures. Existing caching techniques for search engine optimization are mostly biased towards the reduction of random accesses to disks, because random accesses are known to be much more expensive than sequential accesses in traditional …
us, hk, cn
(code pays fourni par la source)
2014
conference-paper
OpenAlex
Jiancong Tong, Anthony Wirth, Justin Zobel
Compression of collections, such as text databases, can both reduce space consumption and increase retrieval efficiency, through better caching and better exploitation of the memory hierarchy. A promising technique is relative Lempel-Ziv coding, in which a sample of material from the collection …
cn, au
(code pays fourni par la source)
2013
conference-paper
OpenAlex
Jiancong Tong, Gang Wang, Douglas S. Stones, Shizhao Sun et autres
Caching technologies have been widely employed to boost the performance of Web search engines. Motivated by the correlation between terms in query logs from a commercial search engine, we explore the idea of a caching scheme based on pairs of terms, rather …
cn, au
(code pays fourni par la source)