Sciweavers

1192 search results - page 127 / 239
» Symbolic Query Exploration
Sort
View
226
Voted
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
16 years 3 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish
ADBIS
2009
Springer
140views Database» more  ADBIS 2009»
15 years 10 months ago
Optimizing Maintenance of Constraint-Based Database Caches
Abstract. Caching data reduces user-perceived latency and often enhances availability in case of server crashes or network failures. DB caching aims at local processing of declarat...
Joachim Klein 0002, Susanne Braun
127
Voted
PEPM
2010
ACM
16 years 6 days ago
Optimizing relational algebra operations using generic equivalence discriminators and lazy products
We show how to efficiently evaluate generic map-filter-product queries, generalizations of select-project-join (SPJ) queries in relational algebra, based on a combination of two...
Fritz Henglein
FOCS
2000
IEEE
15 years 7 months ago
Opportunistic Data Structures with Applications
There is an upsurging interest in designing succinct data structures for basic searching problems (see [23] and references therein). The motivation has to be found in the exponent...
Paolo Ferragina, Giovanni Manzini
AAAI
2008
15 years 5 months ago
Using a Geometric-Based Sketch Recognition Approach to Sketch Chinese Radicals
Unlike English, where unfamiliar words can be queried for its meaning by typing out its letters, the analogous operation in Chinese is far from trivial due to the nature of its wr...
Paul Taele, Tracy Hammond