Sciweavers

6650 search results - page 693 / 1330
» Mutating database queries
Sort
View
192
Voted
FUIN
2006
139views more  FUIN 2006»
15 years 7 months ago
Efficient Parallel Query Processing by Graph Ranking
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...
Dariusz Dereniowski, Marek Kubale
209
Voted
CORR
1999
Springer
96views Education» more  CORR 1999»
15 years 7 months ago
Comparative Analysis of Five XML Query Languages
XML is becoming the most relevant new standard for data representation and exchange on the WWW. Novel languages for extracting and restructuring the XML content have been proposed...
Angela Bonifati, Stefano Ceri
198
Voted
WWW
2006
ACM
16 years 8 months ago
A pruning-based approach for supporting Top-K join queries
An important issue arising from large scale data integration is how to efficiently select the top-K ranking answers from multiple sources while minimizing the transmission cost. T...
Jie Liu, Liang Feng, Yunpeng Xing
191
Voted
CIKM
2009
Springer
16 years 1 months ago
Context sensitive synonym discovery for web search queries
We propose a simple yet eective approach to context sensitive synonym discovery for Web search queries based on co-click analysis; i.e., analyzing queries leading to clicking sam...
Xing Wei, Fuchun Peng, Huihsin Tseng, Yumao Lu, Be...
DAMON
2007
Springer
16 years 1 months ago
A general framework for improving query processing performance on multi-level memory hierarchies
We propose a general framework for improving the query processing performance on multi-level memory hierarchies. Our motivation is that (1) the memory hierarchy is an important pe...
Bingsheng He, Yinan Li, Qiong Luo, Dongqing Yang