25041 search results - page 4735 / 5009 » Algorithms for Clustering Data |
165
Voted
SIGMOD
2003
ACM
16 years 5 months ago
2003
ACM
Most relational query optimizers make use of information about the costs of accessing tuples and data structures on various storage devices. This information can at times be off b...
147
Voted
EDBT
2006
ACM
16 years 5 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
139
Voted
EDBT
2006
ACM
16 years 5 months ago
2006
ACM
In authorization-transparent access control, users formulate their queries against the database schema rather than against authorization views that transform and hide data. The Tru...
148
Voted
EDBT
2006
ACM
16 years 5 months ago
2006
ACM
Current methods for selectivity estimation fall into two broad categories, synopsis-based and sampling-based. Synopsis-based methods, such as histograms, incur minimal overhead at ...
165
click to vote
ICDE
2010
IEEE
16 years 4 months ago
2010
IEEE
Similarity joins have been studied as key operations in multiple application domains, e.g., record linkage, data cleaning, multimedia and video applications, and phenomena detectio...