Sciweavers

710 search results - page 123 / 142
» Efficiency of Nested Relational Document Database Systems
Sort
View
SIGMOD
2004
ACM
199views Database» more  SIGMOD 2004»
15 years 12 months ago
Approximate XML Query Answers
The rapid adoption of XML as the standard for data representation and exchange foreshadows a massive increase in the amounts of XML data collected, maintained, and queried over th...
Neoklis Polyzotis, Minos N. Garofalakis, Yannis E....
WWW
2003
ACM
16 years 11 days ago
ODISSEA: A Peer-to-Peer Architecture for Scalable Web Search and Information Retrieval
We consider the problem of building a P2P-based search engine for massive document collections. We describe a prototype system called ODISSEA (Open DIStributed Search Engine Archi...
Torsten Suel, Chandan Mathur, Jo-wen Wu, Jiangong ...
WWW
2004
ACM
16 years 11 days ago
Web data integration using approximate string join
Web data integration is an important preprocessing step for web mining. It is highly likely that several records on the web whose textual representations differ may represent the ...
Yingping Huang, Gregory R. Madey
SIGMOD
1996
ACM
109views Database» more  SIGMOD 1996»
15 years 3 months ago
Improved Histograms for Selectivity Estimation of Range Predicates
Many commercial database systems maintain histograms to summarize the contents of relations and permit efficient estimation of query result sizes and access plan costs. Although s...
Viswanath Poosala, Yannis E. Ioannidis, Peter J. H...
VLDB
2002
ACM
98views Database» more  VLDB 2002»
14 years 11 months ago
Processing Star Queries on Hierarchically-Clustered Fact Tables
Star queries are the most prevalent kind of queries in data warehousing, OLAP and business intelligence applications. Thus, there is an imperative need for efficiently processing ...
Nikos Karayannidis, Aris Tsois, Timos K. Sellis, R...