995 search results - page 193 / 199 » Optimization of Complex Nested Queries in Relational Databas... |
STOC
2003
ACM
15 years 12 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
195
click to vote
ICDE
2002
IEEE
16 years 29 days ago
2002
IEEE
Nearest Neighbor search is an important and widely used problem in a number of important application domains. In many of these domains, the dimensionality of the data representati...
100
Voted
CIKM
2009
Springer
15 years 6 months ago
2009
Springer
This paper addresses the issue of social recommendation based on collaborative filtering (CF) algorithms. Social recommendation emphasizes utilizing various attributes informatio...
109
click to vote
CIKM
1993
Springer
15 years 3 months ago
1993
Springer
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
100
click to vote
DELOS
2004
15 years 1 months ago
2004
Databases and Grid computing are a good match. With the service orientation of Grid computing, the complexity of maintaining and integrating databases can be kept away from the act...