Sciweavers

2850 search results - page 19 / 570
» Answering Queries using Humans, Algorithms and Databases
Sort
View
ICDE
2006
IEEE
128views Database» more  ICDE 2006»
14 years 9 months ago
Partial Selection Query in Peer-to-Peer Databases
In this paper, we propose DBSampler, a query execution mechanism to answer "partial selection" queries in peerto-peer databases. A partial selection query is an arbitrar...
Farnoush Banaei Kashani, Cyrus Shahabi
MDM
2004
Springer
110views Communications» more  MDM 2004»
14 years 1 months ago
Universal Trajectory Queries for Moving Object Databases
In this paper, we consider a data model for uncertain trajectories of moving objects. In our model, the trajectory is a vector of uniform stochastic processes. We study “univers...
Hoda Mokhtar, Jianwen Su
CIKM
2009
Springer
14 years 3 months ago
Structure-aware indexing for keyword search in databases
Most of existing methods of keyword search over relational databases find the Steiner trees composed of relevant tuples as the answers. They identify the Steiner trees by discove...
Guoliang Li, Jianhua Feng, Jianyong Wang
SEMWEB
2004
Springer
14 years 1 months ago
Top-k Query Evaluation for Schema-Based Peer-to-Peer Networks
Abstract. Increasing the number of peers in a peer-to-peer network usually increases the number of answers to a given query as well. While having more answers is nice in principle,...
Wolfgang Nejdl, Wolf Siberski, Uwe Thaden, Wolf-Ti...
VLDB
2004
ACM
96views Database» more  VLDB 2004»
14 years 1 months ago
Answering XPath Queries over Networks by Sending Minimal Views
When a client submits a set of XPath queries to a XML database on a network, the set of answer sets sent back by the database may include redundancy in two ways: some elements may...
Keishi Tajima, Yoshiki Fukui