![]() ![]() ![]() |
![]() |
|
|
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Return to October 2003, Volume 12, Number 3 @Article{Li:2003:CCA, author = {Chen Li}, title = {Computing complete answers to queries in the presence of limited access patterns}, journal = {VLDB Journal}, volume = {12}, number = {3}, pages = {211--227}, month = {Oct}, year = {2003}, CODEN = {VLDBFR}, ISSN = {0938-1287 (print), 1432-2153 (electronic)}, bibdate = {Mon Dec 22 18:15:00 MST 2003}, acknowledgement = {Nelson H. F. Beebe}, DOI = {10.1007/s00778-002-0085-6} } ![]() ©2004 Association for Computing Machinery |