Sciweavers

2985 search results - page 87 / 597
» Indexing Distributed Complex Data for Complex Queries
Sort
View
VLDB
2006
ACM
147views Database» more  VLDB 2006»
16 years 5 months ago
Answering queries using materialized views with minimum size
In this paper we study the following problem. Given a database and a set of queries, we want to find a set of views that can compute the answers to the queries, such that the amoun...
Rada Chirkova, Chen Li, Jia Li
SDMW
2004
Springer
15 years 10 months ago
A Structure Preserving Database Encryption Scheme
Abstract. A new simple and efficient database encryption scheme is presented. The new scheme enables encrypting the entire content of the database without changing its structure. I...
Yuval Elovici, Ronen Waisenberg, Erez Shmueli, Ehu...
EDBT
2009
ACM
277views Database» more  EDBT 2009»
15 years 9 months ago
G-hash: towards fast kernel-based similarity search in large graph databases
Structured data including sets, sequences, trees and graphs, pose significant challenges to fundamental aspects of data management such as efficient storage, indexing, and simila...
Xiaohong Wang, Aaron M. Smalter, Jun Huan, Gerald ...
252
Voted
ICDE
1995
IEEE
164views Database» more  ICDE 1995»
16 years 6 months ago
Efficient Processing of Nested Fuzzy SQL Queries
?In a fuzzy relational database where a relation is a fuzzy set of tuples and ill-known data are represented by possibility distributions, nested fuzzy queries can be expressed in ...
Qi Yang, Chengwen Liu, Jing Wu, Clement T. Yu, Son...
ICDE
2011
IEEE
274views Database» more  ICDE 2011»
14 years 8 months ago
SQPR: Stream query planning with reuse
—When users submit new queries to a distributed stream processing system (DSPS), a query planner must allocate physical resources, such as CPU cores, memory and network bandwidth...
Evangelia Kalyvianaki, Wolfram Wiesemann, Quang Hi...