Sciweavers

2778 search results - page 300 / 556
» Limit complexities revisited
Sort
View
PODS
2008
ACM
123views Database» more  PODS 2008»
16 years 6 months ago
Evaluating rank joins with optimal cost
In the rank join problem, we are given a set of relations and a scoring function, and the goal is to return the join results with the top K scores. It is often the case in practic...
Karl Schnaitter, Neoklis Polyzotis
EDBT
2004
ACM
172views Database» more  EDBT 2004»
16 years 6 months ago
Efficient Similarity Search for Hierarchical Data in Large Databases
Structured and semi-structured object representations are getting more and more important for modern database applications. Examples for such data are hierarchical structures inclu...
Karin Kailing, Hans-Peter Kriegel, Stefan Schö...
EDBT
2006
ACM
191views Database» more  EDBT 2006»
16 years 6 months ago
Parallelizing Skyline Queries for Scalable Distribution
Skyline queries help users make intelligent decisions over complex data, where different and often conflicting criteria are considered. Current skyline computation methods are rest...
Ping Wu, Caijie Zhang, Ying Feng, Ben Y. Zhao, Div...
PERCOM
2007
ACM
16 years 6 months ago
Middleware Support for Quality of Context in Pervasive Context-Aware Systems
Middleware support for pervasive context-aware systems relieves context-aware applications from dealing with the complexity of context-specific operations such as context acquisit...
Kamran Sheikh, Maarten Wegdam, Marten van Sinderen
PERCOM
2007
ACM
16 years 6 months ago
SOS: Secure Overlay Sensornets
Overlay Networks (ONs) are logical networks built on top of a physical network with the aim of moving part of the routing complexity to the application layer. At the same time, sen...
Leonardo B. Oliveira, Antonio Alfredo Ferreira Lou...