![]() ![]() ![]() |
![]() |
|
|
![]() ![]() ![]() ![]() ![]() |
![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Return to August 2003, Volume 12, Number 2 @Article{Chan:2003:RTE, author = {Chee-Yong Chan and Minos Garofalakis and Rajeev Rastogi}, title = {{RE}-tree: an efficient index structure for regular expressions}, journal = {VLDB Journal}, volume = {12}, number = {2}, pages = {102--119}, month = {Aug}, year = {2003}, CODEN = {VLDBFR}, ISSN = {0938-1287 (print), 1432-2153 (electronic)}, bibdate = {Mon Dec 22 18:14:59 MST 2003}, DOI = {10.1007/s00778-003-0094-0} } ![]() ©2004 Association for Computing Machinery |