Sciweavers

148 search results - page 26 / 30
» Evaluation of Queries on Tree-Structured Data Using Dimensio...
Sort
View
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
14 years 2 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
SEMWEB
2009
Springer
14 years 2 months ago
Functions over RDF Language Elements
Spreadsheet tools are often used in business and private scenarios in order to collect and store data, and to explore and analyze these data by executing functions and aggregation...
Bernhard Schandl
EDBT
2000
ACM
13 years 12 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
SIGMOD
2007
ACM
187views Database» more  SIGMOD 2007»
14 years 7 months ago
P-ring: an efficient and robust P2P range index structure
Data availability, collection and storage have increased dramatically in recent years, raising new technological and algorithmic challenges for database design and data management...
Adina Crainiceanu, Prakash Linga, Ashwin Machanava...
DATAMINE
2002
104views more  DATAMINE 2002»
13 years 7 months ago
Cubegrades: Generalizing Association Rules
Cubegrades are generalization of association rules which represent how a set of measures (aggregates) is affected by modifying a cube through specialization (rolldown), generaliza...
Tomasz Imielinski, Leonid Khachiyan, Amin Abdulgha...