Sciweavers

1533 search results - page 97 / 307
» Ordering the attributes of query results
Sort
View
WWW
2001
ACM
14 years 8 months ago
Clustering user queries of a search engine
In order to increase retrieval precision, some new search engines provide manually verified answers to Frequently Asked Queries (FAQs). An underlying task is the identification of...
Ji-Rong Wen, Jian-Yun Nie, HongJiang Zhang
FUIN
2006
139views more  FUIN 2006»
13 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
EDBT
2009
ACM
132views Database» more  EDBT 2009»
14 years 2 months ago
A novel approach for efficient supergraph query processing on graph databases
In recent years, large amount of data modeled by graphs, namely graph data, have been collected in various domains. Efficiently processing queries on graph databases has attracted...
Shuo Zhang, Jianzhong Li, Hong Gao, Zhaonian Zou
PPAM
2005
Springer
14 years 1 months ago
Parallel Query Processing and Edge Ranking of Graphs
Abstract. 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 algorit...
Dariusz Dereniowski, Marek Kubale
VLDB
2004
ACM
103views Database» more  VLDB 2004»
14 years 1 months ago
Maintenance of Spatial Semijoin Queries on Moving Points
In this paper, we address the maintenance of spatial semijoin queries over continuously moving points, where points are modeled as linear functions of time. This is analogous to t...
Glenn S. Iwerks, Hanan Samet, Kenneth P. Smith