This work introduces novel polynomial algorithms for processing top-k queries in uncertain databases under the generally adopted model of x-relations. An x-relation consists of a n...
Ke Yi, Feifei Li, George Kollios, Divesh Srivastav...
We are witnessing in recent years growing interest for location-dependent information services among mobile users. This paper examines the issue of processing locationdependent qu...
Jianliang Xu, Baihua Zheng, Wang-Chien Lee, Dik Lu...
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
A k-query locally decodable code (LDC) C : n N encodes each message x into a codeword C(x) such that each symbol of x can be probabilistically recovered by querying only k coordina...
Yeow Meng Chee, Tao Feng, San Ling, Huaxiong Wang,...
We consider pedigree data structured in the form of a directed acyclic graph, and use an encoding scheme, called NodeCodes, for expediting the evaluation of queries on pedigree gr...
Brendan Elliott, Suleyman Fatih Akgul, Stephen May...