Sciweavers

1552 search results - page 237 / 311
» Creating Database Queries by Demonstration
Sort
View
PAMI
2010
164views more  PAMI 2010»
14 years 8 months ago
Large-Scale Discovery of Spatially Related Images
— We propose a randomized data mining method that finds clusters of spatially overlapping images. The core of the method relies on the min-Hash algorithm for fast detection of p...
Ondrej Chum, Jiri Matas
KDD
2009
ACM
228views Data Mining» more  KDD 2009»
15 years 10 months ago
A generalized Co-HITS algorithm and its application to bipartite graphs
Recently many data types arising from data mining and Web search applications can be modeled as bipartite graphs. Examples include queries and URLs in query logs, and authors and ...
Hongbo Deng, Michael R. Lyu, Irwin King
ICDE
2010
IEEE
260views Database» more  ICDE 2010»
15 years 9 months ago
Locating Mapped Resources in Web 2.0
Abstract-- Mapping mashups are emerging Web 2.0 applications in which data objects such as blogs, photos and videos from different sources are combined and marked in a map using AP...
Anthony K. H. Tung, Beng Chin Ooi, Dongxiang Zhang
EDBT
2010
ACM
189views Database» more  EDBT 2010»
15 years 2 months ago
Efficient physical operators for cost-based XPath execution
The creation of a generic and modular query optimization and processing infrastructure can provide significant benefits to XML data management. Key pieces of such an infrastructur...
Haris Georgiadis, Minas Charalambides, Vasilis Vas...
VLDB
1998
ACM
101views Database» more  VLDB 1998»
15 years 2 months ago
On Optimal Node Splitting for R-trees
The problem of finding an optimal bipartition of a rectangle set has a direct impact on query performance of dynamic R-trees. During update operations, overflowed nodes need to be...
Yván J. García, Mario A. Lopez, Scot...