Sciweavers

1709 search results - page 91 / 342
» Comparing the Performance of Database Selection Algorithms
Sort
View
ICCCN
2008
IEEE
15 years 11 months ago
Impairment-Aware Manycast Algorithms over Optical Burst-Switched Networks
— We discuss the effect of physical impairments on manycasting service over optical burst-switched (OBS) networks. Signal quality degradation in manycast networks is an important...
Balagangadhar G. Bathula, Rajesh R. C. Bikram, Vin...
ICDE
2008
IEEE
204views Database» more  ICDE 2008»
16 years 6 months ago
Keyword Search on Spatial Databases
Many applications require finding objects closest to a specified location that contains a set of keywords. For example, online yellow pages allow users to specify an address and a ...
Ian De Felipe, Vagelis Hristidis, Naphtali Rishe
127
Voted
ICDE
2010
IEEE
201views Database» more  ICDE 2010»
15 years 5 months ago
Vertical partitioning of relational OLTP databases using integer programming
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...
Rasmus Resen Amossen
ICLP
1999
Springer
15 years 9 months ago
Concurrency in Prolog Using Threads and a Shared Database
Concurrency in Logic Programming has received much attention in the past. One problem with many proposals, when applied to Prolog, is that they involve large modifications to the...
Manuel Carro, Manuel V. Hermenegildo
148
Voted
CIKM
2001
Springer
15 years 8 months ago
Sliding-Window Filtering: An Efficient Algorithm for Incremental Mining
We explore in this paper an effective sliding-window filtering (abbreviatedly as SWF) algorithm for incremental mining of association rules. In essence, by partitioning a transact...
Chang-Hung Lee, Cheng-Ru Lin, Ming-Syan Chen