Sciweavers

439 search results - page 71 / 88
» Unnesting Arbitrary Queries
Sort
View
KDD
2006
ACM
143views Data Mining» more  KDD 2006»
14 years 10 months ago
Algorithms for discovering bucket orders from data
Ordering and ranking items of different types are important tasks in various applications, such as query processing and scientific data mining. A total order for the items can be ...
Aristides Gionis, Heikki Mannila, Kai Puolamä...
VLDB
2007
ACM
130views Database» more  VLDB 2007»
14 years 10 months ago
A Simple and Efficient Estimation Method for Stream Expression Cardinalities
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
Aiyou Chen, Jin Cao, Tian Bu
SIGMOD
2008
ACM
131views Database» more  SIGMOD 2008»
14 years 10 months ago
Orion 2.0: native support for uncertain data
Orion is a state-of-the-art uncertain database management system with built-in support for probabilistic data as first class data types. In contrast to other uncertain databases, ...
Sarvjeet Singh, Chris Mayfield, Sagar Mittal, Suni...
PODS
2003
ACM
158views Database» more  PODS 2003»
14 years 10 months ago
Computing full disjunctions
Full disjunctions are an associative extension of the outerjoin operator to an arbitrary number of relations. Their main advantage is the ability to maximally combine data from di...
Yaron Kanza, Yehoshua Sagiv
PODS
2005
ACM
99views Database» more  PODS 2005»
14 years 10 months ago
XML type checking with macro tree transducers
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
Sebastian Maneth, Alexandru Berlea, Thomas Perst, ...