1160 search results - page 196 / 232 » Query Processing and Optimization for Pictorial Query Trees |
CIKM
2010
Springer
14 years 8 months ago
2010
Springer
Current Information Retrieval systems use inverted index structures for efficient query processing. Due to the extremely large size of many data sets, these index structures are u...
CIKM
2005
Springer
15 years 3 months ago
2005
Springer
With this work we aim to make a three-fold contribution. We first address the issue of supporting efficiently queries over string-attributes involving prefix, suffix, containmen...
110
click to vote
CIDR
2009
14 years 11 months ago
2009
High-volume, high-speed data streams may overwhelm the capabilities of stream processing systems; techniques such as data prioritization, avoidance of unnecessary processing and o...
PODS
2002
ACM
15 years 10 months ago
2002
ACM
We study two classes of view update problems in relational databases. We are given a source database S, a monotone query Q, and the view Q(S) generated by the query. The first pro...
DEXA
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. Bitmap indices are popular multi-dimensional data structures for accessing read-mostly data such as data warehouse (DW) applications, decision support systems (DSS) and o...