Sciweavers

423 search results - page 55 / 85
» Evaluating TOP-K Queries over Business Processes
Sort
View
GIS
2007
ACM
14 years 11 months ago
Proximity queries in large traffic networks
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
XSYM
2007
Springer
150views Database» more  XSYM 2007»
14 years 4 months ago
Fast Answering of XPath Query Workloads on Web Collections
Several web applications (such as processing RSS feeds or web service messages) rely on XPath-based data manipulation tools. Web developers need to use XPath queries effectively o...
Mariano P. Consens, Flavio Rizzolo
ICDE
2011
IEEE
272views Database» more  ICDE 2011»
13 years 1 months ago
A continuous query system for dynamic route planning
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
Nirmesh Malviya, Samuel Madden, Arnab Bhattacharya
PKDD
1998
Springer
123views Data Mining» more  PKDD 1998»
14 years 2 months ago
Querying Inductive Databases: A Case Study on the MINE RULE Operator
Knowledge discovery in databases (KDD) is a process that can include steps like forming the data set, data transformations, discovery of patterns, searching for exceptions to a pat...
Jean-François Boulicaut, Mika Klemettinen, ...
SIGMOD
2003
ACM
193views Database» more  SIGMOD 2003»
14 years 10 months ago
Chain : Operator Scheduling for Memory Minimization in Data Stream Systems
In many applications involving continuous data streams, data arrival is bursty and data rate fluctuates over time. Systems that seek to give rapid or real-time query responses in ...
Brian Babcock, Shivnath Babu, Mayur Datar, Rajeev ...