Sciweavers

649 search results - page 99 / 130
» Improved and Optimized Partitioning Techniques in Database Q...
Sort
View
EDBT
2009
ACM
118views Database» more  EDBT 2009»
15 years 8 months ago
Optimized union of non-disjoint distributed data sets
In a variety of applications, ranging from data integration to distributed query evaluation, there is a need to obtain sets of data items from several sources (peers) and compute ...
Itay Dar, Tova Milo, Elad Verbin
SSDBM
1999
IEEE
118views Database» more  SSDBM 1999»
15 years 6 months ago
Evaluation of Ad Hoc OLAP: In-Place Computation
Large scale data analysis and mining activities, such as identifying interesting trends, making unusual patterns to stand out and verifying hypotheses, require sophisticated infor...
Damianos Chatziantoniou
XSYM
2004
Springer
108views Database» more  XSYM 2004»
15 years 7 months ago
XIST: An XML Index Selection Tool
XML indices are essential for efficiently processing XML queries which typically have predicates on both structures and values. Since the number of all possible structural and val...
Kanda Runapongsa, Jignesh M. Patel, Rajesh Bordawe...
CIKM
2008
Springer
15 years 3 months ago
A heuristic approach for checking containment of generalized tree-pattern queries
Query processing techniques for XML data have focused mainly on tree-pattern queries (TPQs). However, the need for querying XML data sources whose structure is very complex or not...
Pawel Placek, Dimitri Theodoratos, Stefanos Soulda...
CINQ
2004
Springer
163views Database» more  CINQ 2004»
15 years 7 months ago
Frequent Itemset Discovery with SQL Using Universal Quantification
Algorithms for finding frequent itemsets fall into two broad classes: (1) algorithms that are based on non-trivial SQL statements to query and update a database, and (2) algorithms...
Ralf Rantzau