Sciweavers

3122 search results - page 433 / 625
» Storing Semistructured Data with STORED
Sort
View
INFOCOM
2000
IEEE
15 years 11 months ago
Near Optimal Routing Lookups with Bounded Worst Case Performance
Abstract—The problem of route address lookup has received much attention recently and several algorithms and data structures for performing address lookups at high speeds have be...
Pankaj Gupta, Balaji Prabhakar, Stephen P. Boyd
SSDBM
2000
IEEE
86views Database» more  SSDBM 2000»
15 years 11 months ago
Serving Datacube Tuples from Main Memory
Existing datacube precompuatation schemes materialize selected datacube tuples on disk, choosing the most beneficial cuboids (i.e., combinations of dimensions) to materialize giv...
Kenneth A. Ross, Kazi A. Zaman
SIGECOM
2000
ACM
132views ECommerce» more  SIGECOM 2000»
15 years 11 months ago
Pricing strategies on the Web: evidence from the online book industry
Using data collected between August 1999 and January 2000, we examine firm-level pricing strategies for 32 online bookstores. The data cover more than 300 books, including New Yor...
Karen Clay, Ramayya Krishnan, Eric Wolff
SIGECOM
2000
ACM
132views ECommerce» more  SIGECOM 2000»
15 years 11 months ago
What is actually taking place on web sites: e-commerce lessons from web server logs
A prime business concern is knowing your customer. One legacy carried into the present from the earliest NCSA web servers is web server logs. While there are more powerful user tr...
Mark Rosenstein
ASIAN
2000
Springer
156views Algorithms» more  ASIAN 2000»
15 years 11 months ago
Reusing Animations in Databases for Multimedia Presentations
Abstract. Multimedia presentations and their applications are becoming more and more popular in most spheres of industry and everyday life. A database approach could help in queryi...
Zhiyong Huang, Binjia Jiao, B. Prabhakaran, Conrad...