Sciweavers

625 search results - page 26 / 125
» Genetic algorithms for large join query optimization
Sort
View
GVD
2003
151views Database» more  GVD 2003»
13 years 9 months ago
Bridging the GAP Between Relational and Native XML Storage with Staircase Join
Several mapping schemes have recently been proposed to store XML data in relational tables. Relational database systems are readily available and can handle vast amounts of data v...
Jens Teubner, Torsten Grust, Maurice van Keulen
GEOINFO
2003
13 years 9 months ago
Efficient Query Processing on the Relational Quadtree
Relational index structures, as for instance the Relational Interval Tree, the Relational R-Tree, or the Linear Quadtree, support efficient processing of queries on top of existing...
Hans-Peter Kriegel, Peter Kunath, Martin Pfeifle, ...
SIGMOD
2005
ACM
154views Database» more  SIGMOD 2005»
14 years 7 months ago
Lazy XML Updates: Laziness as a Virtue of Update and Structural Join Efficiency
XML documents are normally stored as plain text files. Hence, the natural and most convenient way to update XML documents is to simply edit the text files. But efficient query eva...
Barbara Catania, Wen Qiang Wang, Beng Chin Ooi, Xi...
WSCG
2003
223views more  WSCG 2003»
13 years 9 months ago
Optimizing Parameters of a Motion Detection System by Means of a Genetic Algorithm
Visual surveillance and monitoring have aroused interest in the computer video community for many years. The main task of these applications is to identify (and track) moving targ...
Alessandro Bevilacqua
CEC
2005
IEEE
14 years 1 months ago
Genetic algorithms with self-organized criticality for dynamic optimization problems
This paper proposes a genetic algorithm (GA) with random immigrants for dynamic optimization problems where the worst individual and its neighbours are replaced every generation. I...
Renato Tinós, Shengxiang Yang