Sciweavers

1756 search results - page 88 / 352
» Mining Query Logs
Sort
View
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 10 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi
PVLDB
2010
135views more  PVLDB 2010»
13 years 8 months ago
Similarity Search and Mining in Uncertain Databases
Managing, searching and mining uncertain data has achieved much attention in the database community recently due to new sensor technologies and new ways of collecting data. There ...
Matthias Renz, Reynold Cheng, Hans-Peter Kriegel, ...
OOPSLA
2005
Springer
14 years 3 months ago
CodeQuest: querying source code with datalog
We describe CodeQuest, a system for querying source code. It combines two previous proposals, namely the use of logic programming and database system. Experiments (on projects ran...
Elnar Hajiyev, Mathieu Verbaere, Oege de Moor, Kri...
PSD
2004
Springer
186views Database» more  PSD 2004»
14 years 3 months ago
Privacy Preserving and Data Mining in an On-Line Statistical Database of Additive Type
In an on-line statistical database, the query-answering system should prevent answers to statistical queries from leading to disclosure of confidential data. On the other hand, a s...
Francesco M. Malvestuto, Mauro Mezzini
KDD
2009
ACM
248views Data Mining» more  KDD 2009»
14 years 2 months ago
PSkip: estimating relevance ranking quality from web search clickthrough data
1 In this article, we report our efforts in mining the information encoded as clickthrough data in the server logs to evaluate and monitor the relevance ranking quality of a commer...
Kuansan Wang, Toby Walker, Zijian Zheng