Sciweavers

492 search results - page 44 / 99
» Querying with Intrinsic Preferences
Sort
View
CC
2010
Springer
141views System Software» more  CC 2010»
14 years 4 months ago
JReq: Database Queries in Imperative Languages
Instead of writing SQL queries directly, programmers often prefer writing all their code in a general purpose programming language like Java and having their programs be automatica...
Ming-Yee Iu, Emmanuel Cecchet, Willy Zwaenepoel
PDP
2008
IEEE
14 years 4 months ago
Load Balancing Distributed Inverted Files: Query Ranking
Search engines use inverted files as index data structures to speed up the solution of user queries. The index is distributed on a set of processors forming a cluster of computer...
Carlos Gomez-Pantoja, Mauricio Marín
KDD
2010
ACM
214views Data Mining» more  KDD 2010»
14 years 1 months ago
Neighbor query friendly compression of social networks
Compressing social networks can substantially facilitate mining and advanced analysis of large social networks. Preferably, social networks should be compressed in a way that they...
Hossein Maserrat, Jian Pei
SIGMOD
2007
ACM
160views Database» more  SIGMOD 2007»
14 years 10 months ago
Supporting ranking and clustering as generalized order-by and group-by
The Boolean semantics of SQL queries cannot adequately capture the "fuzzy" preferences and "soft" criteria required in non-traditional data retrieval applicati...
Chengkai Li, Min Wang, Lipyeow Lim, Haixun Wang, K...
SCCC
1997
IEEE
14 years 2 months ago
Reactive Ranking for Cooperative Databases
A cooperative database allows the user to specify approximate or vague query conditions. A vague query requires the database system to rank the retrieved answers according to thei...
Berthier A. Ribeiro-Neto, Guilherme T. de Assis