Sciweavers

327 search results - page 31 / 66
» Efficiently querying rdf data in triple stores
Sort
View
IS
2007
13 years 8 months ago
Branch-and-bound processing of ranked queries
Despite the importance of ranked queries in numerous applications involving multi-criteria decision making, they are not efficiently supported by traditional database systems. In ...
Yufei Tao, Vagelis Hristidis, Dimitris Papadias, Y...
SIGMOD
2005
ACM
119views Database» more  SIGMOD 2005»
14 years 8 months ago
Update-Pattern-Aware Modeling and Processing of Continuous Queries
A defining characteristic of continuous queries over on-line data streams, possibly bounded by sliding windows, is the potentially infinite and time-evolving nature of their input...
Lukasz Golab, M. Tamer Özsu
SIGMOD
2007
ACM
144views Database» more  SIGMOD 2007»
14 years 8 months ago
GhostDB: querying visible and hidden data without leaks
Imagine that you have been entrusted with private data, such as corporate product information, sensitive government information, or symptom and treatment information about hospita...
Nicolas Anciaux, Mehdi Benzine, Luc Bouganim, Phil...
BDA
2007
13 years 10 months ago
Querying and Aggregating Visible and Hidden Data Without Leaks
Imagine that you have been entrusted with private data, such as corporate product information, sensitive government information, or symptom and treatment information about hospita...
Nicolas Anciaux, Mehdi Benzine, Luc Bouganim, Phil...
CIKM
2010
Springer
13 years 6 months ago
Adaptive query execution for data management in the cloud
A major component of many cloud services is query processing on data stored in the underlying cloud cluster. The traditional techniques for query processing on a cluster are those...
Adrian Daniel Popescu, Debabrata Dash, Verena Kant...