505 search results - page 59 / 101 » Queries with Incomplete Answers over Semistructured Data |
113
click to vote
PODS
2005
ACM
15 years 9 months ago
2005
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. Pro...
172
Voted
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
Keyword search is a familiar and potentially effective way to find information of interest that is "locked" inside relational databases. Current work has generally assum...
86
Voted
WWW
2006
ACM
15 years 10 months ago
2006
ACM
We introduce a new, powerful class of text proximity queries: find an instance of a given "answer type" (person, place, distance) near "selector" tokens matchi...
148
click to vote
VLDB
2001
ACM
15 years 10 months ago
2001
ACM
Approximate query processing has emerged as a costeffective approach for dealing with the huge data volumes and stringent response-time requirements of today's decision-suppo...
170
click to vote
ICDE
2007
IEEE
15 years 11 months ago
2007
IEEE
In location-based services, it is common for a user to issue a query based on his/her current position. One such example is "find the available cabs within two miles of my cu...