Sciweavers

1675 search results - page 221 / 335
» Implementing Data Cubes Efficiently
Sort
View
216
Voted
ICDE
2006
IEEE
196views Database» more  ICDE 2006»
16 years 4 months ago
Closure-Tree: An Index Structure for Graph Queries
Graphs have become popular for modeling structured data. As a result, graph queries are becoming common and graph indexing has come to play an essential role in query processing. ...
Huahai He, Ambuj K. Singh
207
Voted
ICDE
1999
IEEE
106views Database» more  ICDE 1999»
16 years 4 months ago
Processing Operations with Restrictions in RDBMS without External Sorting: The Tetris Algorithm
Most operations of the relational algebra or SQL require a sorted stream of tuples for efficient processing. Therefore, processing complex relational queries relies on efficient a...
Volker Markl, Martin Zirkel, Rudolf Bayer
SIGMOD
2003
ACM
115views Database» more  SIGMOD 2003»
16 years 3 months ago
Querying Structured Text in an XML Database
XML databases often contain documents comprising structured text. Therefore, it is important to integrate "information retrieval style" query evaluation, which is well-s...
Shurug Al-Khalifa, Cong Yu, H. V. Jagadish
PODS
2003
ACM
158views Database» more  PODS 2003»
16 years 3 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
ISCAS
2008
IEEE
110views Hardware» more  ISCAS 2008»
15 years 10 months ago
Distortion calculation of an asynchronous switching xDSL line-driver
Abstract—Since the xDSL specifications impose stringent linearity requirements to ensure the integrity of the data transferred, current line drivers use linear amplifiers. The do...
Vincent De Gezelle, Jordie Buyle, Jan Doutreloigne