3225 search results - page 229 / 645 » Query Optimization by Stored Queries |
141
click to vote
COMPGEOM
2010
ACM
15 years 10 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
168
click to vote
SIGIR
2011
ACM
14 years 7 months ago
2011
ACM
Inverted indexes are the most fundamental and widely used data structures in information retrieval. For each unique word occurring in a document collection, the inverted index sto...
125
click to vote
ICDT
2005
ACM
15 years 10 months ago
2005
ACM
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
163
click to vote
CVDB
2005
ACM
15 years 7 months ago
2005
ACM
The typical mode for querying in an image content-based information system is query-by-example, which allows the user to provide an image as a query and to search for similar imag...
140
Voted
JC
2007
15 years 5 months ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...