Sciweavers

627 search results - page 27 / 126
» Efficient Top-k Query Evaluation on Probabilistic Data
Sort
View
ICDE
2003
IEEE
157views Database» more  ICDE 2003»
15 years 11 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...
SIGMOD
2009
ACM
215views Database» more  SIGMOD 2009»
15 years 9 months ago
Efficient type-ahead search on relational data: a TASTIER approach
Existing keyword-search systems in relational databases require users to submit a complete query to compute answers. Often users feel "left in the dark" when they have l...
Guoliang Li, Shengyue Ji, Chen Li, Jianhua Feng
WSDM
2012
ACM
285views Data Mining» more  WSDM 2012»
13 years 5 months ago
Probabilistic models for personalizing web search
We present a new approach for personalizing Web search results to a specific user. Ranking functions for Web search engines are typically trained by machine learning algorithms u...
David Sontag, Kevyn Collins-Thompson, Paul N. Benn...
90
Voted
VLDB
2001
ACM
113views Database» more  VLDB 2001»
15 years 1 months ago
Querying XML Views of Relational Data
XML has emerged as the standard data exchange format for Internet-based business applications. This has created the need to publish existing business data, stored in relational da...
Jayavel Shanmugasundaram, Jerry Kiernan, Eugene J....
SODA
2004
ACM
137views Algorithms» more  SODA 2004»
14 years 11 months ago
The Bloomier filter: an efficient data structure for static support lookup tables
We introduce the Bloomier filter, a data structure for compactly encoding a function with static support in order to support approximate evaluation queries. Our construction gener...
Bernard Chazelle, Joe Kilian, Ronitt Rubinfeld, Ay...