7839 search results - page 1298 / 1568 » What's there and what's not |
216
click to vote
SIGMOD
2008
ACM
16 years 1 months ago
2008
ACM
Approximate queries on a collection of strings are important in many applications such as record linkage, spell checking, and Web search, where inconsistencies and errors exist in...
189
click to vote
SIGMOD
2007
ACM
16 years 1 months ago
2007
ACM
Partial evaluation has recently proven an effective technique for evaluating Boolean XPath queries over a fragmented tree that is distributed over a number of sites. What left ope...
179
click to vote
SIGMOD
2005
ACM
16 years 1 months ago
2005
ACM
Applications that require real-time processing of high-volume data steams are pushing the limits of traditional data processing infrastructures. These stream-based applications in...
184
click to vote
SIGMOD
2005
ACM
16 years 1 months ago
2005
ACM
Many cluster based replication solutions have been proposed providing scalability and fault-tolerance. Many of these solutions perform replica control in a middleware on top of th...
128
click to vote
SIGMOD
2003
ACM
16 years 1 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...