Sciweavers

591 search results - page 66 / 119
» The complexity of XPath query evaluation
Sort
View
MOBIDE
2010
ACM
13 years 9 months ago
Power-aware operator placement and broadcasting of continuous query results
Complex event detection over data streams has become ubiquitous through the widespread use of sensors, wireless connectivity and the wide variety of end-user mobile devices. Typic...
Panayiotis Neophytou, Mohamed A. Sharaf, Panos K. ...
ICDE
2011
IEEE
263views Database» more  ICDE 2011»
13 years 12 days ago
Adding regular expressions to graph reachability and pattern queries
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
CIDR
2003
106views Algorithms» more  CIDR 2003»
13 years 10 months ago
Speculative Query Processing
Speculation is an every day phenomenon whereby one acts in anticipation of particular conditions that are likely to hold in the future. Computer science research has seen many suc...
Neoklis Polyzotis, Yannis E. Ioannidis
SIGMOD
2006
ACM
170views Database» more  SIGMOD 2006»
14 years 8 months ago
Energy-efficient monitoring of extreme values in sensor networks
Monitoring extreme values (MAX or MIN) is a fundamental problem in wireless sensor networks (and in general, complex dynamic systems). This problem presents very different algorit...
Adam Silberstein, Jun Yang 0001, Kamesh Munagala
ASUNAM
2011
IEEE
12 years 8 months ago
Probabilistic Subgraph Matching on Huge Social Networks
—Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the dat...
Matthias Bröcheler, Andrea Pugliese, V. S. Su...