6274 search results - page 192 / 1255 » From query complexity to computational complexity |
138
click to vote
COMPGEOM
2005
ACM
15 years 6 months ago
2005
ACM
Let S be a set of n points moving on the real line. The kinetic sorting problem is to maintain a data structure on the set S that makes it possible to quickly generate a sorted li...
129
click to vote
IFIP
2004
Springer
15 years 10 months ago
2004
Springer
Abstract We propose an alternative notion of asymptotic behaviors for the study of type2 computational complexity. Since the classical asymptotic notion (for all but finitely many...
140
click to vote
DEXA
2005
Springer
15 years 10 months ago
2005
Springer
Bitmap indices are efficient data structures for processing complex, multi-dimensional queries in data warehouse applications and scientific data analysis. For high-cardinality at...
138
click to vote
SEBD
1996
15 years 5 months ago
1996
Abstract. To select an optimal query evaluation strategy for a path query in an object-oriented database system one has to exploit the available index structures on the path. In a ...
199
click to vote
ISEMANTICS
2010
15 years 3 months ago
2010
The Web has evolved from a global information space of linked documents to a web of linked data. The Web of Data enables answering complex, structured queries that could not be an...