We investigate the complexity of earliest query answering for n-ary node selection queries defined by streaming tree automata (STAs). We elaborate an algorithm that selects query ...
High-Throughput Docking has emerged as a well establish method for identifying lead components in the process of searching for new drugs. The High-Throughput Docking Service provi...
Joseph Gill, Legand L. Burge III, Zengjian Hu, Wil...
: Recursive queries are required in many object-oriented database applications. Among them we can mention Bill-Of-Material (BOM), stock market dependencies, various kinds of networ...
Tomasz Pieciukiewicz, Krzysztof Stencel, Kazimierz...
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Abstract. We describe a suite of standards, resources and tools for computational encoding and processing of Modern Hebrew texts. These include an array of XML schemas for represen...