11212 search results - page 2166 / 2243 » Semi-persistent Data Structures |
224
Voted
SIGMOD
2009
ACM
16 years 2 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...
192
click to vote
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
236
Voted
SIGMOD
2007
ACM
16 years 2 months ago
2007
ACM
The proliferation of database-driven web sites (or web-databases) has brought upon a plethora of applications where both Quality of Service (QoS) and Quality of Data (QoD) are of ...
211
click to vote
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
Testing of database applications is crucial for ensuring high software quality as undetected faults can result in unrecoverable data corruption. The problem of database applicatio...
223
Voted
SIGMOD
2006
ACM
16 years 2 months ago
2006
ACM
Text is ubiquitous and, not surprisingly, many important applications rely on textual data for a variety of tasks. As a notable example, information extraction applications derive...