Sciweavers

664 search results - page 48 / 133
» Generalized Search Trees for Database Systems
Sort
View
SIGMOD
2010
ACM
196views Database» more  SIGMOD 2010»
15 years 8 months ago
Connected substructure similarity search
Substructure similarity search is to retrieve graphs that approximately contain a given query graph. It has many applications, e.g., detecting similar functions among chemical com...
Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu...
EDBT
2010
ACM
210views Database» more  EDBT 2010»
15 years 6 months ago
Keyword search for data-centric XML collections with long text fields
Users who are unfamiliar with database query languages can search XML data sets using keyword queries. Current approaches for supporting such queries are either for textcentric XM...
Arash Termehchy, Marianne Winslett
SIGMOD
2007
ACM
145views Database» more  SIGMOD 2007»
16 years 4 months ago
Why off-the-shelf RDBMSs are better at XPath than you might expect
To compensate for the inherent impedance mismatch between the relational data model (tables of tuples) and XML (ordered, unranked trees), tree join algorithms have become the prev...
Torsten Grust, Jan Rittinger, Jens Teubner
IDEAS
2003
IEEE
106views Database» more  IDEAS 2003»
15 years 9 months ago
Frequent Itemsets Mining for Database Auto-Administration
With the wide development of databases in general and data warehouses in particular, it is important to reduce the tasks that a database administrator must perform manually. The a...
Kamel Aouiche, Jérôme Darmont, Le Gru...
WEBDB
2001
Springer
137views Database» more  WEBDB 2001»
15 years 9 months ago
Using Database Technology to Improve Performance of Web Proxy Servers
In this paper, we propose to use database technology to improve performance of web proxy servers. We view the cache at a proxy server as a web warehouse with data organized in a h...
Kai Cheng, Yahiko Kambayashi, Mukesh K. Mohania