3613 search results - page 495 / 723 » Estimating costs of a service |
186
click to vote
CPC
1999
15 years 6 months ago
1999
Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. M...
186
click to vote
PVLDB
2010
15 years 5 months ago
2010
Keyword search in relational databases has been extensively studied. Given a relational database, a keyword query finds a set of interconnected tuple structures connected by fore...
225
click to vote
ALGOSENSORS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
214
click to vote
CISS
2010
IEEE
14 years 10 months ago
2010
IEEE
Reverse link (or uplink) performance of cellular systems is becoming increasingly important with the emergence of new uplink-bandwidth intensive applications such as Video Share [...
192
click to vote
NIS
1998
15 years 6 months ago
1998
The execution time of a large query depends mainly on the memory utilization which should avoid disk accesses for intermediate results. Poor memory management can hurt performance ...