Sciweavers

5409 search results - page 1004 / 1082
» A performance study of client-broker-server systems
Sort
View
WWW
2006
ACM
16 years 16 days ago
Mining search engine query logs for query recommendation
This paper presents a simple and intuitive method for mining search engine query logs to get fast query recommendations on a large scale industrial-strength search engine. In orde...
Zhiyong Zhang, Olfa Nasraoui
HPCA
2008
IEEE
16 years 7 days ago
Uncovering hidden loop level parallelism in sequential applications
As multicore systems become the dominant mainstream computing technology, one of the most difficult challenges the industry faces is the software. Applications with large amounts ...
Hongtao Zhong, Mojtaba Mehrara, Steven A. Lieberma...
SIGMOD
2009
ACM
258views Database» more  SIGMOD 2009»
16 years 2 days ago
Continuous obstructed nearest neighbor queries in spatial databases
In this paper, we study a novel form of continuous nearest neighbor queries in the presence of obstacles, namely continuous obstructed nearest neighbor (CONN) search. It considers...
Yunjun Gao, Baihua Zheng
SIGMOD
2009
ACM
180views Database» more  SIGMOD 2009»
16 years 2 days ago
Indexing correlated probabilistic databases
With large amounts of correlated probabilistic data being generated in a wide range of application domains including sensor networks, information extraction, event detection etc.,...
Bhargav Kanagal, Amol Deshpande
SIGMOD
2008
ACM
145views Database» more  SIGMOD 2008»
16 years 14 hour ago
Optimizing complex queries with multiple relation instances
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...
Yu Cao, Gopal C. Das, Chee Yong Chan, Kian-Lee Tan
« Prev « First page 1004 / 1082 Last » Next »