Sciweavers

2514 search results - page 53 / 503
» On the Computation of Approximations of Database Queries
Sort
View
SIGMOD
2005
ACM
133views Database» more  SIGMOD 2005»
16 years 6 months ago
Constrained Optimalities in Query Personalization
Personalization is a powerful mechanism that helps users to cope with the abundance of information on the Web. Database query personalization achieves this by dynamically construc...
Georgia Koutrika, Yannis E. Ioannidis
PODS
2006
ACM
217views Database» more  PODS 2006»
16 years 6 months ago
A simpler and more efficient deterministic scheme for finding frequent items over sliding windows
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
Lap-Kei Lee, H. F. Ting
3DPVT
2006
IEEE
171views Visualization» more  3DPVT 2006»
16 years 11 days ago
Image Based Localization in Urban Environments
In this paper we present a prototype system for image based localization in urban environments. Given a database of views of city street scenes tagged by GPS locations, the system...
Wei Zhang, Jana Kosecka
SIGMOD
2002
ACM
118views Database» more  SIGMOD 2002»
16 years 6 months ago
Compressing SQL workloads
Recently several important relational database tasks such as index selection, histogram tuning, approximate query processing, and statistics selection have recognized the importan...
Surajit Chaudhuri, Ashish Kumar Gupta, Vivek R. Na...
SSDBM
2000
IEEE
128views Database» more  SSDBM 2000»
15 years 10 months ago
Supporting Content-Based Searches on Time Series via Approximation
Fast retrieval of time series in terms of their contents is important in many application domains. This paper studies database techniques supporting fast searches for time series ...
Changzhou Wang, Xiaoyang Sean Wang