Sciweavers

10 search results - page 1 / 2
» Improving I O Performance with a Conditional Store Buffer
Sort
View
MICRO
1998
IEEE
102views Hardware» more  MICRO 1998»
13 years 9 months ago
Improving I/O Performance with a Conditional Store Buffer
Lambert Schaelicke, Al Davis
VLDB
2005
ACM
185views Database» more  VLDB 2005»
14 years 5 months ago
Storing and querying XML data using denormalized relational databases
XML database systems emerge as a result of the acceptance of the XML data model. Recent works have followed the promising approach of building XML database management systems on un...
Andrey Balmin, Yannis Papakonstantinou
ECCC
2010
80views more  ECCC 2010»
13 years 5 months ago
Regret Minimization for Online Buffering Problems Using the Weighted Majority Algorithm
Suppose a decision maker has to purchase a commodity over time with varying prices and demands. In particular, the price per unit might depend on the amount purchased and this pri...
Melanie Winkler, Berthold Vöcking, Sascha Geu...
ICALP
2007
Springer
13 years 9 months ago
In-Place Suffix Sorting
Given string T = T[1, . . . , n], the suffix sorting problem is to lexicographically sort the suffixes T[i, . . . , n] for all i. This problem is central to the construction of suf...
Gianni Franceschini, S. Muthukrishnan
WWW
2011
ACM
13 years 9 days ago
Low-infrastructure methods to improve internet access for mobile users in emerging regions
As information technology supports more aspects of modern life, digital access has become an important tool for developing regions to lift themselves from poverty. Though broadban...
Sibren Isaacman, Margaret Martonosi