Sciweavers

2853 search results - page 215 / 571
» On the Efficiency of Provenance Queries
Sort
View
ECIR
2006
Springer
15 years 8 months ago
Comparing Different Architectures for Query Routing in Peer-to-Peer Networks
Abstract. Efficient and effective routing of content-based queries is an emerging problem in peer-to-peer networks, and can be seen as an extension of the traditional "resourc...
Henrik Nottelmann, Norbert Fuhr
PVLDB
2008
138views more  PVLDB 2008»
15 years 6 months ago
Authenticating the query results of text search engines
The number of successful attacks on the Internet shows that it is very difficult to guarantee the security of online search engines. A breached server that is not detected in time...
HweeHwa Pang, Kyriakos Mouratidis
JDCTA
2010
151views more  JDCTA 2010»
15 years 1 months ago
Research on Querying Node Probability Method in Probabilistic XML Data Based on Possible World
In order to solve the low efficiency problem of directly querying single node probability in the set of all ordinary XML data obtained by enumerating possible world set of the cor...
Jianwei Wang, Zhongxiao Hao
ICDE
2007
IEEE
127views Database» more  ICDE 2007»
16 years 8 months ago
Efficiently Detecting Inclusion Dependencies
Data sources for data integration often come with spurious schema definitions such as undefined foreign key constraints. Such metadata are important for querying the database and ...
Jana Bauckmann, Ulf Leser, Felix Naumann, Veroniqu...
EDBT
2006
ACM
129views Database» more  EDBT 2006»
16 years 6 months ago
Efficient Quantile Retrieval on Multi-dimensional Data
Given a set of N multi-dimensional points, we study the computation of -quantiles according to a ranking function F, which is provided by the user at runtime. Specifically, F compu...
Man Lung Yiu, Nikos Mamoulis, Yufei Tao