2309 search results - page 65 / 462 » Using Meta-Structures in Database Design |
119
click to vote
PVLDB
2010
15 years 16 days ago
2010
Commercial databases compete for market share, which is composed of not only net-new sales to those purchasing a database for the first time, but also competitive “win-backs”...
151
Voted
ICDE
2010
IEEE
15 years 9 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
137
click to vote
EDBT
2010
ACM
15 years 21 days ago
2010
ACM
Private matching between datasets owned by distinct parties is a challenging problem with several applications. Private matching allows two parties to identify the records that ar...
ICDT
1995
ACM
15 years 5 months ago
1995
ACM
Partial information in databases can arise when information from several databases is combined. Even if each database is complete for some \world", the combined databases wil...
109
click to vote
USENIX
2004
15 years 3 months ago
2004
Large web or e-commerce sites are frequently hosted on clusters. Successful open-source tools exist for clustering the front tiers of such sites (web servers and application serve...