Sciweavers

491 search results - page 72 / 99
» Optimizing Large OODB Queries
Sort
View
HIS
2008
13 years 9 months ago
Implicit User Modelling Using Hybrid Meta-Heuristics
The requirements imposed on information retrieval systems are increasing steadily. The vast number of documents in today's large databases and especially on World Wide Web ca...
Pavel Krömer, Václav Snásel, Ja...
VLDB
2005
ACM
162views Database» more  VLDB 2005»
14 years 1 months ago
XQuery Implementation in a Relational Database System
Many enterprise applications prefer to store XML data as a rich data type, i.e. a sequence of bytes, in a relational database system to avoid the complexity of decomposing the dat...
Shankar Pal, Istvan Cseri, Oliver Seeliger, Michae...
DEBU
2010
128views more  DEBU 2010»
13 years 5 months ago
Panda: A System for Provenance and Data
Panda (for Provenance and Data) is a new project whose goal is to develop a general-purpose system that unifies concepts from existing provenance systems and overcomes some limita...
Robert Ikeda, Jennifer Widom
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
14 years 1 months ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
14 years 8 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek