98 search results - page 11 / 20 » Efficient Inference Control for Open Relational Queries |
SIGMOD
2005
ACM
14 years 7 months ago
2005
ACM
Peer-to-peer (p2p) systems are attracting increasing attention as an efficient means of sharing data among large, diverse and dynamic sets of users. The widespread use of XML as a...
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
Recently there has been increasing interest in the development of progress indicators for SQL queries. In this paper we present a lightweight online framework for this problem. Ou...
SIGMOD
2002
ACM
14 years 7 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
FOCS
1998
IEEE
13 years 12 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
WWW
2001
ACM
14 years 8 months ago
2001
ACM
: Persistent connections address inefficiencies associated with multiple concurrent connections. They can improve response time when successfully used with pipelining to retrieve a...