Sciweavers

1284 search results - page 148 / 257
» Data Structures for Mergeable Trees
Sort
View
134
Voted
CIKM
2006
Springer
15 years 4 months ago
Processing relaxed skylines in PDMS using distributed data summaries
Peer Data Management Systems (PDMS) are a natural extension of heterogeneous database systems. One of the main tasks in such systems is efficient query processing. Insisting on co...
Katja Hose, Christian Lemke, Kai-Uwe Sattler
WISE
2002
Springer
15 years 7 months ago
Storing and Maintaining Semistructured Data Efficiently in an Object-Relational Database
We propose to use object-relational database management systems to store and manage semi-structured data. ORA-SS (Object-Relationship-Attribute model for Semi-Structured data) [9]...
Yuanying Mo, Tok Wang Ling
VLDB
2004
ACM
127views Database» more  VLDB 2004»
16 years 2 months ago
Querying high-dimensional data in single-dimensional space
In this paper, we propose a new tunable index scheme, called iMinMax(), that maps points in highdimensional spaces to single-dimensional values determined by their maximum or minim...
Cui Yu, Stéphane Bressan, Beng Chin Ooi, Kian-Lee...
ALGORITHMICA
2005
135views more  ALGORITHMICA 2005»
15 years 2 months ago
Queaps
A new priority queue structure, the queap, is introduced. The queap executes insertion in O(1) amortized time and extract-min in O(log(k+2)) amortized time if there are k items th...
John Iacono, Stefan Langerman
ITSSA
2006
116views more  ITSSA 2006»
15 years 2 months ago
A Genetic Programming Approach to Automated Test Generation for Object-Oriented Software
: This article proposes a new method for creating test software for object-oriented systems using a genetic programming approach. It is believed that this approach is advantageous ...
Arjan Seesing, Hans-Gerhard Groß