Sciweavers

2514 search results - page 62 / 503
» On the Computation of Approximations of Database Queries
Sort
View
AAAI
2006
15 years 7 months ago
Supporting Queries with Imprecise Constraints
In this paper, we motivate the need for and challenges involved in supporting imprecise queries over Web databases. Then we briefly explain our solution, AIMQ - a domain independe...
Ullas Nambiar, Subbarao Kambhampati
SIGMOD
2004
ACM
166views Database» more  SIGMOD 2004»
16 years 6 months ago
Fast Computation of Database Operations using Graphics Processors
We present new algorithms on commodity graphics processors to perform fast computation of several common database operations. Specifically, we consider operations such as conjunct...
Naga K. Govindaraju, Brandon Lloyd, Wei Wang 0010,...
ENGL
2007
78views more  ENGL 2007»
15 years 6 months ago
A Method for Secure Query Processing in Mobile Databases
—A method for secure query processing in mobile databases has been presented in this paper. Mobile devices send queries to the server via point-to-point channels. The mobile data...
D. Saha, N. Chowdhury
ICDE
2011
IEEE
243views Database» more  ICDE 2011»
14 years 10 months ago
Interactive SQL query suggestion: Making databases user-friendly
— SQL is a classical and powerful tool for querying relational databases. However, it is rather hard for inexperienced users to pose SQL queries, as they are required to be proï¬...
Ju Fan, Guoliang Li, Lizhu Zhou
ICAPR
2009
Springer
16 years 27 days ago
Hierarchical Local Maps for Robust Approximate Nearest Neighbor Computation
In this paper, we propose a novel method for fast nearest neighbors retrieval in non-Euclidean and non-metric spaces. We organize the data into a hierarchical fashion that preserv...
Pratyush Bhatt, Anoop M. Namboodiri