Sciweavers

2635 search results - page 137 / 527
» Algorithms for the Database Layout Problem
Sort
View
KDD
2006
ACM
115views Data Mining» more  KDD 2006»
16 years 4 months ago
Aggregating time partitions
Partitions of sequential data exist either per se or as a result of sequence segmentation algorithms. It is often the case that the same timeline is partitioned in many different ...
Evimaria Terzi, Panayiotis Tsaparas, Taneli Mielik...
DEXAW
2008
IEEE
204views Database» more  DEXAW 2008»
15 years 11 months ago
Particle Swarm Optimization Using Adaptive Mutation
Two new variants of Particle Swarm Optimization (PSO) called AMPSO1 and AMPSO2 are proposed for global optimization problems. Both the algorithms use adaptive mutation using Beta ...
Millie Pant, Radha Thangaraj, Ajith Abraham
PODS
2006
ACM
137views Database» more  PODS 2006»
16 years 4 months ago
Data exchange: computing cores in polynomial time
Data exchange deals with inserting data from one database into another database having a different schema. We study and solve a central computational problem of data exchange, nam...
Georg Gottlob, Alan Nash
SIGMOD
2011
ACM
169views Database» more  SIGMOD 2011»
14 years 7 months ago
Leveraging query logs for schema mapping generation in U-MAP
In this paper, we introduce U-MAP, a new system for schema mapping generation. U-MAP builds upon and extends existing schema mapping techniques. However, it mitigates some key pro...
Hazem Elmeleegy, Ahmed K. Elmagarmid, Jaewoo Lee
DASFAA
2010
IEEE
252views Database» more  DASFAA 2010»
15 years 8 months ago
Effectively Inferring the Search-for Node Type in XML Keyword Search
xml keyword search provides a simple and user-friendly way of retrieving data from xml databases, but the ambiguities of keywords make it difficult to effectively answer keyword qu...
Jiang Li, Junhu Wang