Sciweavers

9683 search results - page 591 / 1937
» Predicting query performance
Sort
View
IS
2007
15 years 7 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...
JCSS
1998
51views more  JCSS 1998»
15 years 7 months ago
Randomized Query Processing in Robot Path Planning
d Abstract) LYDIA E. KAVRAKI   JEAN-CLAUDE LATOMBE   RAJEEV MOTWANI ¡ PRABHAKAR RAGHAVAN ¢ The subject of this paper is the analysis of a randomized preprocessing scheme that ...
Lydia E. Kavraki, Jean-Claude Latombe, Rajeev Motw...
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
PVLDB
2010
97views more  PVLDB 2010»
15 years 5 months ago
Generating Databases for Query Workloads
To evaluate the performance of database applications and DBMSs, we usually execute workloads of queries on generated databases of different sizes and measure the response time. Th...
Eric Lo, Nick Cheng, Wing-Kai Hon
ACNS
2006
Springer
109views Cryptology» more  ACNS 2006»
16 years 1 months ago
Misusing Unstructured P2P Systems to Perform DoS Attacks: The Network That Never Forgets
Unstructured P2P systems have gained great popularity in recent years and are currently used by millions of users. One fundamental property of these systems is the lack of structu...
Elias Athanasopoulos, Kostas G. Anagnostakis, Evan...