2392 search results - page 411 / 479 » Channel-Hopping Multiple Access |
SIGSOFT
2000
ACM
15 years 4 months ago
2000
ACM
Constraint-based languages can express in a concise way the complex logic of a new generation of interactive services for applications such as banking or stock trading, that must ...
127
click to vote
ADC
2000
Springer
15 years 4 months ago
2000
Springer
While the B-tree (or the B+ -tree) is the most popular index structure in disk-based relational database systems, the Ttree has been widely accepted as a promising index structure...
DOLAP
1999
ACM
15 years 4 months ago
1999
ACM
We consider a system in which many users run queries to examine subsets of a large object set. The object set is partitioned into files on tape. A single subset of objects will b...
DEXAW
1999
IEEE
15 years 4 months ago
1999
IEEE
The information overload on the Web has created a great need for efficient filtering mechanisms. Many sites (e.g., CNN and Quicken) address this problem by allowing a user to crea...
SIGMOD
1999
ACM
15 years 4 months ago
1999
ACM
The database query optimizer requires the estimation of the query selectivity to find the most efficient access plan. For queries referencing multiple attributes from the same rel...