Sciweavers

1890 search results - page 61 / 378
» Querying Big Data by Accessing Small Data
Sort
View
ICDE
2010
IEEE
295views Database» more  ICDE 2010»
15 years 6 months ago
K nearest neighbor queries and kNN-Joins in large relational databases (almost) for free
— Finding the k nearest neighbors (kNN) of a query point, or a set of query points (kNN-Join) are fundamental problems in many application domains. Many previous efforts to solve...
Bin Yao, Feifei Li, Piyush Kumar
168
Voted
ICDE
2002
IEEE
149views Database» more  ICDE 2002»
16 years 13 days ago
GADT: A Probability Space ADT for Representing and Querying the Physical World
Large sensor networks are being widely deployed for measurement, detection, and monitoring applications. Many of these applications involve database systems to store and process d...
Anton Faradjian, Johannes Gehrke, Philippe Bonnet
CIKM
2004
Springer
15 years 4 months ago
QFilter: fine-grained run-time XML access control via NFA-based query rewriting
At present, most of the state-of-the-art solutions for XML access controls are either (1) document-level access control techniques that are too limited to support fine-grained sec...
Bo Luo, Dongwon Lee, Wang-Chien Lee, Peng Liu
ESCIENCE
2007
IEEE
15 years 5 months ago
Community Training: Partitioning Schemes in Good Shape for Federated Data Grids
In federated Data Grids, individual institutions share their data sets within a community to enable collaborative data analysis. Data access needs to be provided in a scalable fas...
Tobias Scholl, Richard Kuntschke, Angelika Reiser,...
SAC
2011
ACM
14 years 1 months ago
Secure shared continuous query processing
Data stream management systems (DSMSs) process continuous queries over streaming data in real-time adhering to quality of service requirements. The data streams generated from sen...
Raman Adaikkalavan, Thomas Perez