Sciweavers

3652 search results - page 520 / 731
» A study of query length
Sort
View
DASFAA
2007
IEEE
191views Database» more  DASFAA 2007»
15 years 10 months ago
ABIDE: A Bid-Based Economic Incentive Model for Enticing Non-cooperative Peers in Mobile-P2P Networks
In mobile ad-hoc peer-to-peer (M-P2P) networks, a large percentage of the mobile peers typically do not provide any service to the network, thereby motivating incentive schemes for...
Anirban Mondal, Sanjay Kumar Madria, Masaru Kitsur...
DBPL
2007
Springer
103views Database» more  DBPL 2007»
15 years 10 months ago
Datalog Programs over Infinite Databases, Revisited
Traditionally, infinite databases were studied as a data model for queries that may contain function symbols (since functions may be expressed as infinite relations). Recently, th...
Sara Cohen, Joseph Gil, Evelina Zarivach
ESOP
2009
Springer
15 years 10 months ago
An Efficient Algorithm for Solving the Dyck-CFL Reachability Problem on Trees
The context-free language (CFL) reachability problem is well known and studied in computer science, as a fundamental problem underlying many important static analyses such as point...
Hao Yuan, Patrick Th. Eugster
CINQ
2004
Springer
116views Database» more  CINQ 2004»
15 years 10 months ago
A Survey on Condensed Representations for Frequent Sets
Abstract. Solving inductive queries which have to return complete collections of patterns satisfying a given predicate has been studied extensively the last few years. The specific...
Toon Calders, Christophe Rigotti, Jean-Franç...
CINQ
2004
Springer
157views Database» more  CINQ 2004»
15 years 10 months ago
Inductive Databases and Multiple Uses of Frequent Itemsets: The cInQ Approach
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
Jean-François Boulicaut