Sciweavers

189 search results - page 16 / 38
» Answering general time sensitive queries
Sort
View
IPL
2010
71views more  IPL 2010»
13 years 6 months ago
New common ancestor problems in trees and directed acyclic graphs
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time su...
Johannes Fischer, Daniel H. Huson
ICDT
2009
ACM
105views Database» more  ICDT 2009»
14 years 8 months ago
Efficient data structures for range-aggregate queries on trees
Graph-theoretic aggregation problems have been considered both in OLAP (grid graph) and XML (tree). This paper gives new results for MIN aggregation in a tree, where we want the M...
Hao Yuan, Mikhail J. Atallah
TCOS
2010
13 years 6 months ago
Approximate Shortest Path Queries Using Voronoi Duals
We propose an approximation method to answer point-to-point shortest path queries in undirected edge-weighted graphs, based on random sampling and Voronoi duals. We compute a simp...
Shinichi Honiden, Michael E. Houle, Christian Somm...
SIGCOMM
2010
ACM
13 years 7 months ago
Trust no one: a decentralized matching service for privacy in location based services
We propose a new approach to ensure privacy in location based services, without requiring any support from a"trusted" entity. We observe that users of location based ser...
Sharad Jaiswal, Animesh Nandi
EDBT
2011
ACM
231views Database» more  EDBT 2011»
12 years 11 months ago
Data integration with dependent sources
Data integration systems offer users a uniform interface to a set of data sources. Previous work has typically assumed that the data sources are independent of each other; however...
Anish Das Sarma, Xin Luna Dong, Alon Y. Halevy