9683 search results - page 601 / 1937 » Predicting query performance |
229
click to vote
TKDE
2010
15 years 2 months ago
2010
DHT is a widely used building block for scalable P2P systems. However, as uniform hashing employed in DHTs destroys data locality, it is not a trivial task to support complex queri...
215
Voted
SBBD
2004
15 years 8 months ago
2004
In order to index text fields in XML databases for similarity queries, M-Trees may be applied. However, some datasets experiments using M-Trees for this purpose resulted in low qu...
205
click to vote
DAWAK
2010
Springer
15 years 8 months ago
2010
Springer
Spatial data warehouses (SDW) enable analytical multidimensional queries together with spatial analysis. Mainly, three operations are related to SDW query processing performance: (...
204
Voted
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We have compared the performance of five non-commercial triple stores, Virtuoso-open source, Jena SDB, Jena TDB, SWIFT-OWLIM and 4Store. We examined three performance aspects: the ...
266
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Today's query processing engines do not take advantage of the multiple occurrences of a relation in a query to improve performance. Instead, each instance is treated as a dis...