Sciweavers

2985 search results - page 105 / 597
» Indexing Distributed Complex Data for Complex Queries
Sort
View
SIGMOD
2004
ACM
120views Database» more  SIGMOD 2004»
16 years 5 months ago
Prediction and Indexing of Moving Objects with Unknown Motion Patterns
Existing methods for prediction in spatio-temporal databases assume that objects move according to linear functions. This severely limits their applicability, since in practice mo...
Yufei Tao, Christos Faloutsos, Dimitris Papadias, ...
IPSN
2010
Springer
15 years 11 months ago
Covering space for in-network sensor data storage
For in-network storage schemes, one maps data, indexed in a logical space, to the distributed sensor locations. When the physical sensor network has an irregular shape and possibl...
Rik Sarkar, Wei Zeng, Jie Gao, Xianfeng David Gu
SIAMDM
2002
94views more  SIAMDM 2002»
15 years 4 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
ESWS
2008
Springer
15 years 6 months ago
A Natural Language Query Interface to Structured Information
Accessing structured data such as that encoded in ontologies and knowledge bases can be done using either syntactically complex formal query languages like SPARQL or complicated fo...
Valentin Tablan, Danica Damljanovic, Kalina Bontch...
ICDE
2012
IEEE
240views Database» more  ICDE 2012»
13 years 7 months ago
Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme
—Shortest distance query between two nodes is a fundamental operation in large-scale networks. Most existing methods in the literature take a landmark embedding approach, which s...
Miao Qiao, Hong Cheng, Lijun Chang, Jeffrey Xu Yu