Cuanto tiempo tarda normalmente en instalarse oracle 18c en linux mint?

estoy intentando instalar oracle xe 18c en linux mint, aparentemente corre bien, pero no esta pasando del siguiente punto

Specify a password to be used for database accounts. Oracle recommends that the password entered should be at least 8 characters in length, contain at least 1 uppercase character, 1 lower case character and 1 digit [0-9]. Note that the same password will be used for SYS, SYSTEM and PDBADMIN accounts: Confirm the password: Configuring Oracle Listener. Listener configuration succeeded. Configuring Oracle Database XE. Introduzca la contraseña de usuario SYS:  ************** Introduzca la contraseña de usuario SYSTEM:  ************** Introduzca la contraseña de usuario de PDBADMIN:  ************* Preparar para funcionamiento de base de datos 7% finalizado Copiando archivos de base de datos 

Continua allí hace como 15 minutos, mi duda es si el tiempo de instalación es largo y solo debo tener paciencia o algo posiblemente ande mal?

Crear desde cero una base de datos oracle en servidor remoto

Saluds a todos.

Estoy haciendo un programa indeoendiente de la base de datos, utilizando System.Data.Common, DBProviderfactory, etc; necesito crear desde cero una base de datos en un servidor oracle, y posteriormente crear las tablas, procedimientos almacenados y funciones; el programa se ejecuta desde una ubicación distinta al servidor oracle. Esto ya lo he hecho con un servidor SQL Server y ahora necesito hacerlo con oracle.

No tengo ninguna experiencia trabajando con oracle, sólo lo he utilizado para conectarme a basse de datos ya existentes y manipular registros.

He visto un ejemplo en un post anterior, pero en este post utilizan un servidor local, es decir, que el programa está en el mismo ordenador que oracle.

Este es el enlace al Post:

Create Oracle database and schema programmatically ADO.NET

Como se puede ver en el post anterior, la ubicación de la ruta de oradata es local:

string oracleDataPath = "C:\PATH_TO_ORADATA\"; 

Yo necesito hacer lo mismo pero direccionándolo a un servidor remoto.

Gracias de antemano por la ayuda que me puedan brindar.

Oracle – loop through list of databases to check status

I have a table with database names and connection strings. Do you know any method to loop through the list of database names (and/or the connection details) and test database connectivity (just need to know if database is up)? The only problem is that I do not have DBLinks pointing to these databases, but we do use OID if that could be of any help/use.

Thanks!

Conexion Access 2016 Oracle 12G Enterprise

Me han dado credenciales de acceso para conectarme a una base de datos Oracle 12G Enterprise 64BITS (Solo Lectura)

Necesito vincular las tablas de esa base de datos via ODBC desde Access 2016.

He visto algunas instrucciones usando el controlador de access “ODBC for Oracle” pero al intentar usarlo este me lanza error, entonces tengo que instalar algu driver adicional?

Pueden ayudarme a realizar la conexion?

introducir la descripción de la imagen aquí

Which is harder, an NP-complete problem or the Raz-Tal oracle problem?

This is a (hopefully) sharper version of a question that I asked previously.

Which of these algorithms is believed to have a longer asymptotic runtime?

  1. The optimal algorithm guaranteed to solve some NP-complete problem using a standard Turing machine.
  2. The optimal algorithm guaranteed to solve the problem described by Raz and Tal using a Turing machine with access to the oracle described in their paper. (This is the oracle $ O$ that achieves the oracle separation $ \mathrm{BQP}^O \nsubseteq \mathrm{PH}^O$ .)

(I understand that this is somewhat of an “apples-to-orange” comparison because the two Turing machines have different capabilities, but you can still compare the algorithm runtimes.)

Figure 3 of this essay suggests to me that NP-complete problems are much “harder” than BQP-complete problems, which would seem to suggest that algorithm 1 would need to take longer than algorithm 2. But Raz and Tal’s result seems to identify an oracle problem in BQP that is outside of the entire polynomial hierarchy (including all of NP), which would seem to suggest that algorithm 2 would need to take longer than algorithm 1. Which of these intuitions is/are incorrect?

How strong is an oracle that avoid don’t-halt

Consider such an oracle:

Given a turing machine[1], return the halting state it falls on, or arbitary result(but don’t stuck in) if the TM doesn’t halt.

  1. How strong is a TM with the oracle?
  2. Can the oracle exist(or does the question always have an answer) if change [1] into a TM with the oracle?

Some results I get:

  1. It’s as strong as a TM with oracle that compare running time of two programs, or arbitary returned value if both don’t halt.
  2. If the oracle returns integer the TM returns(may need to define a way it outputs integer), or arbitary integer if it doesn’t halt, we can solve the halting problem by getting the runtime and check. However, currently I can’t output from the oracle a string of any finite length if the length can be arbitary long, promising it’s finite.

(Moved to here)

How to quercy exactly 1 year date differences with LEAD and partition by in oracle sql

I am quite beginner in oracle sql, and i am trying to solve some competitive tasks in my freetime. I have come upon one query that i am struggling with.

The task is to get the same occurences of values in 3 different columns, and get them only if the time difference is exactly 1 year. for eg: if there are two rows, and one is for example :2019.01.01 and 2018.01.01 thats good, but if theres another row for the same triplets and a date with 2018.05.05. then the above two is an incorrect solution, cause theres another record between them. but 2017.01.01 , 2018.01.01. and 2019.01.01 is an acceptalbe solution.

The task asks me to use the LEAD analytic function with a partition by following up

A very similar task was almost the same, with the difference that it didnt matter if they had another row between the 1 year difference, my solution for that if it might help understanding my problem is something like this:

select DISTINCT a.user_code, a.item_code, a.selling_method, a.time, b.time from task_table a, task_table b where (a.user_code, a.item_code, a.selling_method) in( select user_code, item_code, selling_method from task_table group by user_code, item_code, selling_method having count(*) > 2 ) and ADD_MONTHS(a.time, 12) = b.time order by user_code, item_code, selling_method; 

Theres 1 million record in the table, and you have to get the rows where the usercode, itemcode and sellingmethod triplet are the same, and it is getting mixed with some extra stuff, so basically what i am looking for now is: EDIT: there have to be more than 2 occurences of the same triplets

usercode 5 itemcode 4 sellingmethod 3 time:2018.01.01 usercode 5 itemcode 4 sellingmethod 3 time:2017.01.01 usercode 5 itemcode 4 sellingmethod 3 time:2016.01.01 

and there are no usercode itemcode sellingmethod with values 5 ,4 and 3 with dates inbetween two of them

I can mostly understand the LEAD function by reading documentation, but i’ve been struggling to make a good query for hours