2850 search results - page 151 / 570 » Answering Queries using Humans, Algorithms and Databases |
172
Voted
ICSE
2010
IEEE-ACM
15 years 5 months ago
2010
IEEE-ACM
The feature list of modern IDEs is steadily growing and mastering these tools becomes more and more demanding, especially for novice programmers. Despite their remarkable capabili...
208
Voted
SIGMOD
2007
ACM
16 years 3 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...
161
click to vote
ICDE
2010
IEEE
15 years 10 months ago
2010
IEEE
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
142
Voted
ICDT
1999
ACM
15 years 7 months ago
1999
ACM
Abstract. In this paper we consider databases representing information about moving objects (e.g. vehicles), particularly their location. We address the problems of updating and qu...
148
click to vote
MDM
2010
Springer
15 years 8 months ago
2010
Springer
Motivated by many applications, top-k query is a fundamental operation in modern database systems. Technological advances have enabled the deployment of large-scale sensor networks...