Sciweavers

1168 search results - page 145 / 234
» Optimization strategies for complex queries
Sort
View
SIGMOD
2007
ACM
120views Database» more  SIGMOD 2007»
15 years 10 months ago
Xpath on steroids: exploiting relational engines for xpath performance
A lot of research has been conducted by the database community on methods and techniques for efficient XPath processing, with great success. Despite the progress made, significant...
Haris Georgiadis, Vasilis Vassalos
EDBT
2009
ACM
241views Database» more  EDBT 2009»
15 years 5 months ago
GADDI: distance index based subgraph matching in biological networks
Currently, a huge amount of biological data can be naturally represented by graphs, e.g., protein interaction networks, gene regulatory networks, etc. The need for indexing large ...
Shijie Zhang, Shirong Li, Jiong Yang
GIS
1999
ACM
15 years 2 months ago
A Provably Efficient Computational Model for Approximate Spatiotemporal Retrieval
: The paper is concerned with the effective and efficient processing of spatiotemporal selection queries under varying degrees of approximation. Such queries may employ operators l...
Vasilis Delis, Christos Makris, Spyros Sioutas
ATAL
2007
Springer
15 years 4 months ago
Approximate and online multi-issue negotiation
This paper analyzes bilateral multi-issue negotiation between selfinterested autonomous agents. The agents have time constraints in the form of both deadlines and discount factors...
S. Shaheen Fatima, Michael Wooldridge, Nicholas R....
CORR
2006
Springer
151views Education» more  CORR 2006»
14 years 10 months ago
High SNR Analysis for MIMO Broadcast Channels: Dirty Paper Coding vs. Linear Precoding
We study the MIMO broadcast channel and compare the achievable throughput for the optimal strategy of dirty paper coding to that achieved with sub-optimal and lower complexity lin...
Juyul Lee, Nihar Jindal