613 search results - page 71 / 123 » Query Evaluation on a Database Given by a Random Graph |
PEPM
2007
ACM
15 years 6 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
109
click to vote
ICDE
2010
IEEE
15 years 4 months ago
2010
IEEE
Searching and mining large graphs today is critical to a variety of application domains, ranging from personalized recommendation in social networks, to searches for functional ass...
112
click to vote
JCSS
2008
14 years 12 months ago
2008
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
114
click to vote
ICDE
2010
IEEE
15 years 11 months ago
2010
IEEE
A large fraction of an XML document typically consists of text data. The XPath query language allows text search via the equal, contains, and starts-with predicates. Such predicate...
171
click to vote
VLDB
2002
ACM
16 years 3 days ago
2002
ACM
We propose a new data structure to search in metric spaces. A metric space is formed by a collection of objects and a distance function de ned among them, which satis es the trian...