316 search results - page 14 / 64 » Parallel Selection Query Processing Involving Index in Paral... |
154
click to vote
JIDM
2010
14 years 9 months ago
2010
The increasing volume of data stored as XML documents makes fragmentation techniques an alternative to the performance issues in query processing. Fragmented databases are feasible...
126
click to vote
IPM
2007
15 years 2 months ago
2007
The performance of parallel query processing in a cluster of index servers is crucial for modern web search systems. In such a scenario, the response time basically depends on the...
124
Voted
CF
2009
ACM
15 years 7 months ago
2009
ACM
Decision Support System (DSS) workloads are known to be one of the most time-consuming database workloads that processes large data sets. Traditionally, DSS queries have been acce...
128
click to vote
DATESO
2010
15 years 10 days ago
2010
Abstract. Current XPath processors use direct approach to query evaluation which is quite inefficient in some cases and usually implemented serially. This may be a problem in case ...
132
click to vote
GEOINFO
2003
15 years 3 months ago
2003
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...