Sciweavers

3225 search results - page 375 / 645
» Query Optimization by Stored Queries
Sort
View
CIKM
2009
Springer
15 years 11 months ago
Space-economical partial gram indices for exact substring matching
Exact substring matching queries on large data collections can be answered using q-gram indices, that store for each occurring q-byte pattern an (ordered) posting list with the po...
Nan Tang, Lefteris Sidirourgos, Peter A. Boncz
SIGMOD
2010
ACM
215views Database» more  SIGMOD 2010»
15 years 10 months ago
Dynamic symbolic database application testing
A database application differs form regular applications in that some of its inputs may be database queries. The program will execute the queries on a database and may use any re...
Chengkai Li, Christoph Csallner
COMPGEOM
2005
ACM
15 years 8 months ago
Cache-oblivious r-trees
We develop a cache-oblivious data structure for storing a set S of N axis-aligned rectangles in the plane, such that all rectangles in S intersecting a query rectangle or point ca...
Lars Arge, Mark de Berg, Herman J. Haverkort
GIS
2010
ACM
15 years 1 months ago
Modelling spatial video as part of a GIS video analysis framework
It is now common for video; real-time and collected, mobile and static, to be georeferenced and stored in large archives for users of expert systems to access and interact with. I...
Paul Lewis
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 10 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko