4337 search results - page 200 / 868 » Cache-Oblivious Query Processing |
116
click to vote
SPIRE
2004
Springer
15 years 7 months ago
2004
Springer
In the area of Text Retrieval, processing a query in the vector model has been verified to be qualitatively more effective than searching in the boolean model. However, in case o...
190
click to vote
SIGMOD
2005
ACM
16 years 2 months ago
2005
ACM
The key of overlapping structures or concurrent markup hierarchies in XML encodings of documents is that markup in one hierarchy is not necessarily well-formed with respect to the...
108
click to vote
FORTE
2001
15 years 3 months ago
2001
The modal logic FULL is designed to capture strong bisimulation over early symbolic transition systems (STSs) for full LOTOS. It provides a compact way of expressing and verifying ...
113
Voted
CORR
2006
Springer
15 years 2 months ago
2006
Springer
We present a decomposition-based approach to managing probabilistic information. We introduce world-set decompositions (WSDs), a space-efficient and complete representation system ...
134
click to vote
SIGMOD
2003
ACM
16 years 2 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...