Sciweavers

6597 search results - page 95 / 1320
» Orderings and Types in Databases
Sort
View
IDEAS
2005
IEEE
137views Database» more  IDEAS 2005»
14 years 2 months ago
Order-Sensitive XML Query Processing over Relational Sources: An Algebraic Approach
The XML data is order-sensitive. The order problem, that is how ordered XML documents and order-sensitive queries over it can be efficiently supported when mapped into the unorde...
Ling Wang, Song Wang, Brian Murphy, Elke A. Runden...
DGO
2007
192views Education» more  DGO 2007»
13 years 10 months ago
D-HOTM: distributed higher order text mining
We present D-HOTM, a framework for Distributed Higher Order Text Mining based on named entities extracted from textual data that are stored in distributed relational databases. Unl...
William M. Pottenger
SSDBM
2005
IEEE
184views Database» more  SSDBM 2005»
14 years 2 months ago
Optimizing Multiple Top-K Queries over Joins
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a pr...
Dirk Habich, Wolfgang Lehner, Alexander Hinneburg
SIGMOD
2005
ACM
89views Database» more  SIGMOD 2005»
14 years 2 months ago
Stacked indexed views in microsoft SQL server
Appropriately selected materialized views (also called indexed views) can speed up query execution by orders of magnitude. Most database systems limit support for materialized vie...
David DeHaan, Per-Åke Larson, Jingren Zhou
KDD
2004
ACM
159views Data Mining» more  KDD 2004»
14 years 2 months ago
Optimal randomization for privacy preserving data mining
Randomization is an economical and efficient approach for privacy preserving data mining (PPDM). In order to guarantee the performance of data mining and the protection of individ...
Michael Yu Zhu, Lei Liu