Sciweavers

2853 search results - page 65 / 571
» On the Efficiency of Provenance Queries
Sort
View
ICDE
2008
IEEE
127views Database» more  ICDE 2008»
16 years 7 months ago
Efficient Processing of Top-k Queries in Uncertain Databases
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...
ICDE
2003
IEEE
157views Database» more  ICDE 2003»
16 years 7 months ago
Energy Efficient Index for Querying Location-Dependent Data in Mobile Broadcast Environments
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...
CIKM
2009
Springer
15 years 10 months ago
Multidimensional routing indices for efficient distributed query processing
Traditional routing indices in peer-to-peer (P2P) networks are mainly designed for document retrieval applications and maintain aggregated one-dimensional values representing the ...
Christos Doulkeridis, Akrivi Vlachou, Kjetil N&osl...
CORR
2010
Springer
230views Education» more  CORR 2010»
15 years 2 months ago
Query-Efficient Locally Decodable Codes of Subexponential Length
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,...
SSDBM
2007
IEEE
107views Database» more  SSDBM 2007»
16 years 13 days ago
Efficient Evaluation of Inbreeding Queries on Pedigree Data
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...