964 search results - page 77 / 193 » Efficiently Ordering Query Plans for Data Integration |
159
Voted
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
Given a set D = {d1, d2, ..., dD} of D strings of total length n, our task is to report the "most relevant" strings for a given query pattern P. This involves somewhat mo...
159
Voted
DAWAK
2010
Springer
15 years 5 months ago
2010
Springer
: Experience in Extending Query Engine for Continuous Analytics Qiming Chen, Meichun Hsu HP Laboratories HPL-2010-44 In-Database Stream Processing Combining data warehousing and s...
268
click to vote
ICDE
2008
IEEE
16 years 6 months ago
2008
IEEE
We study the following problem: how to efficiently find in a collection of strings those similar to a given query string? Various similarity functions can be used, such as edit dis...
139
click to vote
SODA
2001
ACM
15 years 6 months ago
2001
ACM
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...
172
click to vote
BDA
2004
15 years 6 months ago
2004
: XML DBMSs require new indexing techniques to efficiently process structural search and full-text search as integrated in XQuery. Much research has been done for indexing XML docu...