1489 search results - page 248 / 298 » The First Bug Report |
135
Voted
ICALP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We consider the succinct representation of ordinal and cardinal trees on the RAM with logarithmic word size. Given a tree T, our representations support the following ope...
235
click to vote
VLDB
2006
ACM
16 years 4 months ago
2006
ACM
While the information published in the form of XML-compliant documents keeps fast mounting up, efficient and effective query processing and optimization for XML have now become mor...
244
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
An approximate search query on a collection of strings finds those strings in the collection that are similar to a given query string, where similarity is defined using a given si...
244
click to vote
SIGMOD
2009
ACM
16 years 4 months ago
2009
ACM
Keyword search in relational databases (RDBs) has been extensively studied recently. A keyword search (or a keyword query) in RDBs is specified by a set of keywords to explore the...
155
click to vote
SIGMOD
2001
ACM
16 years 4 months ago
2001
ACM
Digital archives are dedicated to the long-term preservation of electronic information and have the mandate to enable sustained access despite rapid technology changes. Persistent...