Sciweavers

8220 search results - page 1275 / 1644
» Querying XML Data
Sort
View
CINQ
2004
Springer
116views Database» more  CINQ 2004»
15 years 11 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
CINQ
2004
Springer
157views Database» more  CINQ 2004»
15 years 11 months ago
Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
Jean-François Boulicaut
CCS
2006
ACM
15 years 11 months ago
Searchable symmetric encryption: improved definitions and efficient constructions
Searchable symmetric encryption (SSE) allows a party to outsource the storage of his data to another party in a private manner, while maintaining the ability to selectively search...
Reza Curtmola, Juan A. Garay, Seny Kamara, Rafail ...
GIS
1995
ACM
15 years 11 months ago
Measuring the Complexity of Polygonal Objects
Polygonal objects are characterized by the following well-known parameters: number of vertices, area, perimeter and so on. These parameters describe the data sets that are used in...
Thomas Brinkhoff, Hans-Peter Kriegel, Ralf Schneid...
KDD
1995
ACM
140views Data Mining» more  KDD 1995»
15 years 11 months ago
Discovery and Maintenance of Functional Dependencies by Independencies
For semantic query optimization one needs detailed knowledgeabout the contents of the database. Traditional techniquesuse static knowledgeabout all possible states of the database...
Siegfried Bell
« Prev « First page 1275 / 1644 Last » Next »