Abstract: In a computer embodiment, in a polyglot database management system (DBMS) that contains a guest language runtime environment, a database buffer is configured that the guest language runtime environment does not manage. In the polyglot DBMS, logic that is defined in a guest language is invoked to retrieve, into the database buffer, a value stored in a database in the polyglot DBMS. Compiling the logic causes semantic analyzing the logic to detect that usage of the retrieved value cannot occur after the retrieved value is overwritten in the database buffer. When detecting that such usage of the retrieved value cannot occur, the logic is executed without, after the retrieved value is overwritten in the database buffer, retaining a copy of the retrieved value in a memory region that the guest language runtime environment manages.

Abstract: Techniques for compressing a data set in a manner such that the data set is represented as a geometric filter are disclosed. Here, the geometric filter has a small memory footprint, thereby enabling the data set to be indexable without consuming a large amount of memory. One bits can be represented within a bit vector portion of the geometric filter or in an index portion of the geometric filter. Techniques are also provided to determine a level of similarity between two data sets, where the data sets have been compressed such that the data sets are representable as geometric filters. The data sets can be indexed without consuming large amounts of memory, and the similarity determination can be performed rapidly. Approximate minimum spanning trees (MSTs) are also generated to find an optimal compression for the data sets, such that the indexes are smaller and searching operations are faster.

Abstract: Techniques for compressing a data set in a manner such that the data set is represented as a geometric filter are disclosed. Here, the geometric filter has a small memory footprint, thereby enabling the data set to be indexable without consuming a large amount of memory. One bits can be represented within a bit vector portion of the geometric filter or in an index portion of the geometric filter. Techniques are also provided to determine a level of similarity between two data sets, where the data sets have been compressed such that the data sets are representable as geometric filters. The data sets can be indexed without consuming large amounts of memory, and the similarity determination can be performed rapidly. Approximate minimum spanning trees (MSTs) are also generated to find an optimal compression for the data sets, such that the indexes are smaller and searching operations are faster.

Abstract: An information retrieval system uses an inverted indexing system composed of hybrid positional posting lists. A hybrid positional posting list includes a number of postings, where each posting contains a single numeric value to represent both the document containing a term and the location of the term in the document. When the number of postings for a document exceeds a threshold, a single-valued posting represents all the locations of a term in a document and the locations within the document. When the number of postings for a document is less than a threshold, each location of a term and the associated document is represented by a single-valued posting. In this manner, the storage requirements for the inverted indexing system are reduced and the processing speed increased.

Abstract: The invention concerns a digitizing ASIC (3) for an ultrasound scanning unit (2) of an ultrasound system (1), comprising: an array of analogue-to-digital converters (31) adapted to receive ultrasound signals acquired with an ultrasound transducer array and to convert the ultrasound signals into digitized ultrasound data; a memory module (32) operably coupled to the array of analogue-to-digital converters (31) and adapted to store the digitized ultrasound data; a transmitter operably coupled to the memory module (32) and adapted to transfer the digitized ultrasound data stored in the memory module (32) to a remote interface unit (6); and a controller (33) adapted to receive control signals from the interface unit (6), and, responsive to the control signals, configure the operation of components of the ASIC (3) and/or the ultrasound scanning unit (2) by setting operation parameters, wherein the controller (33) is adapted to change operation parameters of the ASIC (3) and/or the ultrasound scanning unit (2) duri

Abstract: The invention is directed to an ultrasound probe (1) configured to be operatively coupled to a cable (10), the cable (10) comprising a plurality of lanes adapted to carry signals between the ultrasound probe (1) and a data processing unit, which is adapted to process the signals, in particular to beamform the signals and to reconstruct ultrasound images of an imaging region. The ultrasonic probe (1) comprises a transducer head comprising a plurality of transducer elements, which are adapted to insonify the imaging region according to an insonification scheme and to receive ultrasound signals, and a controller adapted to, responsive to the information of a faulty lane from a fault detection module adapted to detect integrity of each of the plurality of lanes, redistribute and/or reconfigure the signals carried by the faulty lane onto one or more of the non-faulty lanes.

Abstract: The present invention relates to execution optimization of database queries. Herein are techniques for optimal execution based on query interpretation by translation to a domain specific language (DSL), with optimizations such as partial evaluation, abstract syntax tree (AST) rewriting, just in time (JIT) compilation, dynamic profiling, speculative logic, and Futamura projection. In an embodiment, a database management system (DBMS) that is hosted on a computer generates a query tree that represents a database query that contains an expression that is represented by a subtree of the query tree. The DBMS generates a sequence of DSL instructions that represents the subtree. The sequence of DSL instructions is executed to evaluate the expression during execution of the database query. In an embodiment, an AST is generated from the sequence of DSL instructions. In an embodiment, the DSL AST is optimally rewritten based on a runtime feedback loop that includes dynamic profiling information.

Abstract: Herein are techniques that extend a software system to embed new guest programing languages (GPLs) that interoperate in a transparent, modular, and configurable way. In embodiments, a computer inserts an implementation of a GPL into a deployment of the system. A command registers the GPL, define subroutines for the GPL, generates a guest virtual environment, and adds a binding of a dependency to a guest module. In an embodiment, a native programing language invokes a guest programing language to cause importing intra- or inter-language dependencies. An embodiment defines a guest object that is implemented in a first GPL and accessed from a second GPL. In an embodiment, dependencies are retrieved from a virtual file system having several alternative implementation mechanisms that include: an archive file or an actual file system, and a memory buffer or a column of a database table.

Abstract: The present invention relates to execution optimization of database queries. Herein are techniques for optimal execution based on query interpretation by translation to a domain specific language (DSL), with optimizations such as partial evaluation, abstract syntax tree (AST) rewriting, just in time (JIT) compilation, dynamic profiling, speculative logic, and Futamura projection. In an embodiment, a database management system (DBMS) that is hosted on a computer generates a query tree that represents a database query that contains an expression that is represented by a subtree of the query tree. The DBMS generates a sequence of DSL instructions that represents the subtree. The sequence of DSL instructions is executed to evaluate the expression during execution of the database query. In an embodiment, an AST is generated from the sequence of DSL instructions. In an embodiment, the DSL AST is optimally rewritten based on a runtime feedback loop that includes dynamic profiling information.

Abstract: An ultrasound imaging catheter comprises an ultrasound transducer array provided at a distal end of an ultrasound imaging catheter. The ultrasound transducer array comprises a plurality of ultrasound transducers and is adapted to transmit and receive ultrasound signals. The ultrasound imaging catheter includes a local memory provided at the distal end of the ultrasound imaging catheter. The local memory is adapted to store a plurality of activation patterns, each activation pattern corresponding to a number of transducer elements of the plurality of transducer elements to be activated and a number of transducer elements of the plurality of transducer elements to be deactivated.

Abstract: The present invention relates to execution optimization of database queries. Herein are techniques for optimal execution based on query interpretation by translation to a domain specific language (DSL), with optimizations such as partial evaluation, abstract syntax tree (AST) rewriting, just in time (JIT) compilation, dynamic profiling, speculative logic, and Futamura projection. In an embodiment, a database management system (DBMS) that is hosted on a computer generates a query tree that represents a database query that contains an expression that is represented by a subtree of the query tree. The DBMS generates a sequence of DSL instructions that represents the subtree. The sequence of DSL instructions is executed to evaluate the expression during execution of the database query. In an embodiment, an AST is generated from the sequence of DSL instructions. In an embodiment, the DSL AST is optimally rewritten based on a runtime feedback loop that includes dynamic profiling information.

Abstract: Herein are computerized techniques for deploying JavaScript and TypeScript stored procedures and user-defined functions into a database management system (DBMS). In an embodiment, a computer generates a SQL call specification for each subroutine of one or more subroutines encoded in a scripting language. The generating is based on a signature declaration of the subroutine. Each subroutine comprises a definition of a stored procedure or a user-defined function. The computer packages the definition and the SQL call specification of each subroutine into a single bundle file. The definition and the SQL call specification of each subroutine are deployed into a DBMS from the single bundle file. Eventually, the SQL call specification of at least one subroutine is invoked to execute the definition of the subroutine in the DBMS.

Abstract: Herein are techniques that extend a software system to embed new guest programing languages (GPLs) that interoperate in a transparent, modular, and configurable way. In embodiments, a computer inserts an implementation of a GPL into a deployment of the system. A command registers the GPL, define subroutines for the GPL, generates a guest virtual environment, and adds a binding of a dependency to a guest module. In an embodiment, a native programing language invokes a guest programing language to cause importing intra- or inter-language dependencies. An embodiment defines a guest object that is implemented in a first GPL and accessed from a second GPL. In an embodiment, dependencies are retrieved from a virtual file system having several alternative implementation mechanisms that include: an archive file or an actual file system, and a memory buffer or a column of a database table.

Abstract: The present invention relates to data manipulation language (DML) acceleration. Herein are database techniques to use value range analysis and range-limited execution operators when a value is excluded. In an embodiment, a computer receives a data access request that specifies an expression that includes operator(s), including a particular operator that has argument(s) that has only three possible values. Before detecting the actual value of a particular argument, the computer detects that a particular value of the three possible values is excluded for the particular argument. Responsively, an implementation of the particular operator that never accepts the particular value for the particular argument is selected. Applying the expression to fulfil the data access request entails invoking the selected implementation of the particular operator.

Abstract: The present invention relates to data manipulation language (DML) acceleration. Herein are database techniques to use value range analysis and range-limited execution operators when a value is excluded. In an embodiment, a computer receives a data access request that specifies an expression that includes operator(s), including a particular operator that has argument(s) that has only three possible values. Before detecting the actual value of a particular argument, the computer detects that a particular value of the three possible values is excluded for the particular argument. Responsively, an implementation of the particular operator that never accepts the particular value for the particular argument is selected. Applying the expression to fulfil the data access request entails invoking the selected implementation of the particular operator.

Abstract: Herein are techniques that extend a software system to embed new guest programing languages (GPLs) that interoperate in a transparent, modular, and configurable way. In embodiments, a computer inserts an implementation of a GPL into a deployment of the system. A command registers the GPL, define subroutines for the GPL, generates a guest virtual environment, and adds a binding of a dependency to a guest module. In an embodiment, a native programing language invokes a guest programing language to cause importing intra- or inter-language dependencies. An embodiment defines a guest object that is implemented in a first GPL and accessed from a second GPL. In an embodiment, dependencies are retrieved from a virtual file system having several alternative implementation mechanisms that include: an archive file or an actual file system, and a memory buffer or a column of a database table.

Abstract: Herein are techniques that extend a software system to embed new guest programing languages (GPLs) that interoperate in a transparent, modular, and configurable way. In embodiments, a computer inserts an implementation of a GPL into a deployment of the system. A command registers the GPL, define subroutines for the GPL, generates a guest virtual environment, and adds a binding of a dependency to a guest module. In an embodiment, a native programing language invokes a guest programing language to cause importing intra- or inter-language dependencies. An embodiment defines a guest object that is implemented in a first GPL and accessed from a second GPL. In an embodiment, dependencies are retrieved from a virtual file system having several alternative implementation mechanisms that include: an archive file or an actual file system, and a memory buffer or a column of a database table.

Abstract: Herein are techniques that extend a software system to embed new guest programing languages (GPLs) that interoperate in a transparent, modular, and configurable way. In embodiments, a computer inserts an implementation of a GPL into a deployment of the system. A command registers the GPL, define subroutines for the GPL, generates a guest virtual environment, and adds a binding of a dependency to a guest module. In an embodiment, a native programing language invokes a guest programing language to cause importing intra- or inter-language dependencies. An embodiment defines a guest object that is implemented in a first GPL and accessed from a second GPL. In an embodiment, dependencies are retrieved from a virtual file system having several alternative implementation mechanisms that include: an archive file or an actual file system, and a memory buffer or a column of a database table.

Abstract: The present invention relates to execution optimization of database queries. Herein are techniques for optimal execution based on query interpretation by translation to a domain specific language (DSL), with optimizations such as partial evaluation, abstract syntax tree (AST) rewriting, just in time (JIT) compilation, dynamic profiling, speculative logic, and Futamura projection. In an embodiment, a database management system (DBMS) that is hosted on a computer generates a query tree that represents a database query that contains an expression that is represented by a subtree of the query tree. The DBMS generates a sequence of DSL instructions that represents the subtree. The sequence of DSL instructions is executed to evaluate the expression during execution of the database query. In an embodiment, an AST is generated from the sequence of DSL instructions. In an embodiment, the DSL AST is optimally rewritten based on a runtime feedback loop that includes dynamic profiling information.