1736 search results - page 82 / 348 » String Extension Learning |
215
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
Many evolving database applications warrant the use of non-traditional indexing mechanisms beyond B+-trees and hash tables. SP-GiST is an extensible indexing framework that broade...
242
click to vote
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
The ongoing revolution in life sciences research is producing vast amounts of genetic and proteomic sequence data. Scientists want to pose increasingly complex queries on this dat...
254
click to vote
ICDE
2004
IEEE
16 years 5 months ago
2004
IEEE
Real datasets are often large enough to necessitate data compression. Traditional `syntactic' data compression methods treat the table as a large byte string and operate at t...
126
click to vote
ICFP
2004
ACM
16 years 4 months ago
2004
ACM
We extend Haskell with regular expression patterns. Regular expression patterns provide means for matching and extracting data which goes well beyond ordinary pattern matching as ...
139
click to vote
ICFP
2001
ACM
16 years 4 months ago
2001
ACM
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...