Sciweavers

958 search results - page 72 / 192
» Efficient data structures for range-aggregate queries on tre...
Sort
View
109
Voted
ADC
2003
Springer
182views Database» more  ADC 2003»
15 years 3 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
69
Voted
AHSWN
2010
103views more  AHSWN 2010»
14 years 10 months ago
Efficient Data Retrieving in Distributed Data-streaming Environments
In a potential distributed application, Automobile Tracking System (ATS), automobile location data is continuously generated, kept in a distributed manner. As large amount of traff...
Jinsong Han, Jun Miao, Jizhong Zhao, Jinpeng Huai,...
PODS
2006
ACM
98views Database» more  PODS 2006»
15 years 10 months ago
Two-variable logic on data trees and XML reasoning
d Abstract] Mikolaj Boja?nczyk Faculty of Mathematics, Informatics and Mechanics Warsaw University Poland Claire David LIAFA Universit?e Paris 7 France Anca Muscholl LIAFA Universi...
Mikolaj Bojanczyk, Claire David, Anca Muscholl, Th...
100
Voted
ADBIS
1994
Springer
87views Database» more  ADBIS 1994»
15 years 2 months ago
Variations of R-Tree Structure for Indexing of Spatial Objects
The data structures suitable for indexing of large spatial objects in databases are considered. Some generalizations of existing tree methods concerned approximation of spatial ob...
M. G. Martynov
89
Voted
SIGMOD
2004
ACM
163views Database» more  SIGMOD 2004»
15 years 10 months ago
FleXPath: Flexible Structure and Full-Text Querying for XML
Querying XML data is a well-explored topic with powerful databasestyle query languages such as XPath and XQuery set to become W3C standards. An equally compelling paradigm for que...
Sihem Amer-Yahia, Laks V. S. Lakshmanan, Shashank ...