Sciweavers

36 search results - page 4 / 8
» Efficient discovery of join plans in schemaless data
Sort
View
ICDE
2001
IEEE
149views Database» more  ICDE 2001»
14 years 9 months ago
Selectivity Estimation for Spatial Joins
Spatial Joins are important and time consuming operations in spatial database management systems. It is crucial to be able to accurately estimate the performance of these operatio...
Ning An, Zhen-Yu Yang, Anand Sivasubramaniam
BMCBI
2008
139views more  BMCBI 2008»
13 years 7 months ago
A topological transformation in evolutionary tree search methods based on maximum likelihood combining p-ECR and neighbor joinin
Background: Inference of evolutionary trees using the maximum likelihood principle is NP-hard. Therefore, all practical methods rely on heuristics. The topological transformations...
Maozu Guo, Jian-Fu Li, Yang Liu
PVLDB
2008
182views more  PVLDB 2008»
13 years 7 months ago
SCOPE: easy and efficient parallel processing of massive data sets
Companies providing cloud-scale services have an increasing need to store and analyze massive data sets such as search logs and click streams. For cost and performance reasons, pr...
Ronnie Chaiken, Bob Jenkins, Per-Åke Larson,...
CIKM
1998
Springer
13 years 11 months ago
Efficient Enumeration of Frequent Sequences
In this paper we present SPADE, a new algorithm for fast discovery of Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex has...
Mohammed Javeed Zaki
IS
2008
13 years 7 months ago
A framework for semantic grouping in P2P databases
Abstract. Sharing of structured data in decentralized environments is a challenging problem, especially in the absence of a global schema. Social network structures map network lin...
Verena Kantere, Dimitrios Tsoumakos, Timos K. Sell...