613 search results - page 14 / 123 » Query Evaluation on a Database Given by a Random Graph |
100
click to vote
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
Our world today is generating huge amounts of graph data such as social networks, biological networks, and the semantic web. Many of these real-world graphs are edge-labeled graph...
229
click to vote
ICDE
2008
IEEE
16 years 3 months ago
2008
IEEE
The overwhelming flow of information in many data stream applications forces many companies to outsource to a third-party the deployment of a Data Stream Management System (DSMS) f...
CIKM
2009
Springer
15 years 8 months ago
2009
Springer
Given an author-conference graph, how do we answer proximity queries (e.g., what are the most related conferences for John Smith?); how can we tailor the search result if the user...
124
click to vote
PODS
2010
ACM
15 years 3 months ago
2010
ACM
We study highly expressive query languages such as datalog, fixpoint, and while-languages on probabilistic databases. We generalize these languages such that computation steps (e....
206
click to vote
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...