513 search results - page 66 / 103 » Cache Conscious Algorithms for Relational Query Processing |
GVD
2004
14 years 11 months ago
2004
In some information retrieval scenarios, for example internal help desk systems, texts are entered into the document collection without proofreading. This can result in a relative...
JIIS
2006
14 years 9 months ago
2006
A join of two relations in real databases is usually much smaller than their cartesian product. This means that most of the combinations of tuples in the crossproduct of the respe...
84
Voted
COMAD
1994
14 years 11 months ago
1994
Many parallel join algorithms have been proposed in the last several years. However, most of these algorithms require that the amount of data to be joined is known in advance in o...
100
click to vote
BNCOD
2007
14 years 11 months ago
2007
Order is essential for XML query processing. Efficient XML processing with order consideration over relational storage is non-trivial, especially for complex nested XQuery expressi...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...