1623 search results - page 30 / 325 » No Sorting |
89
Voted
SSDBM
1998
IEEE
15 years 5 months ago
1998
IEEE
A relation is an unordered collection of records. Often, however, there is an underlying order (e.g., a sequence of stock prices), and users want to pose queries that reflect this...
71
Voted
VLDB
1993
ACM
15 years 4 months ago
1993
ACM
- In real-time and goal-orienteddatabasesystems, the amountof memory assignedto queriesthat sort or join large relations may fluctuate due to contention from other higherpriority t...
SBACPAD
2004
IEEE
15 years 2 months ago
2004
IEEE
The aim of the paper is to introduce techniques in order to optimize the parallel execution time of sorting on heterogeneous platforms (processors speeds are related by a constant...
87
Voted
IPL
2007
15 years 21 days ago
2007
We study the Kolmogorov complexity of a Binary Insertion Tree, and present a succinct encoding scheme for Binary Insertion Trees produced from incompressible permutations. Based o...
106
click to vote
TAMC
2007
Springer
15 years 7 months ago
2007
Springer
In previous work we have introduced an average-case measure for the time complexity of Boolean circuits – that is the delay between feeding the input bits into a circuit and the ...