Sciweavers

613 search results - page 58 / 123
» Query Evaluation on a Database Given by a Random Graph
Sort
View
115
Voted
WWW
2005
ACM
16 years 4 months ago
Scaling link-based similarity search
To exploit the similarity information hidden in the hyperlink structure of the web, this paper introduces algorithms scalable to graphs with billions of vertices on a distributed ...
Balázs Rácz, Dániel Fogaras
153
Voted
ADC
2009
Springer
178views Database» more  ADC 2009»
15 years 10 months ago
CSC: Supporting Queries on Compressed Cached XML
Whenever a client frequently has to retrieve, to query and to locally transform large parts of a huge XML document that is stored on a remote web information server, data exchange...
Stefan Böttcher, Rita Hartel
134
Voted
DEXA
2007
Springer
131views Database» more  DEXA 2007»
15 years 9 months ago
Improving Semantic Query Answering
The retrieval problem is one of the main reasoning tasks for knowledge base systems. Given a knowledge base K and a concept C, the retrieval problem consists of finding all indivi...
Norbert Kottmann, Thomas Studer
152
Voted
ICDE
2010
IEEE
254views Database» more  ICDE 2010»
16 years 3 months ago
Efficient Rank Based KNN Query Processing Over Uncertain Data
Uncertain data are inherent in many applications such as environmental surveillance and quantitative economics research. As an important problem in many applications, KNN query has...
Ying Zhang, Xuemin Lin, Gaoping ZHU, Wenjie Zhang,...
125
Voted
SIGMOD
2003
ACM
140views Database» more  SIGMOD 2003»
16 years 3 months ago
Stream Processing of XPath Queries with Predicates
We consider the problem of evaluating large numbers of XPath filters, each with many predicates, on a stream of XML documents. The solution we propose is to lazily construct a sin...
Ashish Kumar Gupta, Dan Suciu