Sciweavers

6974 search results - page 937 / 1395
» Querying Semi-Structured Data
Sort
View
DAWAK
2001
Springer
15 years 11 months ago
A Theoretical Framework for Association Mining Based on the Boolean Retrieval Model
Data mining has been defined as the non- trivial extraction of implicit, previously unknown and potentially useful information from data. Association mining is one of the important...
Peter Bollmann-Sdorra, Aladdin Hafez, Vijay V. Rag...
217
Voted
EDBT
2000
ACM
15 years 11 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
195
Voted
IEEESP
2010
101views more  IEEESP 2010»
15 years 5 months ago
Preserving Privacy Based on Semantic Policy Tools
Abstract—Private data of individuals is constantly being collected, analyzed, and stored by different kinds of organizations: shopping sites to provide better service and recomme...
Lalana Kagal, Joe Pato
274
Voted

Book
688views
17 years 5 months ago
Database Management Systems
A set of presentations covering the book, which includes the following topics ER Model and Conceptual Design, The Relational Model and SQL DDL, Relational Algebra, SQL, Database Ap...
Raghu Ramakrishnan, Johannes Gehrke
178
Voted
ICALP
2009
Springer
16 years 7 months ago
B-Treaps: A Uniquely Represented Alternative to B-Trees
We present the first uniquely represented data structure for an external memory model of computation, a B-tree analogue called a B-treap. Uniquely represented data structures repre...
Daniel Golovin