Sciweavers

390 search results - page 44 / 78
» Approximate Query Answering in Locally Closed Databases
Sort
View
MOBICOM
2010
ACM
14 years 10 months ago
Differential forms for target tracking and aggregate queries in distributed networks
Consider mobile targets moving in a plane and their movements being monitored by a network such as a field of sensors. We develop distributed algorithms for in-network tracking an...
Rik Sarkar, Jie Gao
EDBT
2008
ACM
166views Database» more  EDBT 2008»
15 years 10 months ago
A novel spectral coding in a large graph database
Retrieving related graphs containing a query graph from a large graph database is a key issue in many graph-based applications, such as drug discovery and structural pattern recog...
Lei Zou, Lei Chen 0002, Jeffrey Xu Yu, Yansheng Lu
TCC
2009
Springer
130views Cryptology» more  TCC 2009»
15 years 10 months ago
How Efficient Can Memory Checking Be?
We consider the problem of memory checking, where a user wants to maintain a large database on a remote server but has only limited local storage. The user wants to use the small ...
Cynthia Dwork, Moni Naor, Guy N. Rothblum, Vinod V...
EDBT
2009
ACM
208views Database» more  EDBT 2009»
15 years 4 months ago
Flexible and efficient querying and ranking on hyperlinked data sources
There has been an explosion of hyperlinked data in many domains, e.g., the biological Web. Expressive query languages and effective ranking techniques are required to convert this...
Ramakrishna Varadarajan, Vagelis Hristidis, Louiqa...
WWW
2010
ACM
15 years 4 months ago
LCA-based selection for XML document collections
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...
Georgia Koloniari, Evaggelia Pitoura