Sciweavers

579 search results - page 106 / 116
» New efficiency results for makespan cost sharing
Sort
View
SIGMOD
2009
ACM
198views Database» more  SIGMOD 2009»
14 years 7 months ago
Monitoring path nearest neighbor in road networks
This paper addresses the problem of monitoring the k nearest neighbors to a dynamically changing path in road networks. Given a destination where a user is going to, this new quer...
Zaiben Chen, Heng Tao Shen, Xiaofang Zhou, Jeffrey...
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
14 years 7 months ago
Fg-index: towards verification-free query processing on graph databases
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
James Cheng, Yiping Ke, Wilfred Ng, An Lu
PKDD
2004
Springer
277views Data Mining» more  PKDD 2004»
14 years 22 days ago
Scalable Density-Based Distributed Clustering
Clustering has become an increasingly important task in analysing huge amounts of data. Traditional applications require that all data has to be located at the site where it is scr...
Eshref Januzaj, Hans-Peter Kriegel, Martin Pfeifle
EDBT
2006
ACM
156views Database» more  EDBT 2006»
13 years 11 months ago
FlexInd: A Flexible and Parameterizable Air-Indexing Scheme for Data Broadcast Systems
Abstract. In wireless data broadcast systems, popular information is repetitively disseminated through possibly multiple communication channels to mobile clients using various type...
André Seifert, Jen-Jou Hung
VLDB
1995
ACM
97views Database» more  VLDB 1995»
13 years 11 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch