Sciweavers

529 search results - page 7 / 106
» Improving verbose queries using subset distribution
Sort
View
PVM
2001
Springer
14 years 5 days ago
Using a Network of Workstations to Enhance Database Query Processing Performance
Query processing in database systems may be improved by applying parallel processing techniques. One reason for improving query response time is to support the increased number que...
Mohammed Al Haddad, Jerome Robinson
ICTAI
2003
IEEE
14 years 1 months ago
Query Expansion and Query Reduction in Document Retrieval
We investigate two seemingly incompatible approaches for improving document retrieval performance in the context of question answering: query expansion and query reduction. Querie...
Ingrid Zukerman, Bhavani Raskutti, Yingying Wen
IJCAI
2007
13 years 9 months ago
An Improved Probabilistic Ant based Clustering for Distributed Databases
In this paper we present an improved version of the Probabilistic Ant based Clustering Algorithm for Distributed Databases (PACE). The most important feature of this algorithm is ...
Chandrasekar Ramachandran, Thanukrishnan Srinivasa...
CIKM
2009
Springer
14 years 2 months ago
Independent informative subgraph mining for graph information retrieval
In order to enable scalable querying of graph databases, intelligent selection of subgraphs to index is essential. An improved index can reduce response times for graph queries si...
Bingjun Sun, Prasenjit Mitra, C. Lee Giles
ICDE
2008
IEEE
131views Database» more  ICDE 2008»
14 years 9 months ago
Parallel Evaluation of Composite Aggregate Queries
Aggregate measures summarizing subsets of data are valuable in exploratory analysis and decision support, especially when dependent aggregations can be easily specified and compute...
Lei Chen 0003, Christopher Olston, Raghu Ramakrish...